java -ea -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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum_array_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:57:14,085 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:57:14,087 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:57:14,099 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:57:14,100 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:57:14,101 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:57:14,102 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:57:14,104 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:57:14,105 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:57:14,106 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:57:14,107 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:57:14,107 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:57:14,108 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:57:14,109 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:57:14,110 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:57:14,111 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:57:14,112 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:57:14,114 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:57:14,116 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:57:14,118 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:57:14,119 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:57:14,120 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:57:14,123 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:57:14,123 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:57:14,123 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:57:14,124 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:57:14,125 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:57:14,126 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:57:14,127 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:57:14,128 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:57:14,128 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:57:14,129 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:57:14,129 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:57:14,130 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:57:14,131 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:57:14,131 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:57:14,132 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 23:57:14,152 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:57:14,152 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:57:14,153 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:57:14,153 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:57:14,154 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:57:14,154 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:57:14,154 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:57:14,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:57:14,155 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:57:14,155 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:57:14,155 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:57:14,155 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:57:14,155 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:57:14,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:57:14,156 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:57:14,156 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:57:14,156 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:57:14,156 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:57:14,156 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:57:14,157 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:57:14,157 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:57:14,157 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:57:14,157 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:57:14,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:57:14,158 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:57:14,158 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:57:14,158 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:57:14,158 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:57:14,158 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:57:14,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:57:14,159 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:57:14,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:57:14,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:57:14,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:57:14,232 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:57:14,232 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:57:14,233 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum_array_false-unreach-call.i [2018-11-18 23:57:14,307 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01f088c8/763a6b0bdfb346019cb26a25a3fe5216/FLAGf091f6df9 [2018-11-18 23:57:14,795 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:57:14,796 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum_array_false-unreach-call.i [2018-11-18 23:57:14,803 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01f088c8/763a6b0bdfb346019cb26a25a3fe5216/FLAGf091f6df9 [2018-11-18 23:57:15,161 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c01f088c8/763a6b0bdfb346019cb26a25a3fe5216 [2018-11-18 23:57:15,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:57:15,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:57:15,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:57:15,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:57:15,178 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:57:15,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:57:15" (1/1) ... [2018-11-18 23:57:15,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f831f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:15, skipping insertion in model container [2018-11-18 23:57:15,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:57:15" (1/1) ... [2018-11-18 23:57:15,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:57:15,216 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:57:15,435 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:57:15,443 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:57:15,489 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:57:15,514 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:57:15,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:15 WrapperNode [2018-11-18 23:57:15,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:57:15,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:57:15,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:57:15,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:57:15,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:15" (1/1) ... [2018-11-18 23:57:15,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:15" (1/1) ... [2018-11-18 23:57:15,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:15" (1/1) ... [2018-11-18 23:57:15,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:15" (1/1) ... [2018-11-18 23:57:15,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:15" (1/1) ... [2018-11-18 23:57:15,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:15" (1/1) ... [2018-11-18 23:57:15,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:15" (1/1) ... [2018-11-18 23:57:15,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:57:15,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:57:15,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:57:15,563 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:57:15,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:15" (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-18 23:57:15,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:57:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:57:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:57:15,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:57:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:57:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:57:15,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:57:15,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 23:57:15,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:57:15,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:57:15,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:57:15,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:57:15,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:57:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:57:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:57:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:57:16,489 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:57:16,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:57:16 BoogieIcfgContainer [2018-11-18 23:57:16,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:57:16,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:57:16,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:57:16,495 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:57:16,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:57:15" (1/3) ... [2018-11-18 23:57:16,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4874b3ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:57:16, skipping insertion in model container [2018-11-18 23:57:16,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:57:15" (2/3) ... [2018-11-18 23:57:16,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4874b3ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:57:16, skipping insertion in model container [2018-11-18 23:57:16,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:57:16" (3/3) ... [2018-11-18 23:57:16,499 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array_false-unreach-call.i [2018-11-18 23:57:16,509 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:57:16,517 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:57:16,531 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:57:16,566 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:57:16,567 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:57:16,567 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:57:16,567 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:57:16,567 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:57:16,568 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:57:16,568 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:57:16,568 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:57:16,569 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:57:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-18 23:57:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 23:57:16,596 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:16,597 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:57:16,600 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:16,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:16,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1430000846, now seen corresponding path program 1 times [2018-11-18 23:57:16,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:16,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:16,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:16,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:16,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:16,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-18 23:57:16,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37#true} is VALID [2018-11-18 23:57:16,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-18 23:57:16,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #81#return; {37#true} is VALID [2018-11-18 23:57:16,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret12 := main(); {37#true} is VALID [2018-11-18 23:57:16,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} ~M~0 := #t~nondet0;havoc #t~nondet0;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {37#true} is VALID [2018-11-18 23:57:16,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-18 23:57:16,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-18 23:57:16,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-18 23:57:16,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-18 23:57:16,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-18 23:57:16,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-18 23:57:16,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-18 23:57:16,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem11 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {38#false} is VALID [2018-11-18 23:57:16,816 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem11 == #t~mem9 - #t~mem10 then 1 else 0)); {38#false} is VALID [2018-11-18 23:57:16,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-18 23:57:16,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2018-11-18 23:57:16,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-18 23:57:16,821 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-18 23:57:16,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:57:16,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:57:16,829 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 23:57:16,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:16,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:57:17,044 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:17,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:57:17,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:57:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:57:17,056 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-18 23:57:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:17,187 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2018-11-18 23:57:17,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:57:17,187 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-18 23:57:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:57:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2018-11-18 23:57:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:57:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2018-11-18 23:57:17,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2018-11-18 23:57:17,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:17,477 INFO L225 Difference]: With dead ends: 59 [2018-11-18 23:57:17,477 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 23:57:17,481 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:57:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 23:57:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 23:57:17,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:17,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-18 23:57:17,526 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-18 23:57:17,527 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-18 23:57:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:17,531 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-18 23:57:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 23:57:17,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:17,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:17,533 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-18 23:57:17,533 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-18 23:57:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:17,537 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-18 23:57:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 23:57:17,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:17,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:17,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:17,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:17,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 23:57:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-18 23:57:17,544 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2018-11-18 23:57:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:17,544 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-18 23:57:17,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:57:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 23:57:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 23:57:17,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:17,546 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-18 23:57:17,546 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:17,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:17,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1047758436, now seen corresponding path program 1 times [2018-11-18 23:57:17,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:17,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:17,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:17,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:17,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:57:17,742 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-18 23:57:17,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {212#true} is VALID [2018-11-18 23:57:17,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-18 23:57:17,744 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #81#return; {212#true} is VALID [2018-11-18 23:57:17,744 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret12 := main(); {212#true} is VALID [2018-11-18 23:57:17,753 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} ~M~0 := #t~nondet0;havoc #t~nondet0;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(4 * (if ~M~0 % 4294967296 % 4294967296 <= 2147483647 then ~M~0 % 4294967296 % 4294967296 else ~M~0 % 4294967296 % 4294967296 - 4294967296));havoc ~i~0;~i~0 := 0; {214#(= main_~i~0 0)} is VALID [2018-11-18 23:57:17,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {214#(= main_~i~0 0)} assume true; {214#(= main_~i~0 0)} is VALID [2018-11-18 23:57:17,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {214#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-18 23:57:17,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} ~i~0 := 0; {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-18 23:57:17,795 INFO L273 TraceCheckUtils]: 9: Hoare triple {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume true; {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-18 23:57:17,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-18 23:57:17,797 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} ~i~0 := 0; {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-18 23:57:17,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume true; {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-18 23:57:17,799 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume !(~i~0 % 4294967296 < ~M~0 % 4294967296); {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-18 23:57:17,800 INFO L273 TraceCheckUtils]: 14: Hoare triple {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} ~i~0 := 0; {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-18 23:57:17,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume true; {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} is VALID [2018-11-18 23:57:17,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {215#(<= main_~M~0 (* 4294967296 (div main_~M~0 4294967296)))} assume !!(~i~0 % 4294967296 < ~M~0 % 4294967296);call #t~mem11 := read~int(~#C~0.base, ~#C~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem9 := read~int(~#A~0.base, ~#A~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4);call #t~mem10 := read~int(~#B~0.base, ~#B~0.offset + 4 * (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 4); {213#false} is VALID [2018-11-18 23:57:17,802 INFO L256 TraceCheckUtils]: 17: Hoare triple {213#false} call __VERIFIER_assert((if #t~mem11 == #t~mem9 - #t~mem10 then 1 else 0)); {213#false} is VALID [2018-11-18 23:57:17,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2018-11-18 23:57:17,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2018-11-18 23:57:17,803 INFO L273 TraceCheckUtils]: 20: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-18 23:57:17,807 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-18 23:57:17,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:57:17,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:57:17,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-18 23:57:17,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:57:17,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:57:17,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:17,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:57:17,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:57:17,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:57:17,904 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2018-11-18 23:57:18,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:18,695 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-11-18 23:57:18,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:57:18,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-18 23:57:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:57:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:57:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2018-11-18 23:57:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:57:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2018-11-18 23:57:18,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 82 transitions. [2018-11-18 23:57:18,890 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:57:18,893 INFO L225 Difference]: With dead ends: 71 [2018-11-18 23:57:18,893 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 23:57:18,894 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-18 23:57:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 23:57:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-11-18 23:57:18,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:57:18,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 35 states. [2018-11-18 23:57:18,912 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 35 states. [2018-11-18 23:57:18,912 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 35 states. [2018-11-18 23:57:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:18,917 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-18 23:57:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-18 23:57:18,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:18,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:18,918 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 43 states. [2018-11-18 23:57:18,918 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 43 states. [2018-11-18 23:57:18,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:57:18,922 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-18 23:57:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-18 23:57:18,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:57:18,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:57:18,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:57:18,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:57:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 23:57:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-18 23:57:18,926 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2018-11-18 23:57:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:57:18,927 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-18 23:57:18,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:57:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-18 23:57:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 23:57:18,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:57:18,929 INFO L375 BasicCegarLoop]: trace histogram [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-18 23:57:18,929 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:57:18,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:57:18,929 INFO L82 PathProgramCache]: Analyzing trace with hash -147651490, now seen corresponding path program 1 times [2018-11-18 23:57:18,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:57:18,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:57:18,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:18,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:57:18,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:57:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 23:57:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 23:57:19,359 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 23:57:19,424 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-18 23:57:19,424 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 23:57:19,424 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-18 23:57:19,424 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-18 23:57:19,424 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-18 23:57:19,425 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 23:57:19,425 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 23:57:19,425 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-18 23:57:19,426 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2018-11-18 23:57:19,426 WARN L170 areAnnotationChecker]: L18-4 has no Hoare annotation [2018-11-18 23:57:19,426 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:57:19,426 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:57:19,426 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:57:19,426 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:57:19,426 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-18 23:57:19,427 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-18 23:57:19,427 WARN L170 areAnnotationChecker]: L18-5 has no Hoare annotation [2018-11-18 23:57:19,427 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-18 23:57:19,427 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-18 23:57:19,427 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-18 23:57:19,427 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2018-11-18 23:57:19,428 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2018-11-18 23:57:19,428 WARN L170 areAnnotationChecker]: L21-4 has no Hoare annotation [2018-11-18 23:57:19,428 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 23:57:19,428 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-18 23:57:19,428 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-18 23:57:19,428 WARN L170 areAnnotationChecker]: L21-5 has no Hoare annotation [2018-11-18 23:57:19,428 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2018-11-18 23:57:19,429 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-18 23:57:19,429 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2018-11-18 23:57:19,429 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2018-11-18 23:57:19,429 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2018-11-18 23:57:19,429 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-18 23:57:19,429 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2018-11-18 23:57:19,429 WARN L170 areAnnotationChecker]: L24-5 has no Hoare annotation [2018-11-18 23:57:19,431 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-18 23:57:19,431 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-18 23:57:19,431 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2018-11-18 23:57:19,431 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-18 23:57:19,431 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-18 23:57:19,431 WARN L170 areAnnotationChecker]: L27-5 has no Hoare annotation [2018-11-18 23:57:19,432 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-18 23:57:19,432 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-18 23:57:19,432 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:57:19,432 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:57:19,432 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 23:57:19,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:57:19 BoogieIcfgContainer [2018-11-18 23:57:19,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 23:57:19,440 INFO L168 Benchmark]: Toolchain (without parser) took 4268.24 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.1 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -590.6 MB). Peak memory consumption was 112.4 MB. Max. memory is 7.1 GB. [2018-11-18 23:57:19,442 INFO L168 Benchmark]: CDTParser took 0.24 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-18 23:57:19,446 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.58 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-18 23:57:19,447 INFO L168 Benchmark]: Boogie Preprocessor took 46.68 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-18 23:57:19,447 INFO L168 Benchmark]: RCFGBuilder took 927.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -736.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-18 23:57:19,455 INFO L168 Benchmark]: TraceAbstraction took 2947.36 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 135.0 MB). Peak memory consumption was 135.0 MB. Max. memory is 7.1 GB. [2018-11-18 23:57:19,461 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 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. * CACSL2BoogieTranslator took 341.58 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 Preprocessor took 46.68 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 927.51 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 703.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -736.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2947.36 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 135.0 MB). Peak memory consumption was 135.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] unsigned int M = __VERIFIER_nondet_uint(); [L15] FCALL int A[M], B[M], C[M]; [L16] unsigned int i; [L18] i=0 VAL [A={10:0}, B={12:0}, C={9:0}, i=0, M=1] [L18] COND TRUE i