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/vogal_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:31:05,732 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:31:05,735 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:31:05,753 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:31:05,754 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:31:05,757 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:31:05,759 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:31:05,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:31:05,765 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:31:05,767 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:31:05,768 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:31:05,768 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:31:05,771 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:31:05,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:31:05,773 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:31:05,776 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:31:05,777 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:31:05,788 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:31:05,790 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:31:05,792 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:31:05,794 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:31:05,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:31:05,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:31:05,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:31:05,801 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:31:05,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:31:05,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:31:05,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:31:05,804 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:31:05,808 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:31:05,808 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:31:05,809 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:31:05,809 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:31:05,809 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:31:05,811 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:31:05,812 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:31:05,812 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-14 17:31:05,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:31:05,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:31:05,841 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:31:05,842 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:31:05,842 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:31:05,842 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:31:05,843 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:31:05,843 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:31:05,843 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:31:05,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:31:05,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:31:05,845 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:31:05,845 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:31:05,845 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:31:05,845 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:31:05,845 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:31:05,845 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:31:05,846 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:31:05,846 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:31:05,846 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:31:05,846 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:31:05,846 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:31:05,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:31:05,848 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:31:05,848 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:31:05,848 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:31:05,849 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:31:05,849 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:31:05,849 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:31:05,849 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:31:05,912 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:31:05,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:31:05,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:31:05,936 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:31:05,937 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:31:05,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal_true-unreach-call.i [2018-11-14 17:31:06,000 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91c1c2f5/59557007b79247f2888ef1de73a4cfaf/FLAG28e347eb6 [2018-11-14 17:31:06,474 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:31:06,475 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal_true-unreach-call.i [2018-11-14 17:31:06,483 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91c1c2f5/59557007b79247f2888ef1de73a4cfaf/FLAG28e347eb6 [2018-11-14 17:31:06,497 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91c1c2f5/59557007b79247f2888ef1de73a4cfaf [2018-11-14 17:31:06,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:31:06,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:31:06,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:31:06,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:31:06,513 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:31:06,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:31:06" (1/1) ... [2018-11-14 17:31:06,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd3c464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:31:06, skipping insertion in model container [2018-11-14 17:31:06,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:31:06" (1/1) ... [2018-11-14 17:31:06,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:31:06,557 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:31:06,835 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:31:06,846 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:31:06,894 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:31:06,926 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:31:06,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:31:06 WrapperNode [2018-11-14 17:31:06,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:31:06,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:31:06,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:31:06,928 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:31:06,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:31:06" (1/1) ... [2018-11-14 17:31:06,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:31:06" (1/1) ... [2018-11-14 17:31:06,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:31:06" (1/1) ... [2018-11-14 17:31:06,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:31:06" (1/1) ... [2018-11-14 17:31:06,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:31:06" (1/1) ... [2018-11-14 17:31:06,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:31:06" (1/1) ... [2018-11-14 17:31:06,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:31:06" (1/1) ... [2018-11-14 17:31:07,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:31:07,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:31:07,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:31:07,001 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:31:07,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:31:06" (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-14 17:31:07,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:31:07,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:31:07,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:31:07,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:31:07,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:31:07,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:31:07,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:31:07,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-14 17:31:07,127 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:31:07,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:31:07,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:31:07,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:31:07,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:31:07,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:31:07,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:31:07,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:31:08,112 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:31:08,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:31:08 BoogieIcfgContainer [2018-11-14 17:31:08,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:31:08,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:31:08,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:31:08,118 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:31:08,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:31:06" (1/3) ... [2018-11-14 17:31:08,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2daf7937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:31:08, skipping insertion in model container [2018-11-14 17:31:08,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:31:06" (2/3) ... [2018-11-14 17:31:08,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2daf7937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:31:08, skipping insertion in model container [2018-11-14 17:31:08,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:31:08" (3/3) ... [2018-11-14 17:31:08,123 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal_true-unreach-call.i [2018-11-14 17:31:08,133 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:31:08,141 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:31:08,155 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:31:08,187 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:31:08,188 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:31:08,188 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:31:08,188 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:31:08,188 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:31:08,189 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:31:08,189 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:31:08,189 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:31:08,190 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:31:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-14 17:31:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:31:08,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:31:08,217 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-14 17:31:08,219 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:31:08,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:31:08,226 INFO L82 PathProgramCache]: Analyzing trace with hash -450684723, now seen corresponding path program 1 times [2018-11-14 17:31:08,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:31:08,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:31:08,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:31:08,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:31:08,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:31:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:31:08,377 INFO L256 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {46#true} is VALID [2018-11-14 17:31:08,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {46#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {46#true} is VALID [2018-11-14 17:31:08,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {46#true} assume true; {46#true} is VALID [2018-11-14 17:31:08,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} #122#return; {46#true} is VALID [2018-11-14 17:31:08,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {46#true} call #t~ret17 := main(); {46#true} is VALID [2018-11-14 17:31:08,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {46#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~unchecked~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset + 0, 1);call write~unchecked~int(65, ~#vogal_array~0.base, ~#vogal_array~0.offset + 1, 1);call write~unchecked~int(101, ~#vogal_array~0.base, ~#vogal_array~0.offset + 2, 1);call write~unchecked~int(69, ~#vogal_array~0.base, ~#vogal_array~0.offset + 3, 1);call write~unchecked~int(105, ~#vogal_array~0.base, ~#vogal_array~0.offset + 4, 1);call write~unchecked~int(73, ~#vogal_array~0.base, ~#vogal_array~0.offset + 5, 1);call write~unchecked~int(111, ~#vogal_array~0.base, ~#vogal_array~0.offset + 6, 1);call write~unchecked~int(79, ~#vogal_array~0.base, ~#vogal_array~0.offset + 7, 1);call write~unchecked~int(117, ~#vogal_array~0.base, ~#vogal_array~0.offset + 8, 1);call write~unchecked~int(85, ~#vogal_array~0.base, ~#vogal_array~0.offset + 9, 1);call write~unchecked~int(0, ~#vogal_array~0.base, ~#vogal_array~0.offset + 10, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {46#true} is VALID [2018-11-14 17:31:08,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {46#true} assume !true; {47#false} is VALID [2018-11-14 17:31:08,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {47#false} call #t~mem3 := read~int(~#input_string~0.base, ~#input_string~0.offset + 4, 1); {47#false} is VALID [2018-11-14 17:31:08,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {47#false} assume !!(#t~mem3 == 0);havoc #t~mem3;~n_caracter~0 := 0; {47#false} is VALID [2018-11-14 17:31:08,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {47#false} assume !true; {47#false} is VALID [2018-11-14 17:31:08,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {47#false} ~cont~0 := 0;~i~0 := 0; {47#false} is VALID [2018-11-14 17:31:08,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {47#false} assume !true; {47#false} is VALID [2018-11-14 17:31:08,385 INFO L273 TraceCheckUtils]: 12: Hoare triple {47#false} ~i~0 := 0;~cont_aux~0 := 0; {47#false} is VALID [2018-11-14 17:31:08,385 INFO L273 TraceCheckUtils]: 13: Hoare triple {47#false} assume !true; {47#false} is VALID [2018-11-14 17:31:08,386 INFO L256 TraceCheckUtils]: 14: Hoare triple {47#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {47#false} is VALID [2018-11-14 17:31:08,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2018-11-14 17:31:08,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {47#false} assume ~cond == 0; {47#false} is VALID [2018-11-14 17:31:08,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {47#false} assume !false; {47#false} is VALID [2018-11-14 17:31:08,390 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-14 17:31:08,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:31:08,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:31:08,398 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 17:31:08,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:31:08,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:31:08,497 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-14 17:31:08,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:31:08,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:31:08,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:31:08,508 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-14 17:31:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:31:08,661 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2018-11-14 17:31:08,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:31:08,661 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 17:31:08,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:31:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:31:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2018-11-14 17:31:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:31:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2018-11-14 17:31:08,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 106 transitions. [2018-11-14 17:31:09,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:31:09,041 INFO L225 Difference]: With dead ends: 77 [2018-11-14 17:31:09,041 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:31:09,045 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-14 17:31:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:31:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-14 17:31:09,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:31:09,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-14 17:31:09,220 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 17:31:09,220 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 17:31:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:31:09,226 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-14 17:31:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-14 17:31:09,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:31:09,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:31:09,229 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 17:31:09,229 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 17:31:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:31:09,239 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-14 17:31:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-14 17:31:09,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:31:09,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:31:09,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:31:09,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:31:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:31:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-14 17:31:09,248 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 18 [2018-11-14 17:31:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:31:09,249 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-14 17:31:09,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:31:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-14 17:31:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 17:31:09,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:31:09,251 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, 1] [2018-11-14 17:31:09,251 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:31:09,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:31:09,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1427074857, now seen corresponding path program 1 times [2018-11-14 17:31:09,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:31:09,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:31:09,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:31:09,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:31:09,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:31:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:31:09,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {266#true} is VALID [2018-11-14 17:31:09,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {266#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {266#true} is VALID [2018-11-14 17:31:09,474 INFO L273 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-14 17:31:09,474 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #122#return; {266#true} is VALID [2018-11-14 17:31:09,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret17 := main(); {266#true} is VALID [2018-11-14 17:31:09,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {266#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~unchecked~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset + 0, 1);call write~unchecked~int(65, ~#vogal_array~0.base, ~#vogal_array~0.offset + 1, 1);call write~unchecked~int(101, ~#vogal_array~0.base, ~#vogal_array~0.offset + 2, 1);call write~unchecked~int(69, ~#vogal_array~0.base, ~#vogal_array~0.offset + 3, 1);call write~unchecked~int(105, ~#vogal_array~0.base, ~#vogal_array~0.offset + 4, 1);call write~unchecked~int(73, ~#vogal_array~0.base, ~#vogal_array~0.offset + 5, 1);call write~unchecked~int(111, ~#vogal_array~0.base, ~#vogal_array~0.offset + 6, 1);call write~unchecked~int(79, ~#vogal_array~0.base, ~#vogal_array~0.offset + 7, 1);call write~unchecked~int(117, ~#vogal_array~0.base, ~#vogal_array~0.offset + 8, 1);call write~unchecked~int(85, ~#vogal_array~0.base, ~#vogal_array~0.offset + 9, 1);call write~unchecked~int(0, ~#vogal_array~0.base, ~#vogal_array~0.offset + 10, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {268#(= main_~i~0 0)} is VALID [2018-11-14 17:31:09,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {268#(= main_~i~0 0)} assume true; {268#(= main_~i~0 0)} is VALID [2018-11-14 17:31:09,477 INFO L273 TraceCheckUtils]: 7: Hoare triple {268#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 5); {267#false} is VALID [2018-11-14 17:31:09,477 INFO L273 TraceCheckUtils]: 8: Hoare triple {267#false} call #t~mem3 := read~int(~#input_string~0.base, ~#input_string~0.offset + 4, 1); {267#false} is VALID [2018-11-14 17:31:09,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {267#false} assume !!(#t~mem3 == 0);havoc #t~mem3;~n_caracter~0 := 0; {267#false} is VALID [2018-11-14 17:31:09,478 INFO L273 TraceCheckUtils]: 10: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 17:31:09,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {267#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296) * 1, 1); {267#false} is VALID [2018-11-14 17:31:09,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {267#false} assume !(#t~mem4 != 0);havoc #t~mem4; {267#false} is VALID [2018-11-14 17:31:09,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {267#false} ~cont~0 := 0;~i~0 := 0; {267#false} is VALID [2018-11-14 17:31:09,479 INFO L273 TraceCheckUtils]: 14: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 17:31:09,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {267#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {267#false} is VALID [2018-11-14 17:31:09,480 INFO L273 TraceCheckUtils]: 16: Hoare triple {267#false} ~i~0 := 0;~cont_aux~0 := 0; {267#false} is VALID [2018-11-14 17:31:09,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {267#false} assume true; {267#false} is VALID [2018-11-14 17:31:09,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {267#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 1, 1); {267#false} is VALID [2018-11-14 17:31:09,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {267#false} assume !(#t~mem11 != 0);havoc #t~mem11; {267#false} is VALID [2018-11-14 17:31:09,481 INFO L256 TraceCheckUtils]: 20: Hoare triple {267#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {267#false} is VALID [2018-11-14 17:31:09,482 INFO L273 TraceCheckUtils]: 21: Hoare triple {267#false} ~cond := #in~cond; {267#false} is VALID [2018-11-14 17:31:09,482 INFO L273 TraceCheckUtils]: 22: Hoare triple {267#false} assume ~cond == 0; {267#false} is VALID [2018-11-14 17:31:09,482 INFO L273 TraceCheckUtils]: 23: Hoare triple {267#false} assume !false; {267#false} is VALID [2018-11-14 17:31:09,485 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-14 17:31:09,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:31:09,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:31:09,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 17:31:09,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:31:09,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:31:09,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:31:09,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:31:09,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:31:09,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:31:09,577 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 3 states. [2018-11-14 17:31:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:31:09,974 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2018-11-14 17:31:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:31:09,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-14 17:31:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:31:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:31:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2018-11-14 17:31:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:31:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2018-11-14 17:31:09,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2018-11-14 17:31:10,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:31:10,194 INFO L225 Difference]: With dead ends: 83 [2018-11-14 17:31:10,194 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 17:31:10,195 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-14 17:31:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 17:31:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2018-11-14 17:31:10,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:31:10,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 38 states. [2018-11-14 17:31:10,218 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 38 states. [2018-11-14 17:31:10,218 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 38 states. [2018-11-14 17:31:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:31:10,224 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-14 17:31:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2018-11-14 17:31:10,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:31:10,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:31:10,226 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 56 states. [2018-11-14 17:31:10,226 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 56 states. [2018-11-14 17:31:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:31:10,230 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-11-14 17:31:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2018-11-14 17:31:10,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:31:10,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:31:10,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:31:10,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:31:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:31:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-14 17:31:10,234 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 24 [2018-11-14 17:31:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:31:10,235 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-14 17:31:10,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:31:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-14 17:31:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:31:10,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:31:10,236 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:31:10,237 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:31:10,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:31:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash 367341036, now seen corresponding path program 1 times [2018-11-14 17:31:10,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:31:10,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:31:10,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:31:10,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:31:10,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:31:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:31:10,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {542#true} is VALID [2018-11-14 17:31:10,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {542#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {542#true} is VALID [2018-11-14 17:31:10,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2018-11-14 17:31:10,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #122#return; {542#true} is VALID [2018-11-14 17:31:10,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {542#true} call #t~ret17 := main(); {542#true} is VALID [2018-11-14 17:31:10,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {542#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~unchecked~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset + 0, 1);call write~unchecked~int(65, ~#vogal_array~0.base, ~#vogal_array~0.offset + 1, 1);call write~unchecked~int(101, ~#vogal_array~0.base, ~#vogal_array~0.offset + 2, 1);call write~unchecked~int(69, ~#vogal_array~0.base, ~#vogal_array~0.offset + 3, 1);call write~unchecked~int(105, ~#vogal_array~0.base, ~#vogal_array~0.offset + 4, 1);call write~unchecked~int(73, ~#vogal_array~0.base, ~#vogal_array~0.offset + 5, 1);call write~unchecked~int(111, ~#vogal_array~0.base, ~#vogal_array~0.offset + 6, 1);call write~unchecked~int(79, ~#vogal_array~0.base, ~#vogal_array~0.offset + 7, 1);call write~unchecked~int(117, ~#vogal_array~0.base, ~#vogal_array~0.offset + 8, 1);call write~unchecked~int(85, ~#vogal_array~0.base, ~#vogal_array~0.offset + 9, 1);call write~unchecked~int(0, ~#vogal_array~0.base, ~#vogal_array~0.offset + 10, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {544#(= main_~i~0 0)} is VALID [2018-11-14 17:31:10,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {544#(= main_~i~0 0)} assume true; {544#(= main_~i~0 0)} is VALID [2018-11-14 17:31:10,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {544#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296) * 1, 1);havoc #t~nondet2; {544#(= main_~i~0 0)} is VALID [2018-11-14 17:31:10,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {544#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {545#(and (<= main_~i~0 1) (< 0 (+ (div main_~i~0 4294967296) 1)))} is INVALID [2018-11-14 17:31:10,424 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: invalid Hoare triple in Craig at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 17:31:10,430 INFO L168 Benchmark]: Toolchain (without parser) took 3921.90 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.1 GB in the end (delta: -637.5 MB). Peak memory consumption was 111.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:31:10,432 INFO L168 Benchmark]: CDTParser took 0.21 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-14 17:31:10,433 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.77 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-14 17:31:10,434 INFO L168 Benchmark]: Boogie Preprocessor took 72.27 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: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:31:10,434 INFO L168 Benchmark]: RCFGBuilder took 1112.87 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: -769.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-14 17:31:10,435 INFO L168 Benchmark]: TraceAbstraction took 2314.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.9 MB). Peak memory consumption was 118.9 MB. Max. memory is 7.1 GB. [2018-11-14 17:31:10,440 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.21 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 417.77 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 72.27 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: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1112.87 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: -769.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2314.53 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.9 MB). Peak memory consumption was 118.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: invalid Hoare triple in Craig de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: invalid Hoare triple in Craig: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:199) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...