/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/s42iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:52,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:52,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:52,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:52,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:52,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:52,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:52,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:52,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:52,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:52,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:52,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:52,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:52,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:52,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:52,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:52,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:52,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:52,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:52,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:52,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:52,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:52,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:52,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:52,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:52,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:52,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:52,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:52,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:52,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:52,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:52,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:52,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:52,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:52,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:52,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:52,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:52,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:52,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:52,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:52,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:52,534 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:52,564 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:52,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:52,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:52,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:52,571 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:52,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:52,571 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:52,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:52,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:52,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:52,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:52,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:52,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:52,572 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:52,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:52,573 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:52,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:52,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:52,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:52,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:52,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:52,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:52,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:52,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:52,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:52,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:52,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:52,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:52,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:52,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:52,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:52,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:52,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:52,880 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:52,881 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:52,881 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s42iff.c [2020-07-10 15:26:52,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937d127d6/141c75c7a738499baffe740861bb20b4/FLAG5d9e1c6cc [2020-07-10 15:26:53,457 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:53,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s42iff.c [2020-07-10 15:26:53,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937d127d6/141c75c7a738499baffe740861bb20b4/FLAG5d9e1c6cc [2020-07-10 15:26:53,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/937d127d6/141c75c7a738499baffe740861bb20b4 [2020-07-10 15:26:53,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:53,789 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:53,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:53,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:53,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:53,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252e6470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:53, skipping insertion in model container [2020-07-10 15:26:53,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:53" (1/1) ... [2020-07-10 15:26:53,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:53,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:54,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:54,036 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:54,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:54,097 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:54,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:54 WrapperNode [2020-07-10 15:26:54,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:54,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:54,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:54,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:54,199 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:54" (1/1) ... [2020-07-10 15:26:54,200 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:54" (1/1) ... [2020-07-10 15:26:54,223 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:54" (1/1) ... [2020-07-10 15:26:54,223 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:54" (1/1) ... [2020-07-10 15:26:54,236 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:54" (1/1) ... [2020-07-10 15:26:54,243 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:54" (1/1) ... [2020-07-10 15:26:54,244 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:54" (1/1) ... [2020-07-10 15:26:54,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:54,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:54,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:54,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:54,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:54" (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:54,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:54,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:54,305 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:54,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:54,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:54,306 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:54,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:54,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:54,714 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:54,714 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:26:54,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:54 BoogieIcfgContainer [2020-07-10 15:26:54,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:54,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:54,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:54,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:54,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:53" (1/3) ... [2020-07-10 15:26:54,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ca3b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:54, skipping insertion in model container [2020-07-10 15:26:54,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:54" (2/3) ... [2020-07-10 15:26:54,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ca3b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:54, skipping insertion in model container [2020-07-10 15:26:54,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:54" (3/3) ... [2020-07-10 15:26:54,730 INFO L109 eAbstractionObserver]: Analyzing ICFG s42iff.c [2020-07-10 15:26:54,740 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:54,745 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:54,757 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:54,776 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:54,776 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:54,776 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:54,777 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:54,777 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:54,777 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:54,777 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:54,777 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-10 15:26:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:26:54,799 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:54,799 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:54,800 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:54,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:54,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2033030480, now seen corresponding path program 1 times [2020-07-10 15:26:54,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:54,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270222036] [2020-07-10 15:26:54,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:55,031 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:55,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:26:55,032 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-10 15:26:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:55,041 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-10 15:26:55,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-10 15:26:55,043 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:26:55,043 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-10 15:26:55,045 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:55,046 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:55,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:26:55,047 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-10 15:26:55,047 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret14 := main(); {39#true} is VALID [2020-07-10 15:26:55,047 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:55,048 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~N~0 <= 0); {39#true} is VALID [2020-07-10 15:26:55,048 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:55,049 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-10 15:26:55,050 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-10 15:26:55,051 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:26:55,051 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-10 15:26:55,052 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:55,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-10 15:26:55,053 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:55,053 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-10 15:26:55,053 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:55,054 INFO L280 TraceCheckUtils]: 17: Hoare triple {40#false} assume !true; {40#false} is VALID [2020-07-10 15:26:55,054 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:55,055 INFO L263 TraceCheckUtils]: 19: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem13 == 5 * ~N~0 then 1 else 0)); {40#false} is VALID [2020-07-10 15:26:55,055 INFO L280 TraceCheckUtils]: 20: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2020-07-10 15:26:55,055 INFO L280 TraceCheckUtils]: 21: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2020-07-10 15:26:55,056 INFO L280 TraceCheckUtils]: 22: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-10 15:26:55,059 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,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270222036] [2020-07-10 15:26:55,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:55,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:55,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888511050] [2020-07-10 15:26:55,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:26:55,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:55,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:55,117 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,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:55,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:55,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:55,130 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-10 15:26:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:55,329 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2020-07-10 15:26:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:55,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 15:26:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-10 15:26:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-10 15:26:55,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2020-07-10 15:26:55,494 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,506 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:26:55,506 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 15:26:55,510 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,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 15:26:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-10 15:26:55,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:55,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:55,559 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:55,559 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:55,564 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-10 15:26:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:26:55,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:55,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:55,565 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:55,565 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 15:26:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:55,569 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-10 15:26:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:26:55,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:55,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:55,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:55,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:26:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-10 15:26:55,575 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2020-07-10 15:26:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:55,576 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-10 15:26:55,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:26:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:26:55,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:55,577 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,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:55,578 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:55,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:55,578 INFO L82 PathProgramCache]: Analyzing trace with hash 706992569, now seen corresponding path program 1 times [2020-07-10 15:26:55,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:55,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112840106] [2020-07-10 15:26:55,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:55,732 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,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:26:55,732 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #91#return; {227#true} is VALID [2020-07-10 15:26:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:55,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-10 15:26:55,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-10 15:26:55,744 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:26:55,745 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,747 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,747 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,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:26:55,748 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #91#return; {227#true} is VALID [2020-07-10 15:26:55,748 INFO L263 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret14 := main(); {227#true} is VALID [2020-07-10 15:26:55,748 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,749 INFO L280 TraceCheckUtils]: 6: Hoare triple {227#true} assume !(~N~0 <= 0); {232#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:55,749 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,750 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-10 15:26:55,750 INFO L280 TraceCheckUtils]: 9: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-10 15:26:55,750 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-10 15:26:55,751 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,753 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,753 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,754 INFO L280 TraceCheckUtils]: 14: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-10 15:26:55,754 INFO L280 TraceCheckUtils]: 15: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-10 15:26:55,754 INFO L280 TraceCheckUtils]: 16: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-10 15:26:55,755 INFO L280 TraceCheckUtils]: 17: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-10 15:26:55,755 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,755 INFO L263 TraceCheckUtils]: 19: Hoare triple {228#false} call __VERIFIER_assert((if #t~mem13 == 5 * ~N~0 then 1 else 0)); {228#false} is VALID [2020-07-10 15:26:55,756 INFO L280 TraceCheckUtils]: 20: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2020-07-10 15:26:55,756 INFO L280 TraceCheckUtils]: 21: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2020-07-10 15:26:55,756 INFO L280 TraceCheckUtils]: 22: Hoare triple {228#false} assume !false; {228#false} is VALID [2020-07-10 15:26:55,757 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,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112840106] [2020-07-10 15:26:55,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:55,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:55,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319175010] [2020-07-10 15:26:55,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:26:55,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:55,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:55,788 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,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:55,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:55,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:55,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:55,789 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2020-07-10 15:26:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:56,053 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2020-07-10 15:26:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:56,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-10 15:26:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-10 15:26:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-10 15:26:56,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-10 15:26:56,158 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:56,160 INFO L225 Difference]: With dead ends: 51 [2020-07-10 15:26:56,160 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 15:26:56,161 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:56,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 15:26:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2020-07-10 15:26:56,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:56,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 32 states. [2020-07-10 15:26:56,189 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 32 states. [2020-07-10 15:26:56,189 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 32 states. [2020-07-10 15:26:56,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:56,193 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 15:26:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-10 15:26:56,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:56,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:56,194 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 37 states. [2020-07-10 15:26:56,194 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 37 states. [2020-07-10 15:26:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:56,198 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2020-07-10 15:26:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2020-07-10 15:26:56,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:56,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:56,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:56,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:26:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-10 15:26:56,202 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2020-07-10 15:26:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:56,202 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-10 15:26:56,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-10 15:26:56,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:26:56,204 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:56,204 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,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:56,205 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:56,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:56,205 INFO L82 PathProgramCache]: Analyzing trace with hash 284203188, now seen corresponding path program 1 times [2020-07-10 15:26:56,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:56,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920511371] [2020-07-10 15:26:56,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:56,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:56,380 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:56,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:26:56,452 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:56,452 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:56,452 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:56,452 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:56,453 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:56,453 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:56,453 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:56,453 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:56,453 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:56,454 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:56,454 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:56,455 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:56,455 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:56,459 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:56,460 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:56,460 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:56,460 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:56,467 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:56,467 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:56,467 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:56,468 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:56,468 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:56,468 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:56,470 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:56,470 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:56,470 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:56,470 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:56,470 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:56,470 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:56,471 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:56,471 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:56,471 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2020-07-10 15:26:56,471 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:26:56,471 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:26:56,471 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:56,472 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:56,472 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:56,472 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:26:56,472 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:26:56,472 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:26:56,472 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:56,472 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:56,473 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:26:56,473 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:26:56,473 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-10 15:26:56,473 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:26:56,473 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:26:56,474 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 15:26:56,474 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-10 15:26:56,474 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-10 15:26:56,474 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,479 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,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:56,483 INFO L168 Benchmark]: Toolchain (without parser) took 2692.59 ms. Allocated memory was 145.2 MB in the beginning and 235.4 MB in the end (delta: 90.2 MB). Free memory was 102.4 MB in the beginning and 100.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 91.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:56,485 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 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,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.15 ms. Allocated memory is still 145.2 MB. Free memory was 102.2 MB in the beginning and 90.8 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,487 INFO L168 Benchmark]: Boogie Preprocessor took 149.43 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 90.8 MB in the beginning and 179.2 MB in the end (delta: -88.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:56,489 INFO L168 Benchmark]: RCFGBuilder took 469.56 ms. Allocated memory is still 201.9 MB. Free memory was 179.2 MB in the beginning and 152.0 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:56,491 INFO L168 Benchmark]: TraceAbstraction took 1760.22 ms. Allocated memory was 201.9 MB in the beginning and 235.4 MB in the end (delta: 33.6 MB). Free memory was 151.3 MB in the beginning and 100.7 MB in the end (delta: 50.6 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:56,505 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 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 308.15 ms. Allocated memory is still 145.2 MB. Free memory was 102.2 MB in the beginning and 90.8 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.43 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 90.8 MB in the beginning and 179.2 MB in the end (delta: -88.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 469.56 ms. Allocated memory is still 201.9 MB. Free memory was 179.2 MB in the beginning and 152.0 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1760.22 ms. Allocated memory was 201.9 MB in the beginning and 235.4 MB in the end (delta: 33.6 MB). Free memory was 151.3 MB in the beginning and 100.7 MB in the end (delta: 50.6 MB). Peak memory consumption was 84.2 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