/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/s32iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:51,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:51,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:51,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:51,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:51,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:51,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:51,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:51,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:51,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:51,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:51,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:51,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:51,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:51,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:51,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:51,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:51,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:51,229 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:51,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:51,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:51,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:51,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:51,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:51,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:51,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:51,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:51,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:51,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:51,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:51,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:51,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:51,249 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:51,250 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:51,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:51,251 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:51,252 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:51,252 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:51,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:51,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:51,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:51,255 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:26:51,272 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:51,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:51,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:51,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:51,274 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:51,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:51,275 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:51,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:51,276 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:51,276 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:51,276 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:51,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:51,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:51,277 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:51,277 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:51,277 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:51,277 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:51,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:51,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:51,278 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:51,278 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:51,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:51,278 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:51,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:51,279 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:51,279 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:51,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:51,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:51,280 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:51,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:51,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:51,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:51,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:51,649 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:51,649 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:51,650 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s32iff.c [2020-07-10 15:26:51,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60ca705cf/111c34b4101c4daea3a0b2b1216cdb6f/FLAG127436129 [2020-07-10 15:26:52,303 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:52,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s32iff.c [2020-07-10 15:26:52,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60ca705cf/111c34b4101c4daea3a0b2b1216cdb6f/FLAG127436129 [2020-07-10 15:26:52,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60ca705cf/111c34b4101c4daea3a0b2b1216cdb6f [2020-07-10 15:26:52,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:52,653 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:52,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:52,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:52,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:52,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:52" (1/1) ... [2020-07-10 15:26:52,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be51f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:52, skipping insertion in model container [2020-07-10 15:26:52,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:52" (1/1) ... [2020-07-10 15:26:52,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:52,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:52,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:52,949 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:52,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:52,999 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:53,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53 WrapperNode [2020-07-10 15:26:53,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:53,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:53,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:53,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:53,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:53,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:53,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:53,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:53,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (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 [2020-07-10 15:26:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:53,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:53,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:53,767 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:53,768 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:26:53,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:53 BoogieIcfgContainer [2020-07-10 15:26:53,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:53,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:53,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:53,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:53,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:52" (1/3) ... [2020-07-10 15:26:53,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ff0650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:53, skipping insertion in model container [2020-07-10 15:26:53,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53" (2/3) ... [2020-07-10 15:26:53,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ff0650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:53, skipping insertion in model container [2020-07-10 15:26:53,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:53" (3/3) ... [2020-07-10 15:26:53,787 INFO L109 eAbstractionObserver]: Analyzing ICFG s32iff.c [2020-07-10 15:26:53,804 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:53,817 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:53,856 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:53,901 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:53,902 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:53,902 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:53,902 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:53,902 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:53,902 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:53,902 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:53,902 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-10 15:26:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:26:53,932 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:53,933 INFO L422 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] [2020-07-10 15:26:53,934 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:53,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:53,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2033030480, now seen corresponding path program 1 times [2020-07-10 15:26:53,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:53,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980857043] [2020-07-10 15:26:53,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:54,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {39#true} is VALID [2020-07-10 15:26:54,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:26:54,282 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-10 15:26:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:54,317 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-10 15:26:54,318 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-10 15:26:54,319 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:26:54,319 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-10 15:26:54,321 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:54,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {39#true} is VALID [2020-07-10 15:26:54,322 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:26:54,323 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-10 15:26:54,323 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret14 := main(); {39#true} is VALID [2020-07-10 15:26:54,323 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {39#true} is VALID [2020-07-10 15:26:54,324 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~N~0 <= 0); {39#true} is VALID [2020-07-10 15:26:54,325 INFO L263 TraceCheckUtils]: 7: Hoare triple {39#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {39#true} is VALID [2020-07-10 15:26:54,325 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-10 15:26:54,326 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-10 15:26:54,327 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:26:54,327 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-10 15:26:54,328 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:54,328 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-10 15:26:54,329 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:54,329 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-10 15:26:54,330 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:54,330 INFO L280 TraceCheckUtils]: 17: Hoare triple {40#false} assume !true; {40#false} is VALID [2020-07-10 15:26:54,331 INFO L280 TraceCheckUtils]: 18: Hoare triple {40#false} call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {40#false} is VALID [2020-07-10 15:26:54,331 INFO L263 TraceCheckUtils]: 19: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem13 == 4 * ~N~0 then 1 else 0)); {40#false} is VALID [2020-07-10 15:26:54,331 INFO L280 TraceCheckUtils]: 20: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2020-07-10 15:26:54,332 INFO L280 TraceCheckUtils]: 21: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2020-07-10 15:26:54,332 INFO L280 TraceCheckUtils]: 22: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-10 15:26:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:54,338 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980857043] [2020-07-10 15:26:54,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:54,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:54,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699087515] [2020-07-10 15:26:54,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:26:54,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:54,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:54,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:54,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:54,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:54,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:54,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:54,437 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-10 15:26:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:54,762 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2020-07-10 15:26:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:54,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:26:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:54,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-10 15:26:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-10 15:26:54,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2020-07-10 15:26:55,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:55,033 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:26:55,033 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 15:26:55,038 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 15:26:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-10 15:26:55,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:55,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:55,108 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:55,108 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:55,113 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-10 15:26:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:26:55,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:55,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:55,115 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:55,115 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:55,120 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-10 15:26:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:26:55,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:55,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:55,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:55,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:26:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-10 15:26:55,128 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2020-07-10 15:26:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:55,129 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-10 15:26:55,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:26:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:26:55,131 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:55,131 INFO L422 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] [2020-07-10 15:26:55,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:55,132 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:55,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:55,133 INFO L82 PathProgramCache]: Analyzing trace with hash 706992569, now seen corresponding path program 1 times [2020-07-10 15:26:55,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:55,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007384060] [2020-07-10 15:26:55,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:55,344 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {227#true} is VALID [2020-07-10 15:26:55,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:26:55,345 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #91#return; {227#true} is VALID [2020-07-10 15:26:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:55,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-10 15:26:55,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-10 15:26:55,358 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:26:55,359 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #87#return; {232#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:55,361 INFO L263 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {238#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:55,362 INFO L280 TraceCheckUtils]: 1: Hoare triple {238#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {227#true} is VALID [2020-07-10 15:26:55,362 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:26:55,362 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #91#return; {227#true} is VALID [2020-07-10 15:26:55,363 INFO L263 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret14 := main(); {227#true} is VALID [2020-07-10 15:26:55,363 INFO L280 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {227#true} is VALID [2020-07-10 15:26:55,364 INFO L280 TraceCheckUtils]: 6: Hoare triple {227#true} assume !(~N~0 <= 0); {232#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:55,364 INFO L263 TraceCheckUtils]: 7: Hoare triple {232#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {227#true} is VALID [2020-07-10 15:26:55,365 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-10 15:26:55,365 INFO L280 TraceCheckUtils]: 9: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-10 15:26:55,365 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:26:55,367 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #87#return; {232#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:55,370 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:26:55,372 INFO L280 TraceCheckUtils]: 13: Hoare triple {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-10 15:26:55,372 INFO L280 TraceCheckUtils]: 14: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-10 15:26:55,372 INFO L280 TraceCheckUtils]: 15: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-10 15:26:55,373 INFO L280 TraceCheckUtils]: 16: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-10 15:26:55,373 INFO L280 TraceCheckUtils]: 17: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-10 15:26:55,373 INFO L280 TraceCheckUtils]: 18: Hoare triple {228#false} call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {228#false} is VALID [2020-07-10 15:26:55,374 INFO L263 TraceCheckUtils]: 19: Hoare triple {228#false} call __VERIFIER_assert((if #t~mem13 == 4 * ~N~0 then 1 else 0)); {228#false} is VALID [2020-07-10 15:26:55,374 INFO L280 TraceCheckUtils]: 20: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2020-07-10 15:26:55,374 INFO L280 TraceCheckUtils]: 21: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2020-07-10 15:26:55,375 INFO L280 TraceCheckUtils]: 22: Hoare triple {228#false} assume !false; {228#false} is VALID [2020-07-10 15:26:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:55,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007384060] [2020-07-10 15:26:55,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:55,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:55,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231403377] [2020-07-10 15:26:55,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:26:55,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:55,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:55,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:55,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:55,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:55,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:55,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:55,423 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2020-07-10 15:26:55,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:55,796 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2020-07-10 15:26:55,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:55,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:26:55,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-10 15:26:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-10 15:26:55,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-10 15:26:55,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:55,939 INFO L225 Difference]: With dead ends: 51 [2020-07-10 15:26:55,939 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 15:26:55,941 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:26:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 15:26:55,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2020-07-10 15:26:55,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:55,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 32 states. [2020-07-10 15:26:55,999 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 32 states. [2020-07-10 15:26:55,999 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 32 states. [2020-07-10 15:26:56,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:56,004 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 15:26:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-10 15:26:56,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:56,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:56,009 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 37 states. [2020-07-10 15:26:56,009 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 37 states. [2020-07-10 15:26:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:56,022 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 15:26:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-10 15:26:56,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:56,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:56,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:56,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:26:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-10 15:26:56,032 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2020-07-10 15:26:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:56,033 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-10 15:26:56,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 15:26:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:26:56,037 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:56,037 INFO L422 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:56,038 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:56,038 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:56,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:56,038 INFO L82 PathProgramCache]: Analyzing trace with hash 284203188, now seen corresponding path program 1 times [2020-07-10 15:26:56,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:56,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601362770] [2020-07-10 15:26:56,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:56,275 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:56,275 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:56,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:26:56,323 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:56,323 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:56,324 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:56,324 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:56,324 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:56,324 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:56,324 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:56,324 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:56,325 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:56,325 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:56,325 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:56,325 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:56,325 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:56,326 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:56,326 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:56,326 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:56,326 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:56,326 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:56,326 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:56,327 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:56,327 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:56,327 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:56,327 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:56,327 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:56,328 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:56,328 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:56,328 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:56,328 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:56,328 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:56,329 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:56,329 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:56,329 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-10 15:26:56,329 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:26:56,329 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:26:56,329 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:56,330 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:56,330 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:56,330 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:26:56,330 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:26:56,330 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:26:56,331 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:56,331 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:56,331 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:56,331 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:26:56,331 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-10 15:26:56,332 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:26:56,332 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:26:56,332 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:26:56,332 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:26:56,332 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-10 15:26:56,333 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. [2020-07-10 15:26:56,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:56 BoogieIcfgContainer [2020-07-10 15:26:56,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:56,340 INFO L168 Benchmark]: Toolchain (without parser) took 3686.02 ms. Allocated memory was 144.7 MB in the beginning and 235.4 MB in the end (delta: 90.7 MB). Free memory was 101.3 MB in the beginning and 102.4 MB in the end (delta: -1.2 MB). Peak memory consumption was 89.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:56,341 INFO L168 Benchmark]: CDTParser took 1.80 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:56,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.30 ms. Allocated memory is still 144.7 MB. Free memory was 101.1 MB in the beginning and 89.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:56,343 INFO L168 Benchmark]: Boogie Preprocessor took 186.80 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 89.6 MB in the beginning and 180.8 MB in the end (delta: -91.2 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:56,344 INFO L168 Benchmark]: RCFGBuilder took 585.91 ms. Allocated memory is still 203.4 MB. Free memory was 180.8 MB in the beginning and 153.8 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:56,345 INFO L168 Benchmark]: TraceAbstraction took 2559.75 ms. Allocated memory was 203.4 MB in the beginning and 235.4 MB in the end (delta: 32.0 MB). Free memory was 153.8 MB in the beginning and 102.4 MB in the end (delta: 51.3 MB). Peak memory consumption was 83.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:56,349 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.80 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 346.30 ms. Allocated memory is still 144.7 MB. Free memory was 101.1 MB in the beginning and 89.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 186.80 ms. Allocated memory was 144.7 MB in the beginning and 203.4 MB in the end (delta: 58.7 MB). Free memory was 89.6 MB in the beginning and 180.8 MB in the end (delta: -91.2 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 585.91 ms. Allocated memory is still 203.4 MB. Free memory was 180.8 MB in the beginning and 153.8 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2559.75 ms. Allocated memory was 203.4 MB in the beginning and 235.4 MB in the end (delta: 32.0 MB). Free memory was 153.8 MB in the beginning and 102.4 MB in the end (delta: 51.3 MB). Peak memory consumption was 83.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 1 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L30] COND TRUE i