/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/sina5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:09,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:09,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:09,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:09,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:09,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:09,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:09,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:09,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:09,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:09,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:09,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:09,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:09,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:09,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:09,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:09,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:09,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:09,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:09,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:09,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:09,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:09,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:09,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:09,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:09,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:09,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:09,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:09,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:09,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:09,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:09,346 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:09,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:09,348 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:09,349 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:09,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:09,350 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:09,350 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:09,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:09,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:09,352 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:09,353 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:27:09,367 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:09,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:09,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:09,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:09,369 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:09,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:09,369 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:09,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:09,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:09,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:09,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:09,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:09,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:09,370 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:09,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:09,371 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:09,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:09,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:09,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:09,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:09,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:09,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:09,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:09,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:09,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:09,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:09,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:09,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:09,373 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:09,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:09,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:09,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:09,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:09,671 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:09,671 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:09,672 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/sina5f.c [2020-07-10 15:27:09,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/771bb7c64/b868d0433db24a80beb0c3c008f14ce9/FLAGc413d2c5e [2020-07-10 15:27:10,143 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:10,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/sina5f.c [2020-07-10 15:27:10,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/771bb7c64/b868d0433db24a80beb0c3c008f14ce9/FLAGc413d2c5e [2020-07-10 15:27:10,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/771bb7c64/b868d0433db24a80beb0c3c008f14ce9 [2020-07-10 15:27:10,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:10,569 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:10,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:10,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:10,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:10,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:10" (1/1) ... [2020-07-10 15:27:10,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c1871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:10, skipping insertion in model container [2020-07-10 15:27:10,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:10" (1/1) ... [2020-07-10 15:27:10,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:10,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:10,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:10,817 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:10,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:10,961 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:10,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:10 WrapperNode [2020-07-10 15:27:10,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:10,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:10,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:10,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:10,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:10" (1/1) ... [2020-07-10 15:27:10,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:10" (1/1) ... [2020-07-10 15:27:11,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:10" (1/1) ... [2020-07-10 15:27:11,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:10" (1/1) ... [2020-07-10 15:27:11,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:10" (1/1) ... [2020-07-10 15:27:11,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:10" (1/1) ... [2020-07-10 15:27:11,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:10" (1/1) ... [2020-07-10 15:27:11,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:11,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:11,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:11,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:11,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:11,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:11,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:11,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:27:11,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:11,161 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:11,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:11,161 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:27:11,161 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:27:11,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:11,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:27:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:27:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:11,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:27:11,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:27:11,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:27:11,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:27:11,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:27:11,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:11,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:11,700 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:11,700 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-10 15:27:11,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:11 BoogieIcfgContainer [2020-07-10 15:27:11,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:11,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:11,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:11,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:11,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:10" (1/3) ... [2020-07-10 15:27:11,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0f2039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:11, skipping insertion in model container [2020-07-10 15:27:11,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:10" (2/3) ... [2020-07-10 15:27:11,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0f2039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:11, skipping insertion in model container [2020-07-10 15:27:11,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:11" (3/3) ... [2020-07-10 15:27:11,712 INFO L109 eAbstractionObserver]: Analyzing ICFG sina5f.c [2020-07-10 15:27:11,722 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:11,730 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:11,742 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:11,762 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:11,763 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:11,763 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:11,763 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:11,763 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:11,763 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:11,763 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:11,764 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-07-10 15:27:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:11,786 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:11,787 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] [2020-07-10 15:27:11,787 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:11,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1994596369, now seen corresponding path program 1 times [2020-07-10 15:27:11,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:11,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009205688] [2020-07-10 15:27:11,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:12,027 INFO L280 TraceCheckUtils]: 0: Hoare triple {55#(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; {46#true} is VALID [2020-07-10 15:27:12,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-10 15:27:12,028 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} #123#return; {46#true} is VALID [2020-07-10 15:27:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:12,041 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} ~cond := #in~cond; {46#true} is VALID [2020-07-10 15:27:12,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume 0 == ~cond;assume false; {47#false} is VALID [2020-07-10 15:27:12,043 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#false} assume true; {47#false} is VALID [2020-07-10 15:27:12,043 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#false} {46#true} #119#return; {47#false} is VALID [2020-07-10 15:27:12,045 INFO L263 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {55#(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:27:12,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#(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; {46#true} is VALID [2020-07-10 15:27:12,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-10 15:27:12,047 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} #123#return; {46#true} is VALID [2020-07-10 15:27:12,047 INFO L263 TraceCheckUtils]: 4: Hoare triple {46#true} call #t~ret16 := main(); {46#true} is VALID [2020-07-10 15:27:12,048 INFO L280 TraceCheckUtils]: 5: Hoare triple {46#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {46#true} is VALID [2020-07-10 15:27:12,048 INFO L280 TraceCheckUtils]: 6: Hoare triple {46#true} assume !(~N~0 <= 0); {46#true} is VALID [2020-07-10 15:27:12,049 INFO L263 TraceCheckUtils]: 7: Hoare triple {46#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {46#true} is VALID [2020-07-10 15:27:12,049 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#true} ~cond := #in~cond; {46#true} is VALID [2020-07-10 15:27:12,050 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#true} assume 0 == ~cond;assume false; {47#false} is VALID [2020-07-10 15:27:12,051 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#false} assume true; {47#false} is VALID [2020-07-10 15:27:12,051 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {47#false} {46#true} #119#return; {47#false} is VALID [2020-07-10 15:27:12,051 INFO L280 TraceCheckUtils]: 12: Hoare triple {47#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {47#false} is VALID [2020-07-10 15:27:12,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-10 15:27:12,052 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-10 15:27:12,053 INFO L280 TraceCheckUtils]: 15: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-10 15:27:12,053 INFO L280 TraceCheckUtils]: 16: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-10 15:27:12,054 INFO L280 TraceCheckUtils]: 17: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-10 15:27:12,054 INFO L280 TraceCheckUtils]: 18: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-10 15:27:12,054 INFO L280 TraceCheckUtils]: 19: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-10 15:27:12,055 INFO L280 TraceCheckUtils]: 20: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-10 15:27:12,055 INFO L280 TraceCheckUtils]: 21: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-10 15:27:12,055 INFO L280 TraceCheckUtils]: 22: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-10 15:27:12,056 INFO L280 TraceCheckUtils]: 23: Hoare triple {47#false} assume !!(~i~0 < ~N~0);call #t~mem15 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {47#false} is VALID [2020-07-10 15:27:12,056 INFO L263 TraceCheckUtils]: 24: Hoare triple {47#false} call __VERIFIER_assert((if #t~mem15 == 2 * ~N~0 then 1 else 0)); {47#false} is VALID [2020-07-10 15:27:12,057 INFO L280 TraceCheckUtils]: 25: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2020-07-10 15:27:12,057 INFO L280 TraceCheckUtils]: 26: Hoare triple {47#false} assume 0 == ~cond; {47#false} is VALID [2020-07-10 15:27:12,057 INFO L280 TraceCheckUtils]: 27: Hoare triple {47#false} assume !false; {47#false} is VALID [2020-07-10 15:27:12,061 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:27:12,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009205688] [2020-07-10 15:27:12,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:12,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:27:12,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755896008] [2020-07-10 15:27:12,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 15:27:12,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:12,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:27:12,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:12,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:27:12,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:12,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:27:12,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:12,157 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-07-10 15:27:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:12,439 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2020-07-10 15:27:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:27:12,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-07-10 15:27:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-10 15:27:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-10 15:27:12,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2020-07-10 15:27:12,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:12,633 INFO L225 Difference]: With dead ends: 76 [2020-07-10 15:27:12,633 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 15:27:12,637 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:27:12,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 15:27:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-07-10 15:27:12,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:12,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2020-07-10 15:27:12,690 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-10 15:27:12,690 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-10 15:27:12,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:12,695 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-10 15:27:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-10 15:27:12,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:12,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:12,697 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2020-07-10 15:27:12,697 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2020-07-10 15:27:12,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:12,702 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-10 15:27:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-10 15:27:12,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:12,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:12,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:12,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-10 15:27:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2020-07-10 15:27:12,708 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 28 [2020-07-10 15:27:12,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:12,708 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2020-07-10 15:27:12,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:27:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-10 15:27:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:12,710 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:12,710 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] [2020-07-10 15:27:12,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:12,711 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:12,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1530390023, now seen corresponding path program 1 times [2020-07-10 15:27:12,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:12,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157545218] [2020-07-10 15:27:12,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:12,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {295#(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; {284#true} is VALID [2020-07-10 15:27:12,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {284#true} assume true; {284#true} is VALID [2020-07-10 15:27:12,902 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {284#true} {284#true} #123#return; {284#true} is VALID [2020-07-10 15:27:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:12,911 INFO L280 TraceCheckUtils]: 0: Hoare triple {284#true} ~cond := #in~cond; {284#true} is VALID [2020-07-10 15:27:12,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {284#true} assume !(0 == ~cond); {284#true} is VALID [2020-07-10 15:27:12,912 INFO L280 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2020-07-10 15:27:12,914 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {284#true} {289#(<= 1 ~N~0)} #119#return; {289#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:12,915 INFO L263 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {295#(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:27:12,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {295#(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; {284#true} is VALID [2020-07-10 15:27:12,916 INFO L280 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2020-07-10 15:27:12,916 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #123#return; {284#true} is VALID [2020-07-10 15:27:12,916 INFO L263 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret16 := main(); {284#true} is VALID [2020-07-10 15:27:12,916 INFO L280 TraceCheckUtils]: 5: Hoare triple {284#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {284#true} is VALID [2020-07-10 15:27:12,918 INFO L280 TraceCheckUtils]: 6: Hoare triple {284#true} assume !(~N~0 <= 0); {289#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:12,919 INFO L263 TraceCheckUtils]: 7: Hoare triple {289#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {284#true} is VALID [2020-07-10 15:27:12,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {284#true} ~cond := #in~cond; {284#true} is VALID [2020-07-10 15:27:12,919 INFO L280 TraceCheckUtils]: 9: Hoare triple {284#true} assume !(0 == ~cond); {284#true} is VALID [2020-07-10 15:27:12,920 INFO L280 TraceCheckUtils]: 10: Hoare triple {284#true} assume true; {284#true} is VALID [2020-07-10 15:27:12,921 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {284#true} {289#(<= 1 ~N~0)} #119#return; {289#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:12,922 INFO L280 TraceCheckUtils]: 12: Hoare triple {289#(<= 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(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {294#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:27:12,923 INFO L280 TraceCheckUtils]: 13: Hoare triple {294#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {285#false} is VALID [2020-07-10 15:27:12,924 INFO L280 TraceCheckUtils]: 14: Hoare triple {285#false} ~i~0 := 0; {285#false} is VALID [2020-07-10 15:27:12,924 INFO L280 TraceCheckUtils]: 15: Hoare triple {285#false} assume !(~i~0 < ~N~0); {285#false} is VALID [2020-07-10 15:27:12,924 INFO L280 TraceCheckUtils]: 16: Hoare triple {285#false} ~i~0 := 0; {285#false} is VALID [2020-07-10 15:27:12,924 INFO L280 TraceCheckUtils]: 17: Hoare triple {285#false} assume !(~i~0 < ~N~0); {285#false} is VALID [2020-07-10 15:27:12,925 INFO L280 TraceCheckUtils]: 18: Hoare triple {285#false} ~i~0 := 0; {285#false} is VALID [2020-07-10 15:27:12,925 INFO L280 TraceCheckUtils]: 19: Hoare triple {285#false} assume !(~i~0 < ~N~0); {285#false} is VALID [2020-07-10 15:27:12,925 INFO L280 TraceCheckUtils]: 20: Hoare triple {285#false} ~i~0 := 0; {285#false} is VALID [2020-07-10 15:27:12,926 INFO L280 TraceCheckUtils]: 21: Hoare triple {285#false} assume !(~i~0 < ~N~0); {285#false} is VALID [2020-07-10 15:27:12,926 INFO L280 TraceCheckUtils]: 22: Hoare triple {285#false} ~i~0 := 0; {285#false} is VALID [2020-07-10 15:27:12,926 INFO L280 TraceCheckUtils]: 23: Hoare triple {285#false} assume !!(~i~0 < ~N~0);call #t~mem15 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {285#false} is VALID [2020-07-10 15:27:12,927 INFO L263 TraceCheckUtils]: 24: Hoare triple {285#false} call __VERIFIER_assert((if #t~mem15 == 2 * ~N~0 then 1 else 0)); {285#false} is VALID [2020-07-10 15:27:12,927 INFO L280 TraceCheckUtils]: 25: Hoare triple {285#false} ~cond := #in~cond; {285#false} is VALID [2020-07-10 15:27:12,927 INFO L280 TraceCheckUtils]: 26: Hoare triple {285#false} assume 0 == ~cond; {285#false} is VALID [2020-07-10 15:27:12,927 INFO L280 TraceCheckUtils]: 27: Hoare triple {285#false} assume !false; {285#false} is VALID [2020-07-10 15:27:12,929 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:27:12,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157545218] [2020-07-10 15:27:12,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:12,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:27:12,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077312875] [2020-07-10 15:27:12,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-10 15:27:12,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:12,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:12,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:12,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:12,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:12,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:12,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:12,970 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 5 states. [2020-07-10 15:27:13,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:13,342 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2020-07-10 15:27:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:27:13,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-07-10 15:27:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2020-07-10 15:27:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2020-07-10 15:27:13,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2020-07-10 15:27:13,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:13,493 INFO L225 Difference]: With dead ends: 75 [2020-07-10 15:27:13,493 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 15:27:13,495 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:27:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 15:27:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2020-07-10 15:27:13,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:13,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 43 states. [2020-07-10 15:27:13,551 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 43 states. [2020-07-10 15:27:13,551 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 43 states. [2020-07-10 15:27:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:13,556 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-10 15:27:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-10 15:27:13,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:13,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:13,557 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 52 states. [2020-07-10 15:27:13,558 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 52 states. [2020-07-10 15:27:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:13,561 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-07-10 15:27:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2020-07-10 15:27:13,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:13,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:13,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:13,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 15:27:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2020-07-10 15:27:13,566 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 28 [2020-07-10 15:27:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:13,566 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2020-07-10 15:27:13,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-07-10 15:27:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:27:13,568 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:13,568 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:27:13,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:27:13,568 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:13,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:13,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1357692925, now seen corresponding path program 1 times [2020-07-10 15:27:13,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:13,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109080536] [2020-07-10 15:27:13,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:13,739 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:13,740 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:13,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:27:13,815 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:27:13,815 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:13,815 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:13,816 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:27:13,816 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:13,816 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:13,816 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:13,816 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:13,816 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:13,816 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:13,817 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:13,817 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:13,817 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:13,817 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:13,817 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:13,817 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:13,817 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:13,818 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:27:13,818 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:13,818 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:13,818 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:13,818 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:13,818 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:13,818 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:13,819 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:27:13,819 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:13,819 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:27:13,819 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:13,819 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:27:13,819 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:27:13,819 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-10 15:27:13,819 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-10 15:27:13,820 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:27:13,820 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-10 15:27:13,820 WARN L170 areAnnotationChecker]: L56-2 has no Hoare annotation [2020-07-10 15:27:13,820 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:27:13,820 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:27:13,820 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-10 15:27:13,820 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-10 15:27:13,821 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-10 15:27:13,821 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-10 15:27:13,821 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-10 15:27:13,821 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-10 15:27:13,821 WARN L170 areAnnotationChecker]: L56-4 has no Hoare annotation [2020-07-10 15:27:13,821 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-10 15:27:13,821 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-10 15:27:13,821 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:27:13,822 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:27:13,822 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-10 15:27:13,822 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2020-07-10 15:27:13,822 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-10 15:27:13,822 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:27:13,822 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:27:13,822 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-10 15:27:13,823 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-10 15:27:13,823 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-10 15:27:13,823 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2020-07-10 15:27:13,823 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2020-07-10 15:27:13,823 WARN L170 areAnnotationChecker]: L51-3 has no Hoare annotation [2020-07-10 15:27:13,823 WARN L170 areAnnotationChecker]: L51-4 has no Hoare annotation [2020-07-10 15:27:13,823 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-10 15:27:13,824 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:27:13,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:13 BoogieIcfgContainer [2020-07-10 15:27:13,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:13,830 INFO L168 Benchmark]: Toolchain (without parser) took 3259.36 ms. Allocated memory was 135.3 MB in the beginning and 256.9 MB in the end (delta: 121.6 MB). Free memory was 100.4 MB in the beginning and 211.8 MB in the end (delta: -111.4 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:13,830 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory was 118.3 MB in the beginning and 118.1 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:27:13,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.25 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 178.1 MB in the end (delta: -77.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:13,832 INFO L168 Benchmark]: Boogie Preprocessor took 107.03 ms. Allocated memory is still 199.2 MB. Free memory was 178.1 MB in the beginning and 175.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:13,833 INFO L168 Benchmark]: RCFGBuilder took 627.63 ms. Allocated memory is still 199.2 MB. Free memory was 175.5 MB in the beginning and 143.7 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:13,834 INFO L168 Benchmark]: TraceAbstraction took 2121.31 ms. Allocated memory was 199.2 MB in the beginning and 256.9 MB in the end (delta: 57.7 MB). Free memory was 143.0 MB in the beginning and 211.8 MB in the end (delta: -68.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:27:13,837 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.21 ms. Allocated memory is still 135.3 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 393.25 ms. Allocated memory was 135.3 MB in the beginning and 199.2 MB in the end (delta: 64.0 MB). Free memory was 100.2 MB in the beginning and 178.1 MB in the end (delta: -77.9 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.03 ms. Allocated memory is still 199.2 MB. Free memory was 178.1 MB in the beginning and 175.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 627.63 ms. Allocated memory is still 199.2 MB. Free memory was 175.5 MB in the beginning and 143.7 MB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2121.31 ms. Allocated memory was 199.2 MB in the beginning and 256.9 MB in the end (delta: 57.7 MB). Free memory was 143.0 MB in the beginning and 211.8 MB in the end (delta: -68.8 MB). There was no memory consumed. 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] long long *a = malloc(sizeof(long long)*N); [L28] long long *b = malloc(sizeof(long long)*N); [L30] sum[0] = 0 [L31] i=0 VAL [\old(N)=0, a={-1:0}, b={4:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={4:0}, N=1, sum={6:0}] [L31] COND TRUE i