/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/ss2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:13,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:13,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:13,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:13,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:13,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:13,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:13,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:13,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:13,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:13,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:13,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:13,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:13,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:13,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:13,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:13,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:13,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:13,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:13,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:13,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:13,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:13,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:13,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:13,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:13,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:13,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:13,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:13,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:13,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:13,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:13,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:13,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:13,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:13,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:13,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:13,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:13,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:13,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:13,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:13,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:13,517 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:13,531 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:13,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:13,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:13,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:13,533 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:13,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:13,534 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:13,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:13,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:13,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:13,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:13,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:13,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:13,535 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:13,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:13,538 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:13,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:13,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:13,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:13,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:13,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:13,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:13,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:13,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:13,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:13,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:13,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:13,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:13,540 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:13,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:13,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:13,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:13,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:13,850 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:13,850 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:13,851 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ss2f.c [2020-07-10 15:27:13,929 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989fb71e6/bd6d447e1b1642b4855e2e7dd02245db/FLAG289d9143f [2020-07-10 15:27:14,334 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:14,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss2f.c [2020-07-10 15:27:14,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989fb71e6/bd6d447e1b1642b4855e2e7dd02245db/FLAG289d9143f [2020-07-10 15:27:14,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989fb71e6/bd6d447e1b1642b4855e2e7dd02245db [2020-07-10 15:27:14,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:14,693 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:14,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:14,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:14,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:14,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:14" (1/1) ... [2020-07-10 15:27:14,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b18847a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:14, skipping insertion in model container [2020-07-10 15:27:14,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:14" (1/1) ... [2020-07-10 15:27:14,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:14,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:14,928 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:14,939 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:14,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:14,989 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:14,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:14 WrapperNode [2020-07-10 15:27:14,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:14,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:14,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:14,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:15,085 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:14" (1/1) ... [2020-07-10 15:27:15,087 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:14" (1/1) ... [2020-07-10 15:27:15,112 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:14" (1/1) ... [2020-07-10 15:27:15,113 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:14" (1/1) ... [2020-07-10 15:27:15,143 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:14" (1/1) ... [2020-07-10 15:27:15,155 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:14" (1/1) ... [2020-07-10 15:27:15,157 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:14" (1/1) ... [2020-07-10 15:27:15,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:15,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:15,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:15,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:15,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:14" (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:15,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:15,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:15,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:27:15,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:15,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:15,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:15,237 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:27:15,237 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:27:15,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:15,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:27:15,237 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:27:15,237 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:15,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:27:15,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:27:15,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:27:15,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:27:15,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:27:15,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:15,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:15,741 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:15,741 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-10 15:27:15,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:15 BoogieIcfgContainer [2020-07-10 15:27:15,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:15,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:15,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:15,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:15,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:14" (1/3) ... [2020-07-10 15:27:15,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489bd304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:15, skipping insertion in model container [2020-07-10 15:27:15,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:14" (2/3) ... [2020-07-10 15:27:15,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489bd304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:15, skipping insertion in model container [2020-07-10 15:27:15,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:15" (3/3) ... [2020-07-10 15:27:15,754 INFO L109 eAbstractionObserver]: Analyzing ICFG ss2f.c [2020-07-10 15:27:15,765 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:15,772 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:15,785 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:15,809 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:15,809 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:15,809 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:15,809 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:15,809 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:15,810 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:15,810 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:15,810 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-07-10 15:27:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:27:15,836 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:15,838 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-10 15:27:15,838 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:15,845 INFO L82 PathProgramCache]: Analyzing trace with hash -96589013, now seen corresponding path program 1 times [2020-07-10 15:27:15,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:15,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190710845] [2020-07-10 15:27:15,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:16,064 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#(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; {49#true} is VALID [2020-07-10 15:27:16,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#true} assume true; {49#true} is VALID [2020-07-10 15:27:16,066 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {49#true} {49#true} #137#return; {49#true} is VALID [2020-07-10 15:27:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:16,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {49#true} ~cond := #in~cond; {49#true} is VALID [2020-07-10 15:27:16,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#true} assume 0 == ~cond;assume false; {50#false} is VALID [2020-07-10 15:27:16,078 INFO L280 TraceCheckUtils]: 2: Hoare triple {50#false} assume true; {50#false} is VALID [2020-07-10 15:27:16,078 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {50#false} {49#true} #133#return; {50#false} is VALID [2020-07-10 15:27:16,081 INFO L263 TraceCheckUtils]: 0: Hoare triple {49#true} call ULTIMATE.init(); {58#(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:16,081 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(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; {49#true} is VALID [2020-07-10 15:27:16,082 INFO L280 TraceCheckUtils]: 2: Hoare triple {49#true} assume true; {49#true} is VALID [2020-07-10 15:27:16,082 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {49#true} {49#true} #137#return; {49#true} is VALID [2020-07-10 15:27:16,083 INFO L263 TraceCheckUtils]: 4: Hoare triple {49#true} call #t~ret18 := main(); {49#true} is VALID [2020-07-10 15:27:16,083 INFO L280 TraceCheckUtils]: 5: Hoare triple {49#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {49#true} is VALID [2020-07-10 15:27:16,084 INFO L280 TraceCheckUtils]: 6: Hoare triple {49#true} assume !(~N~0 <= 0); {49#true} is VALID [2020-07-10 15:27:16,084 INFO L263 TraceCheckUtils]: 7: Hoare triple {49#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {49#true} is VALID [2020-07-10 15:27:16,085 INFO L280 TraceCheckUtils]: 8: Hoare triple {49#true} ~cond := #in~cond; {49#true} is VALID [2020-07-10 15:27:16,087 INFO L280 TraceCheckUtils]: 9: Hoare triple {49#true} assume 0 == ~cond;assume false; {50#false} is VALID [2020-07-10 15:27:16,087 INFO L280 TraceCheckUtils]: 10: Hoare triple {50#false} assume true; {50#false} is VALID [2020-07-10 15:27:16,088 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {50#false} {49#true} #133#return; {50#false} is VALID [2020-07-10 15:27:16,088 INFO L280 TraceCheckUtils]: 12: Hoare triple {50#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 write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {50#false} is VALID [2020-07-10 15:27:16,089 INFO L280 TraceCheckUtils]: 13: Hoare triple {50#false} assume !(~i~0 < ~N~0); {50#false} is VALID [2020-07-10 15:27:16,089 INFO L280 TraceCheckUtils]: 14: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2020-07-10 15:27:16,090 INFO L280 TraceCheckUtils]: 15: Hoare triple {50#false} assume !(~i~0 < ~N~0); {50#false} is VALID [2020-07-10 15:27:16,090 INFO L280 TraceCheckUtils]: 16: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2020-07-10 15:27:16,090 INFO L280 TraceCheckUtils]: 17: Hoare triple {50#false} assume !(~i~0 < ~N~0); {50#false} is VALID [2020-07-10 15:27:16,091 INFO L280 TraceCheckUtils]: 18: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2020-07-10 15:27:16,091 INFO L280 TraceCheckUtils]: 19: Hoare triple {50#false} assume !true; {50#false} is VALID [2020-07-10 15:27:16,092 INFO L280 TraceCheckUtils]: 20: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2020-07-10 15:27:16,092 INFO L280 TraceCheckUtils]: 21: Hoare triple {50#false} assume !true; {50#false} is VALID [2020-07-10 15:27:16,093 INFO L280 TraceCheckUtils]: 22: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2020-07-10 15:27:16,093 INFO L280 TraceCheckUtils]: 23: Hoare triple {50#false} assume !true; {50#false} is VALID [2020-07-10 15:27:16,093 INFO L280 TraceCheckUtils]: 24: Hoare triple {50#false} ~i~0 := 0; {50#false} is VALID [2020-07-10 15:27:16,094 INFO L280 TraceCheckUtils]: 25: Hoare triple {50#false} assume !!(~i~0 < ~N~0);call #t~mem17 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {50#false} is VALID [2020-07-10 15:27:16,094 INFO L263 TraceCheckUtils]: 26: Hoare triple {50#false} call __VERIFIER_assert((if #t~mem17 == ~N~0 * (2 + ~N~0) then 1 else 0)); {50#false} is VALID [2020-07-10 15:27:16,095 INFO L280 TraceCheckUtils]: 27: Hoare triple {50#false} ~cond := #in~cond; {50#false} is VALID [2020-07-10 15:27:16,095 INFO L280 TraceCheckUtils]: 28: Hoare triple {50#false} assume 0 == ~cond; {50#false} is VALID [2020-07-10 15:27:16,096 INFO L280 TraceCheckUtils]: 29: Hoare triple {50#false} assume !false; {50#false} is VALID [2020-07-10 15:27:16,101 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:16,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190710845] [2020-07-10 15:27:16,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:16,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:27:16,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164474475] [2020-07-10 15:27:16,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 15:27:16,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:16,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:27:16,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:16,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:27:16,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:16,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:27:16,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:16,182 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-10 15:27:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:16,459 INFO L93 Difference]: Finished difference Result 82 states and 113 transitions. [2020-07-10 15:27:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:27:16,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-10 15:27:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-10 15:27:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:16,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2020-07-10 15:27:16,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2020-07-10 15:27:16,669 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:16,683 INFO L225 Difference]: With dead ends: 82 [2020-07-10 15:27:16,683 INFO L226 Difference]: Without dead ends: 41 [2020-07-10 15:27:16,687 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:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-10 15:27:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-10 15:27:16,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:16,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2020-07-10 15:27:16,743 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-10 15:27:16,744 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-10 15:27:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:16,749 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2020-07-10 15:27:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2020-07-10 15:27:16,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:16,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:16,750 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-10 15:27:16,751 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-10 15:27:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:16,756 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2020-07-10 15:27:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2020-07-10 15:27:16,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:16,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:16,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:16,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 15:27:16,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2020-07-10 15:27:16,762 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2020-07-10 15:27:16,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:16,763 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2020-07-10 15:27:16,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:27:16,763 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2020-07-10 15:27:16,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:27:16,765 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:16,765 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-10 15:27:16,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:16,766 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:16,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:16,766 INFO L82 PathProgramCache]: Analyzing trace with hash -552343525, now seen corresponding path program 1 times [2020-07-10 15:27:16,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:16,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067686236] [2020-07-10 15:27:16,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:16,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {316#(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; {305#true} is VALID [2020-07-10 15:27:16,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-10 15:27:16,884 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {305#true} {305#true} #137#return; {305#true} is VALID [2020-07-10 15:27:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:16,893 INFO L280 TraceCheckUtils]: 0: Hoare triple {305#true} ~cond := #in~cond; {305#true} is VALID [2020-07-10 15:27:16,894 INFO L280 TraceCheckUtils]: 1: Hoare triple {305#true} assume !(0 == ~cond); {305#true} is VALID [2020-07-10 15:27:16,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-10 15:27:16,895 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {305#true} {310#(<= 1 ~N~0)} #133#return; {310#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:16,897 INFO L263 TraceCheckUtils]: 0: Hoare triple {305#true} call ULTIMATE.init(); {316#(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:16,897 INFO L280 TraceCheckUtils]: 1: Hoare triple {316#(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; {305#true} is VALID [2020-07-10 15:27:16,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-10 15:27:16,898 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {305#true} {305#true} #137#return; {305#true} is VALID [2020-07-10 15:27:16,898 INFO L263 TraceCheckUtils]: 4: Hoare triple {305#true} call #t~ret18 := main(); {305#true} is VALID [2020-07-10 15:27:16,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {305#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {305#true} is VALID [2020-07-10 15:27:16,899 INFO L280 TraceCheckUtils]: 6: Hoare triple {305#true} assume !(~N~0 <= 0); {310#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:16,900 INFO L263 TraceCheckUtils]: 7: Hoare triple {310#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {305#true} is VALID [2020-07-10 15:27:16,900 INFO L280 TraceCheckUtils]: 8: Hoare triple {305#true} ~cond := #in~cond; {305#true} is VALID [2020-07-10 15:27:16,900 INFO L280 TraceCheckUtils]: 9: Hoare triple {305#true} assume !(0 == ~cond); {305#true} is VALID [2020-07-10 15:27:16,901 INFO L280 TraceCheckUtils]: 10: Hoare triple {305#true} assume true; {305#true} is VALID [2020-07-10 15:27:16,902 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {305#true} {310#(<= 1 ~N~0)} #133#return; {310#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:16,903 INFO L280 TraceCheckUtils]: 12: Hoare triple {310#(<= 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 write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {315#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:27:16,905 INFO L280 TraceCheckUtils]: 13: Hoare triple {315#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {306#false} is VALID [2020-07-10 15:27:16,905 INFO L280 TraceCheckUtils]: 14: Hoare triple {306#false} ~i~0 := 0; {306#false} is VALID [2020-07-10 15:27:16,905 INFO L280 TraceCheckUtils]: 15: Hoare triple {306#false} assume !(~i~0 < ~N~0); {306#false} is VALID [2020-07-10 15:27:16,906 INFO L280 TraceCheckUtils]: 16: Hoare triple {306#false} ~i~0 := 0; {306#false} is VALID [2020-07-10 15:27:16,906 INFO L280 TraceCheckUtils]: 17: Hoare triple {306#false} assume !(~i~0 < ~N~0); {306#false} is VALID [2020-07-10 15:27:16,906 INFO L280 TraceCheckUtils]: 18: Hoare triple {306#false} ~i~0 := 0; {306#false} is VALID [2020-07-10 15:27:16,907 INFO L280 TraceCheckUtils]: 19: Hoare triple {306#false} assume !(~i~0 < ~N~0); {306#false} is VALID [2020-07-10 15:27:16,907 INFO L280 TraceCheckUtils]: 20: Hoare triple {306#false} ~i~0 := 0; {306#false} is VALID [2020-07-10 15:27:16,907 INFO L280 TraceCheckUtils]: 21: Hoare triple {306#false} assume !(~i~0 < ~N~0); {306#false} is VALID [2020-07-10 15:27:16,908 INFO L280 TraceCheckUtils]: 22: Hoare triple {306#false} ~i~0 := 0; {306#false} is VALID [2020-07-10 15:27:16,908 INFO L280 TraceCheckUtils]: 23: Hoare triple {306#false} assume !(~i~0 < ~N~0); {306#false} is VALID [2020-07-10 15:27:16,908 INFO L280 TraceCheckUtils]: 24: Hoare triple {306#false} ~i~0 := 0; {306#false} is VALID [2020-07-10 15:27:16,908 INFO L280 TraceCheckUtils]: 25: Hoare triple {306#false} assume !!(~i~0 < ~N~0);call #t~mem17 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {306#false} is VALID [2020-07-10 15:27:16,909 INFO L263 TraceCheckUtils]: 26: Hoare triple {306#false} call __VERIFIER_assert((if #t~mem17 == ~N~0 * (2 + ~N~0) then 1 else 0)); {306#false} is VALID [2020-07-10 15:27:16,909 INFO L280 TraceCheckUtils]: 27: Hoare triple {306#false} ~cond := #in~cond; {306#false} is VALID [2020-07-10 15:27:16,909 INFO L280 TraceCheckUtils]: 28: Hoare triple {306#false} assume 0 == ~cond; {306#false} is VALID [2020-07-10 15:27:16,910 INFO L280 TraceCheckUtils]: 29: Hoare triple {306#false} assume !false; {306#false} is VALID [2020-07-10 15:27:16,911 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:16,912 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067686236] [2020-07-10 15:27:16,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:16,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:27:16,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035637089] [2020-07-10 15:27:16,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-10 15:27:16,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:16,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:27:16,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:16,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:27:16,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:16,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:27:16,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:27:16,958 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 5 states. [2020-07-10 15:27:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:17,454 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2020-07-10 15:27:17,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:27:17,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-10 15:27:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-10 15:27:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:27:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2020-07-10 15:27:17,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 101 transitions. [2020-07-10 15:27:17,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:17,635 INFO L225 Difference]: With dead ends: 83 [2020-07-10 15:27:17,635 INFO L226 Difference]: Without dead ends: 57 [2020-07-10 15:27:17,637 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:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-10 15:27:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2020-07-10 15:27:17,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:17,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 47 states. [2020-07-10 15:27:17,674 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 47 states. [2020-07-10 15:27:17,675 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 47 states. [2020-07-10 15:27:17,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:17,680 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-07-10 15:27:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-07-10 15:27:17,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:17,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:17,682 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 57 states. [2020-07-10 15:27:17,682 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 57 states. [2020-07-10 15:27:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:17,686 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2020-07-10 15:27:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2020-07-10 15:27:17,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:17,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:17,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:17,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 15:27:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2020-07-10 15:27:17,691 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 30 [2020-07-10 15:27:17,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:17,692 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2020-07-10 15:27:17,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:27:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2020-07-10 15:27:17,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 15:27:17,694 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:17,694 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, 1, 1, 1, 1] [2020-07-10 15:27:17,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:27:17,694 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:17,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:17,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1488976591, now seen corresponding path program 1 times [2020-07-10 15:27:17,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:17,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443762910] [2020-07-10 15:27:17,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:17,737 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:17,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1262462936] [2020-07-10 15:27:17,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:17,914 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:17,914 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:18,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:27:18,192 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:27:18,193 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:18,193 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:18,193 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:27:18,193 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:18,193 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:18,193 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:18,194 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:18,194 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:18,194 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:18,194 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:18,194 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:18,194 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:18,194 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:18,194 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:18,195 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:18,195 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:18,195 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:27:18,195 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:18,195 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:18,195 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:18,196 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:18,196 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:18,196 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:18,196 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:27:18,196 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:18,196 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:27:18,196 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:18,197 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:18,197 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:18,197 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:18,197 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-10 15:27:18,197 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:27:18,197 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:27:18,197 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-10 15:27:18,197 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:18,198 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:18,198 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:18,198 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2020-07-10 15:27:18,198 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2020-07-10 15:27:18,198 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2020-07-10 15:27:18,198 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:27:18,198 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:27:18,199 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2020-07-10 15:27:18,199 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 15:27:18,199 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-10 15:27:18,199 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-10 15:27:18,199 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-10 15:27:18,199 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-10 15:27:18,199 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-10 15:27:18,200 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-10 15:27:18,200 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-10 15:27:18,200 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-10 15:27:18,200 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-10 15:27:18,200 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2020-07-10 15:27:18,200 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-10 15:27:18,200 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-10 15:27:18,201 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-10 15:27:18,201 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-10 15:27:18,201 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2020-07-10 15:27:18,201 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-10 15:27:18,201 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2020-07-10 15:27:18,201 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2020-07-10 15:27:18,201 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2020-07-10 15:27:18,201 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2020-07-10 15:27:18,202 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2020-07-10 15:27:18,202 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:18,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:18 BoogieIcfgContainer [2020-07-10 15:27:18,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:18,208 INFO L168 Benchmark]: Toolchain (without parser) took 3513.91 ms. Allocated memory was 137.9 MB in the beginning and 248.5 MB in the end (delta: 110.6 MB). Free memory was 102.4 MB in the beginning and 175.1 MB in the end (delta: -72.6 MB). Peak memory consumption was 38.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:18,209 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 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:18,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.22 ms. Allocated memory is still 137.9 MB. Free memory was 102.0 MB in the beginning and 90.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:18,211 INFO L168 Benchmark]: Boogie Preprocessor took 177.15 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 90.3 MB in the beginning and 179.2 MB in the end (delta: -88.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:18,212 INFO L168 Benchmark]: RCFGBuilder took 576.22 ms. Allocated memory is still 201.9 MB. Free memory was 179.2 MB in the beginning and 146.9 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:18,213 INFO L168 Benchmark]: TraceAbstraction took 2458.03 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 146.2 MB in the beginning and 175.1 MB in the end (delta: -28.9 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:18,216 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.53 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 297.22 ms. Allocated memory is still 137.9 MB. Free memory was 102.0 MB in the beginning and 90.5 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 177.15 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 90.3 MB in the beginning and 179.2 MB in the end (delta: -88.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 576.22 ms. Allocated memory is still 201.9 MB. Free memory was 179.2 MB in the beginning and 146.9 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2458.03 ms. Allocated memory was 201.9 MB in the beginning and 248.5 MB in the end (delta: 46.7 MB). Free memory was 146.2 MB in the beginning and 175.1 MB in the end (delta: -28.9 MB). Peak memory consumption was 17.8 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)=5, 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); [L29] sum[0] = 0 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, N=1, sum={2:0}] [L30] COND TRUE i