/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/s1liff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:35,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:35,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:35,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:35,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:35,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:35,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:35,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:35,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:35,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:35,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:35,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:35,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:35,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:35,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:35,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:35,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:35,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:35,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:35,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:35,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:35,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:35,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:35,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:35,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:35,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:35,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:35,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:35,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:35,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:35,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:35,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:35,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:35,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:35,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:35,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:35,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:35,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:35,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:35,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:35,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:35,194 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-17 22:49:35,209 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:35,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:35,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:35,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:35,212 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:35,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:35,212 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:35,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:35,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:35,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:35,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:35,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:35,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:35,213 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:35,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:35,214 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:35,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:35,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:35,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:35,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:35,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:35,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:35,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:35,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:35,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:35,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:35,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:35,216 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:35,217 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:35,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:35,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:35,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:35,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:35,533 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:35,534 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:35,535 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s1liff.c [2020-07-17 22:49:35,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/502bcdcb0/8e75471d219d41bdb1540eb54454eb38/FLAGe9d63d421 [2020-07-17 22:49:36,121 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:36,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s1liff.c [2020-07-17 22:49:36,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/502bcdcb0/8e75471d219d41bdb1540eb54454eb38/FLAGe9d63d421 [2020-07-17 22:49:36,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/502bcdcb0/8e75471d219d41bdb1540eb54454eb38 [2020-07-17 22:49:36,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:36,561 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:36,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:36,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:36,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:36,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:36" (1/1) ... [2020-07-17 22:49:36,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce2c956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:36, skipping insertion in model container [2020-07-17 22:49:36,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:36" (1/1) ... [2020-07-17 22:49:36,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:36,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:36,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:36,817 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:36,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:36,864 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:36,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:36 WrapperNode [2020-07-17 22:49:36,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:36,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:36,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:36,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:36,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:36" (1/1) ... [2020-07-17 22:49:36,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:36" (1/1) ... [2020-07-17 22:49:36,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:36" (1/1) ... [2020-07-17 22:49:36,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:36" (1/1) ... [2020-07-17 22:49:36,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:36" (1/1) ... [2020-07-17 22:49:37,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:36" (1/1) ... [2020-07-17 22:49:37,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:36" (1/1) ... [2020-07-17 22:49:37,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:37,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:37,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:37,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:37,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:36" (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-17 22:49:37,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:37,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:37,086 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:37,086 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:37,086 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:37,087 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:49:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:37,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:37,496 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:37,497 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:49:37,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:37 BoogieIcfgContainer [2020-07-17 22:49:37,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:37,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:37,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:37,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:37,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:36" (1/3) ... [2020-07-17 22:49:37,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f2a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:37, skipping insertion in model container [2020-07-17 22:49:37,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:36" (2/3) ... [2020-07-17 22:49:37,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56f2a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:37, skipping insertion in model container [2020-07-17 22:49:37,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:37" (3/3) ... [2020-07-17 22:49:37,510 INFO L109 eAbstractionObserver]: Analyzing ICFG s1liff.c [2020-07-17 22:49:37,523 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:37,531 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:37,545 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:37,583 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:37,583 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:37,586 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:37,586 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:37,587 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:37,587 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:37,587 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:37,587 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-17 22:49:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:49:37,613 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:37,614 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-17 22:49:37,614 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:37,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:37,620 INFO L82 PathProgramCache]: Analyzing trace with hash -88121349, now seen corresponding path program 1 times [2020-07-17 22:49:37,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:37,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671596613] [2020-07-17 22:49:37,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:37,892 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#(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; {38#true} is VALID [2020-07-17 22:49:37,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:49:37,893 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-17 22:49:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:37,906 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-17 22:49:37,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-17 22:49:37,908 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-17 22:49:37,908 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-17 22:49:37,910 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:37,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(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; {38#true} is VALID [2020-07-17 22:49:37,911 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:49:37,911 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-17 22:49:37,912 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret11 := main(); {38#true} is VALID [2020-07-17 22:49:37,912 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {38#true} is VALID [2020-07-17 22:49:37,913 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~N~0 <= 0); {38#true} is VALID [2020-07-17 22:49:37,913 INFO L263 TraceCheckUtils]: 7: Hoare triple {38#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {38#true} is VALID [2020-07-17 22:49:37,914 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-17 22:49:37,915 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-17 22:49:37,915 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-17 22:49:37,916 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-17 22:49:37,916 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#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(~N~0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {39#false} is VALID [2020-07-17 22:49:37,917 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-17 22:49:37,917 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-17 22:49:37,917 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-17 22:49:37,918 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-17 22:49:37,918 INFO L280 TraceCheckUtils]: 17: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-17 22:49:37,919 INFO L280 TraceCheckUtils]: 18: Hoare triple {39#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {39#false} is VALID [2020-07-17 22:49:37,919 INFO L263 TraceCheckUtils]: 19: Hoare triple {39#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {39#false} is VALID [2020-07-17 22:49:37,919 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-17 22:49:37,920 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-17 22:49:37,920 INFO L280 TraceCheckUtils]: 22: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-17 22:49:37,924 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-17 22:49:37,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671596613] [2020-07-17 22:49:37,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:37,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:37,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565603341] [2020-07-17 22:49:37,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:49:37,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:37,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:37,989 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-17 22:49:37,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:37,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:37,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:38,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:38,003 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-17 22:49:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:38,222 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2020-07-17 22:49:38,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:38,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:49:38,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:38,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-17 22:49:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-17 22:49:38,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2020-07-17 22:49:38,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:38,399 INFO L225 Difference]: With dead ends: 60 [2020-07-17 22:49:38,399 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 22:49:38,403 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-17 22:49:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 22:49:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-17 22:49:38,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:38,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-17 22:49:38,461 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-17 22:49:38,461 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-17 22:49:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:38,465 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-17 22:49:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-17 22:49:38,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:38,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:38,467 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-17 22:49:38,467 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-17 22:49:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:38,471 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-17 22:49:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-17 22:49:38,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:38,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:38,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:38,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:49:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-17 22:49:38,477 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2020-07-17 22:49:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:38,478 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-17 22:49:38,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-17 22:49:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:49:38,479 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:38,479 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-17 22:49:38,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:38,480 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:38,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:38,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1099238599, now seen corresponding path program 1 times [2020-07-17 22:49:38,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:38,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743072146] [2020-07-17 22:49:38,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:38,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#(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; {221#true} is VALID [2020-07-17 22:49:38,650 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:38,650 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {221#true} {221#true} #86#return; {221#true} is VALID [2020-07-17 22:49:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:38,678 INFO L280 TraceCheckUtils]: 0: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-17 22:49:38,679 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-17 22:49:38,679 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:38,680 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #82#return; {226#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:38,682 INFO L263 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:38,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {232#(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; {221#true} is VALID [2020-07-17 22:49:38,683 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:38,683 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #86#return; {221#true} is VALID [2020-07-17 22:49:38,683 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret11 := main(); {221#true} is VALID [2020-07-17 22:49:38,684 INFO L280 TraceCheckUtils]: 5: Hoare triple {221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {221#true} is VALID [2020-07-17 22:49:38,686 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {226#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:38,686 INFO L263 TraceCheckUtils]: 7: Hoare triple {226#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {221#true} is VALID [2020-07-17 22:49:38,686 INFO L280 TraceCheckUtils]: 8: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-17 22:49:38,687 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-17 22:49:38,687 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:49:38,688 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #82#return; {226#(<= 1 ~N~0)} is VALID [2020-07-17 22:49:38,690 INFO L280 TraceCheckUtils]: 12: Hoare triple {226#(<= 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(~N~0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:49:38,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-17 22:49:38,697 INFO L280 TraceCheckUtils]: 14: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-17 22:49:38,697 INFO L280 TraceCheckUtils]: 15: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-17 22:49:38,697 INFO L280 TraceCheckUtils]: 16: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-17 22:49:38,698 INFO L280 TraceCheckUtils]: 17: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-17 22:49:38,698 INFO L280 TraceCheckUtils]: 18: Hoare triple {222#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {222#false} is VALID [2020-07-17 22:49:38,698 INFO L263 TraceCheckUtils]: 19: Hoare triple {222#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {222#false} is VALID [2020-07-17 22:49:38,699 INFO L280 TraceCheckUtils]: 20: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2020-07-17 22:49:38,699 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume 0 == ~cond; {222#false} is VALID [2020-07-17 22:49:38,699 INFO L280 TraceCheckUtils]: 22: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-17 22:49:38,705 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-17 22:49:38,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743072146] [2020-07-17 22:49:38,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:38,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:49:38,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773930168] [2020-07-17 22:49:38,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-17 22:49:38,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:38,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:49:38,745 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-17 22:49:38,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:49:38,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:38,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:49:38,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:49:38,748 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2020-07-17 22:49:39,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:39,019 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2020-07-17 22:49:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:49:39,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-17 22:49:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-17 22:49:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:49:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-17 22:49:39,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2020-07-17 22:49:39,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:39,121 INFO L225 Difference]: With dead ends: 48 [2020-07-17 22:49:39,121 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:49:39,122 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-17 22:49:39,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:49:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2020-07-17 22:49:39,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:39,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2020-07-17 22:49:39,150 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2020-07-17 22:49:39,150 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2020-07-17 22:49:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:39,153 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-17 22:49:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:49:39,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:39,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:39,154 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2020-07-17 22:49:39,155 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2020-07-17 22:49:39,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:39,158 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-17 22:49:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:49:39,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:39,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:39,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:39,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:39,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:49:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-17 22:49:39,162 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2020-07-17 22:49:39,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:39,162 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-17 22:49:39,162 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:49:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-17 22:49:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:49:39,164 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:39,164 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] [2020-07-17 22:49:39,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:49:39,164 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:39,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:39,165 INFO L82 PathProgramCache]: Analyzing trace with hash 188437731, now seen corresponding path program 1 times [2020-07-17 22:49:39,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:39,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091995028] [2020-07-17 22:49:39,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:39,332 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:39,333 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:39,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:49:39,406 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:39,407 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:39,407 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:39,407 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:39,407 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:39,408 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:39,408 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:39,408 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:39,408 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:39,408 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:39,408 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:39,409 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:39,409 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:39,409 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:39,409 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:39,409 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:39,410 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:39,410 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:39,410 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:39,410 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:39,411 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:39,411 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:39,411 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:39,411 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:39,411 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:39,412 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:39,412 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:39,412 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:39,412 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:39,412 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:39,413 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:39,413 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-17 22:49:39,413 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-17 22:49:39,413 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-17 22:49:39,413 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:39,414 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:39,414 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:49:39,414 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-17 22:49:39,414 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:49:39,414 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:49:39,414 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-17 22:49:39,415 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-17 22:49:39,415 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-17 22:49:39,415 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-17 22:49:39,415 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-17 22:49:39,415 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-17 22:49:39,416 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:49:39,416 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:49:39,416 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-17 22:49:39,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:39 BoogieIcfgContainer [2020-07-17 22:49:39,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:39,423 INFO L168 Benchmark]: Toolchain (without parser) took 2863.41 ms. Allocated memory was 138.9 MB in the beginning and 235.4 MB in the end (delta: 96.5 MB). Free memory was 103.8 MB in the beginning and 106.0 MB in the end (delta: -2.2 MB). Peak memory consumption was 94.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:39,424 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:39,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.48 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 92.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:39,426 INFO L168 Benchmark]: Boogie Preprocessor took 59.73 ms. Allocated memory is still 201.3 MB. Free memory was 180.0 MB in the beginning and 177.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:39,427 INFO L168 Benchmark]: RCFGBuilder took 490.58 ms. Allocated memory is still 201.3 MB. Free memory was 177.6 MB in the beginning and 151.5 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:39,428 INFO L168 Benchmark]: TraceAbstraction took 1917.08 ms. Allocated memory was 201.3 MB in the beginning and 235.4 MB in the end (delta: 34.1 MB). Free memory was 151.5 MB in the beginning and 106.0 MB in the end (delta: 45.5 MB). Peak memory consumption was 79.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:39,432 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 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 303.48 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 92.2 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.73 ms. Allocated memory is still 201.3 MB. Free memory was 180.0 MB in the beginning and 177.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 490.58 ms. Allocated memory is still 201.3 MB. Free memory was 177.6 MB in the beginning and 151.5 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1917.08 ms. Allocated memory was 201.3 MB in the beginning and 235.4 MB in the end (delta: 34.1 MB). Free memory was 151.5 MB in the beginning and 106.0 MB in the end (delta: 45.5 MB). Peak memory consumption was 79.6 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] = N [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={5:0}] [L30] COND TRUE i