/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/res2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:44:56,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:44:56,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:44:57,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:44:57,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:44:57,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:44:57,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:44:57,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:44:57,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:44:57,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:44:57,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:44:57,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:44:57,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:44:57,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:44:57,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:44:57,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:44:57,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:44:57,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:44:57,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:44:57,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:44:57,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:44:57,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:44:57,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:44:57,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:44:57,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:44:57,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:44:57,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:44:57,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:44:57,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:44:57,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:44:57,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:44:57,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:44:57,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:44:57,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:44:57,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:44:57,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:44:57,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:44:57,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:44:57,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:44:57,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:44:57,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:44:57,064 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-08 12:44:57,078 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:44:57,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:44:57,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:44:57,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:44:57,080 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:44:57,081 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:44:57,081 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:44:57,081 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:44:57,081 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:44:57,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:44:57,082 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:44:57,082 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:44:57,082 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:44:57,082 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:44:57,082 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:44:57,083 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:44:57,083 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:44:57,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:44:57,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:44:57,083 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:44:57,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:44:57,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:44:57,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:44:57,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:44:57,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:44:57,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:44:57,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:44:57,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:44:57,085 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:44:57,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:44:57,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:44:57,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:44:57,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:44:57,398 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:44:57,398 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:44:57,398 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/res2f.c [2020-07-08 12:44:57,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb296df42/d4a980bf77394ec4a46a49aa96a2bb7a/FLAG4be70ab16 [2020-07-08 12:44:57,953 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:44:57,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/res2f.c [2020-07-08 12:44:57,961 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb296df42/d4a980bf77394ec4a46a49aa96a2bb7a/FLAG4be70ab16 [2020-07-08 12:44:58,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb296df42/d4a980bf77394ec4a46a49aa96a2bb7a [2020-07-08 12:44:58,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:44:58,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:44:58,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:58,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:44:58,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:44:58,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:58" (1/1) ... [2020-07-08 12:44:58,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b1cf6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:58, skipping insertion in model container [2020-07-08 12:44:58,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:58" (1/1) ... [2020-07-08 12:44:58,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:44:58,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:44:58,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:58,623 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:44:58,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:58,771 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:44:58,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:58 WrapperNode [2020-07-08 12:44:58,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:58,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:44:58,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:44:58,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:44:58,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:58" (1/1) ... [2020-07-08 12:44:58,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:58" (1/1) ... [2020-07-08 12:44:58,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:58" (1/1) ... [2020-07-08 12:44:58,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:58" (1/1) ... [2020-07-08 12:44:58,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:58" (1/1) ... [2020-07-08 12:44:58,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:58" (1/1) ... [2020-07-08 12:44:58,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:58" (1/1) ... [2020-07-08 12:44:58,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:44:58,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:44:58,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:44:58,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:44:58,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:58" (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-08 12:44:58,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:44:58,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:44:58,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:44:58,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:44:58,908 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:44:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:44:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:44:58,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:44:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:44:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:44:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:44:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:44:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:44:58,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:44:58,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:44:58,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:44:58,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:44:58,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:44:58,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:44:59,445 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:44:59,446 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-08 12:44:59,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:59 BoogieIcfgContainer [2020-07-08 12:44:59,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:44:59,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:44:59,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:44:59,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:44:59,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:44:58" (1/3) ... [2020-07-08 12:44:59,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1052f650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:59, skipping insertion in model container [2020-07-08 12:44:59,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:58" (2/3) ... [2020-07-08 12:44:59,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1052f650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:59, skipping insertion in model container [2020-07-08 12:44:59,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:59" (3/3) ... [2020-07-08 12:44:59,465 INFO L109 eAbstractionObserver]: Analyzing ICFG res2f.c [2020-07-08 12:44:59,477 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:44:59,487 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:44:59,503 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:44:59,535 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:44:59,535 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:44:59,535 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:44:59,535 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:44:59,536 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:44:59,536 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:44:59,536 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:44:59,537 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:44:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-07-08 12:44:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:44:59,569 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:59,571 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] [2020-07-08 12:44:59,571 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:59,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1797528887, now seen corresponding path program 1 times [2020-07-08 12:44:59,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:59,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233024484] [2020-07-08 12:44:59,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:59,821 INFO L280 TraceCheckUtils]: 0: Hoare triple {55#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {46#true} is VALID [2020-07-08 12:44:59,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-08 12:44:59,822 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} #123#return; {46#true} is VALID [2020-07-08 12:44:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:59,848 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} ~cond := #in~cond; {46#true} is VALID [2020-07-08 12:44:59,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume 0 == ~cond;assume false; {47#false} is VALID [2020-07-08 12:44:59,849 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#false} assume true; {47#false} is VALID [2020-07-08 12:44:59,850 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {47#false} {46#true} #119#return; {47#false} is VALID [2020-07-08 12:44:59,852 INFO L263 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {55#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:44:59,852 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {46#true} is VALID [2020-07-08 12:44:59,853 INFO L280 TraceCheckUtils]: 2: Hoare triple {46#true} assume true; {46#true} is VALID [2020-07-08 12:44:59,853 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} #123#return; {46#true} is VALID [2020-07-08 12:44:59,853 INFO L263 TraceCheckUtils]: 4: Hoare triple {46#true} call #t~ret17 := main(); {46#true} is VALID [2020-07-08 12:44:59,854 INFO L280 TraceCheckUtils]: 5: Hoare triple {46#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {46#true} is VALID [2020-07-08 12:44:59,854 INFO L280 TraceCheckUtils]: 6: Hoare triple {46#true} assume !(~N~0 <= 0); {46#true} is VALID [2020-07-08 12:44:59,855 INFO L263 TraceCheckUtils]: 7: Hoare triple {46#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {46#true} is VALID [2020-07-08 12:44:59,855 INFO L280 TraceCheckUtils]: 8: Hoare triple {46#true} ~cond := #in~cond; {46#true} is VALID [2020-07-08 12:44:59,857 INFO L280 TraceCheckUtils]: 9: Hoare triple {46#true} assume 0 == ~cond;assume false; {47#false} is VALID [2020-07-08 12:44:59,858 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#false} assume true; {47#false} is VALID [2020-07-08 12:44:59,858 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {47#false} {46#true} #119#return; {47#false} is VALID [2020-07-08 12:44:59,859 INFO L280 TraceCheckUtils]: 12: Hoare triple {47#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {47#false} is VALID [2020-07-08 12:44:59,859 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-08 12:44:59,860 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-08 12:44:59,861 INFO L280 TraceCheckUtils]: 15: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-08 12:44:59,861 INFO L280 TraceCheckUtils]: 16: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-08 12:44:59,862 INFO L280 TraceCheckUtils]: 17: Hoare triple {47#false} assume !(~i~0 < ~N~0); {47#false} is VALID [2020-07-08 12:44:59,862 INFO L280 TraceCheckUtils]: 18: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-08 12:44:59,863 INFO L280 TraceCheckUtils]: 19: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-08 12:44:59,863 INFO L280 TraceCheckUtils]: 20: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-08 12:44:59,864 INFO L280 TraceCheckUtils]: 21: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-08 12:44:59,864 INFO L280 TraceCheckUtils]: 22: Hoare triple {47#false} ~i~0 := 0; {47#false} is VALID [2020-07-08 12:44:59,864 INFO L280 TraceCheckUtils]: 23: Hoare triple {47#false} assume !true; {47#false} is VALID [2020-07-08 12:44:59,865 INFO L280 TraceCheckUtils]: 24: Hoare triple {47#false} call #t~mem16 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {47#false} is VALID [2020-07-08 12:44:59,865 INFO L263 TraceCheckUtils]: 25: Hoare triple {47#false} call __VERIFIER_assert((if #t~mem16 <= 3 * ~N~0 then 1 else 0)); {47#false} is VALID [2020-07-08 12:44:59,865 INFO L280 TraceCheckUtils]: 26: Hoare triple {47#false} ~cond := #in~cond; {47#false} is VALID [2020-07-08 12:44:59,866 INFO L280 TraceCheckUtils]: 27: Hoare triple {47#false} assume 0 == ~cond; {47#false} is VALID [2020-07-08 12:44:59,866 INFO L280 TraceCheckUtils]: 28: Hoare triple {47#false} assume !false; {47#false} is VALID [2020-07-08 12:44:59,870 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-08 12:44:59,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233024484] [2020-07-08 12:44:59,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:59,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:44:59,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492958685] [2020-07-08 12:44:59,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:44:59,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:59,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:44:59,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:59,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:44:59,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:59,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:44:59,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:44:59,956 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2020-07-08 12:45:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:00,224 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2020-07-08 12:45:00,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:45:00,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-07-08 12:45:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:00,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-08 12:45:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2020-07-08 12:45:00,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2020-07-08 12:45:00,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:00,447 INFO L225 Difference]: With dead ends: 76 [2020-07-08 12:45:00,448 INFO L226 Difference]: Without dead ends: 36 [2020-07-08 12:45:00,452 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-08 12:45:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-08 12:45:00,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-08 12:45:00,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:00,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2020-07-08 12:45:00,516 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-08 12:45:00,517 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-08 12:45:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:00,522 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-08 12:45:00,522 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-08 12:45:00,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:00,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:00,523 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2020-07-08 12:45:00,524 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2020-07-08 12:45:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:00,529 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-08 12:45:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-08 12:45:00,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:00,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:00,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:00,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:00,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 12:45:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-07-08 12:45:00,535 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2020-07-08 12:45:00,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:00,536 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-07-08 12:45:00,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:45:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-07-08 12:45:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:45:00,538 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:00,538 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] [2020-07-08 12:45:00,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:45:00,539 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash 120259143, now seen corresponding path program 1 times [2020-07-08 12:45:00,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:00,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850258558] [2020-07-08 12:45:00,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:00,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {289#(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; {278#true} is VALID [2020-07-08 12:45:00,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-08 12:45:00,673 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} #123#return; {278#true} is VALID [2020-07-08 12:45:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:00,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {278#true} ~cond := #in~cond; {278#true} is VALID [2020-07-08 12:45:00,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#true} assume !(0 == ~cond); {278#true} is VALID [2020-07-08 12:45:00,688 INFO L280 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-08 12:45:00,689 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {278#true} {283#(<= 1 ~N~0)} #119#return; {283#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:00,691 INFO L263 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:45:00,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {289#(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; {278#true} is VALID [2020-07-08 12:45:00,692 INFO L280 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-08 12:45:00,692 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #123#return; {278#true} is VALID [2020-07-08 12:45:00,693 INFO L263 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret17 := main(); {278#true} is VALID [2020-07-08 12:45:00,693 INFO L280 TraceCheckUtils]: 5: Hoare triple {278#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {278#true} is VALID [2020-07-08 12:45:00,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {278#true} assume !(~N~0 <= 0); {283#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:00,695 INFO L263 TraceCheckUtils]: 7: Hoare triple {283#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {278#true} is VALID [2020-07-08 12:45:00,696 INFO L280 TraceCheckUtils]: 8: Hoare triple {278#true} ~cond := #in~cond; {278#true} is VALID [2020-07-08 12:45:00,696 INFO L280 TraceCheckUtils]: 9: Hoare triple {278#true} assume !(0 == ~cond); {278#true} is VALID [2020-07-08 12:45:00,696 INFO L280 TraceCheckUtils]: 10: Hoare triple {278#true} assume true; {278#true} is VALID [2020-07-08 12:45:00,697 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {278#true} {283#(<= 1 ~N~0)} #119#return; {283#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:00,700 INFO L280 TraceCheckUtils]: 12: Hoare triple {283#(<= 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 #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {288#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 12:45:00,701 INFO L280 TraceCheckUtils]: 13: Hoare triple {288#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-08 12:45:00,702 INFO L280 TraceCheckUtils]: 14: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-08 12:45:00,702 INFO L280 TraceCheckUtils]: 15: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-08 12:45:00,702 INFO L280 TraceCheckUtils]: 16: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-08 12:45:00,703 INFO L280 TraceCheckUtils]: 17: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-08 12:45:00,703 INFO L280 TraceCheckUtils]: 18: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-08 12:45:00,703 INFO L280 TraceCheckUtils]: 19: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-08 12:45:00,704 INFO L280 TraceCheckUtils]: 20: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-08 12:45:00,704 INFO L280 TraceCheckUtils]: 21: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-08 12:45:00,705 INFO L280 TraceCheckUtils]: 22: Hoare triple {279#false} ~i~0 := 0; {279#false} is VALID [2020-07-08 12:45:00,705 INFO L280 TraceCheckUtils]: 23: Hoare triple {279#false} assume !(~i~0 < ~N~0); {279#false} is VALID [2020-07-08 12:45:00,705 INFO L280 TraceCheckUtils]: 24: Hoare triple {279#false} call #t~mem16 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {279#false} is VALID [2020-07-08 12:45:00,706 INFO L263 TraceCheckUtils]: 25: Hoare triple {279#false} call __VERIFIER_assert((if #t~mem16 <= 3 * ~N~0 then 1 else 0)); {279#false} is VALID [2020-07-08 12:45:00,706 INFO L280 TraceCheckUtils]: 26: Hoare triple {279#false} ~cond := #in~cond; {279#false} is VALID [2020-07-08 12:45:00,706 INFO L280 TraceCheckUtils]: 27: Hoare triple {279#false} assume 0 == ~cond; {279#false} is VALID [2020-07-08 12:45:00,706 INFO L280 TraceCheckUtils]: 28: Hoare triple {279#false} assume !false; {279#false} is VALID [2020-07-08 12:45:00,708 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-08 12:45:00,709 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850258558] [2020-07-08 12:45:00,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:00,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:45:00,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708267304] [2020-07-08 12:45:00,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-07-08 12:45:00,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:00,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:45:00,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:00,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:45:00,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:00,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:45:00,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:00,754 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 5 states. [2020-07-08 12:45:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:01,113 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2020-07-08 12:45:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:45:01,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-07-08 12:45:01,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2020-07-08 12:45:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2020-07-08 12:45:01,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2020-07-08 12:45:01,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:01,252 INFO L225 Difference]: With dead ends: 69 [2020-07-08 12:45:01,253 INFO L226 Difference]: Without dead ends: 48 [2020-07-08 12:45:01,255 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-08 12:45:01,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-08 12:45:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-07-08 12:45:01,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:01,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 42 states. [2020-07-08 12:45:01,292 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 42 states. [2020-07-08 12:45:01,300 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 42 states. [2020-07-08 12:45:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:01,303 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-08 12:45:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2020-07-08 12:45:01,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:01,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:01,305 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 48 states. [2020-07-08 12:45:01,305 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 48 states. [2020-07-08 12:45:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:01,309 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2020-07-08 12:45:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2020-07-08 12:45:01,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:01,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:01,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:01,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 12:45:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2020-07-08 12:45:01,314 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 29 [2020-07-08 12:45:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:01,316 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2020-07-08 12:45:01,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:45:01,317 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-08 12:45:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 12:45:01,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:01,321 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] [2020-07-08 12:45:01,321 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:45:01,323 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:01,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:01,324 INFO L82 PathProgramCache]: Analyzing trace with hash -774790125, now seen corresponding path program 1 times [2020-07-08 12:45:01,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:01,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112649058] [2020-07-08 12:45:01,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:01,554 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:45:01,554 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:45:01,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:45:01,645 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:45:01,645 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:01,645 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:01,646 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:45:01,646 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:45:01,646 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:45:01,646 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:45:01,646 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:01,646 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:01,647 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:45:01,647 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:45:01,647 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:45:01,647 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:45:01,647 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:45:01,647 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:45:01,647 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:45:01,648 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:45:01,648 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-08 12:45:01,648 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:45:01,648 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:45:01,648 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:45:01,648 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:45:01,649 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:45:01,649 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:45:01,649 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 12:45:01,649 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:45:01,649 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:45:01,649 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:45:01,649 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-08 12:45:01,650 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-08 12:45:01,650 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-08 12:45:01,650 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-08 12:45:01,650 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2020-07-08 12:45:01,650 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-08 12:45:01,650 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-08 12:45:01,650 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-08 12:45:01,651 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-08 12:45:01,651 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-08 12:45:01,651 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-08 12:45:01,651 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-08 12:45:01,651 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-08 12:45:01,651 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-08 12:45:01,651 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-08 12:45:01,651 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-08 12:45:01,652 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-08 12:45:01,652 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-08 12:45:01,652 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-08 12:45:01,652 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-08 12:45:01,652 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-08 12:45:01,652 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-08 12:45:01,652 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-08 12:45:01,653 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-08 12:45:01,653 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2020-07-08 12:45:01,653 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-08 12:45:01,653 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-08 12:45:01,653 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-08 12:45:01,653 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-08 12:45:01,653 WARN L170 areAnnotationChecker]: L57-4 has no Hoare annotation [2020-07-08 12:45:01,653 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-08 12:45:01,654 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 12:45:01,654 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-08 12:45:01,654 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-08 12:45:01,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:45:01 BoogieIcfgContainer [2020-07-08 12:45:01,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:45:01,660 INFO L168 Benchmark]: Toolchain (without parser) took 3289.90 ms. Allocated memory was 144.2 MB in the beginning and 248.5 MB in the end (delta: 104.3 MB). Free memory was 100.3 MB in the beginning and 202.3 MB in the end (delta: -102.1 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:01,661 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:45:01,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.53 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 181.0 MB in the end (delta: -81.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:01,663 INFO L168 Benchmark]: Boogie Preprocessor took 65.90 ms. Allocated memory is still 202.4 MB. Free memory was 181.0 MB in the beginning and 178.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:01,663 INFO L168 Benchmark]: RCFGBuilder took 614.63 ms. Allocated memory is still 202.4 MB. Free memory was 177.9 MB in the beginning and 146.8 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:01,664 INFO L168 Benchmark]: TraceAbstraction took 2202.30 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 146.1 MB in the beginning and 202.3 MB in the end (delta: -56.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:45:01,668 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 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 401.53 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 181.0 MB in the end (delta: -81.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 65.90 ms. Allocated memory is still 202.4 MB. Free memory was 181.0 MB in the beginning and 178.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 614.63 ms. Allocated memory is still 202.4 MB. Free memory was 177.9 MB in the beginning and 146.8 MB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2202.30 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 146.1 MB in the beginning and 202.3 MB in the end (delta: -56.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L28] int *b = malloc(sizeof(int)*N); [L29] int *c = malloc(sizeof(int)*N); [L31] sum[0] = 1 [L32] i=0 VAL [\old(N)=0, a={-2:0}, b={-1:0}, c={5:0}, i=0, malloc(sizeof(int)*N)={-2:0}, malloc(sizeof(int)*N)={5:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={7:0}] [L32] COND TRUE i