/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/indp5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:27,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:27,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:27,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:27,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:27,376 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:27,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:27,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:27,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:27,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:27,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:27,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:27,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:27,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:27,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:27,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:27,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:27,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:27,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:27,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:27,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:27,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:27,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:27,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:27,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:27,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:27,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:27,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:27,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:27,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:27,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:27,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:27,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:27,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:27,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:27,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:27,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:27,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:27,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:27,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:27,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:27,438 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:26:27,452 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:27,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:27,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:27,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:27,454 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:27,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:27,455 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:27,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:27,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:27,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:27,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:27,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:27,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:27,456 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:27,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:27,457 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:27,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:27,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:27,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:27,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:27,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:27,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:27,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:27,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:27,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:27,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:27,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:27,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:27,459 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:27,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:27,730 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:27,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:27,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:27,748 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:27,748 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:27,749 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/indp5f.c [2020-07-10 15:26:27,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d514338d/17611b21a13c4ca0907e67e46cad76d6/FLAG87022dff9 [2020-07-10 15:26:28,279 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:28,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp5f.c [2020-07-10 15:26:28,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d514338d/17611b21a13c4ca0907e67e46cad76d6/FLAG87022dff9 [2020-07-10 15:26:28,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d514338d/17611b21a13c4ca0907e67e46cad76d6 [2020-07-10 15:26:28,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:28,651 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:28,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:28,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:28,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:28,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:28" (1/1) ... [2020-07-10 15:26:28,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1b6256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:28, skipping insertion in model container [2020-07-10 15:26:28,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:28" (1/1) ... [2020-07-10 15:26:28,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:28,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:28,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:28,923 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:28,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:28,967 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:28,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:28 WrapperNode [2020-07-10 15:26:28,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:28,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:28,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:28,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:29,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:28" (1/1) ... [2020-07-10 15:26:29,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:28" (1/1) ... [2020-07-10 15:26:29,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:28" (1/1) ... [2020-07-10 15:26:29,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:28" (1/1) ... [2020-07-10 15:26:29,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:28" (1/1) ... [2020-07-10 15:26:29,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:28" (1/1) ... [2020-07-10 15:26:29,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:28" (1/1) ... [2020-07-10 15:26:29,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:29,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:29,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:29,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:29,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:29,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:29,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:29,163 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:29,163 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:29,164 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:29,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:29,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:29,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:29,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:29,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:29,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:29,624 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:29,625 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-10 15:26:29,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:29 BoogieIcfgContainer [2020-07-10 15:26:29,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:29,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:29,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:29,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:29,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:28" (1/3) ... [2020-07-10 15:26:29,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21156912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:29, skipping insertion in model container [2020-07-10 15:26:29,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:28" (2/3) ... [2020-07-10 15:26:29,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21156912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:29, skipping insertion in model container [2020-07-10 15:26:29,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:29" (3/3) ... [2020-07-10 15:26:29,636 INFO L109 eAbstractionObserver]: Analyzing ICFG indp5f.c [2020-07-10 15:26:29,647 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:29,654 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:29,666 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:29,685 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:29,686 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:29,686 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:29,686 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:29,686 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:29,686 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:29,686 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:29,686 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-10 15:26:29,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:26:29,707 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:29,707 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] [2020-07-10 15:26:29,708 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:29,712 INFO L82 PathProgramCache]: Analyzing trace with hash -976607933, now seen corresponding path program 1 times [2020-07-10 15:26:29,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:29,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866118930] [2020-07-10 15:26:29,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:29,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {52#(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; {43#true} is VALID [2020-07-10 15:26:29,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 15:26:29,950 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #109#return; {43#true} is VALID [2020-07-10 15:26:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:29,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-10 15:26:29,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-10 15:26:29,974 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 15:26:29,975 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #105#return; {44#false} is VALID [2020-07-10 15:26:29,982 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {52#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:29,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {52#(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; {43#true} is VALID [2020-07-10 15:26:29,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-10 15:26:29,983 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #109#return; {43#true} is VALID [2020-07-10 15:26:29,983 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret13 := main(); {43#true} is VALID [2020-07-10 15:26:29,984 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {43#true} is VALID [2020-07-10 15:26:29,984 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#true} assume !(~N~0 <= 0); {43#true} is VALID [2020-07-10 15:26:29,985 INFO L263 TraceCheckUtils]: 7: Hoare triple {43#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {43#true} is VALID [2020-07-10 15:26:29,985 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-10 15:26:29,989 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-10 15:26:29,990 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-10 15:26:29,990 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#false} {43#true} #105#return; {44#false} is VALID [2020-07-10 15:26:29,991 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#false} havoc ~i~0;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 ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {44#false} is VALID [2020-07-10 15:26:29,991 INFO L280 TraceCheckUtils]: 13: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-10 15:26:29,992 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-10 15:26:29,992 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-10 15:26:29,993 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-10 15:26:29,994 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-10 15:26:29,994 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-10 15:26:29,994 INFO L280 TraceCheckUtils]: 19: Hoare triple {44#false} assume !true; {44#false} is VALID [2020-07-10 15:26:29,995 INFO L280 TraceCheckUtils]: 20: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-10 15:26:29,995 INFO L280 TraceCheckUtils]: 21: Hoare triple {44#false} assume !true; {44#false} is VALID [2020-07-10 15:26:29,996 INFO L280 TraceCheckUtils]: 22: Hoare triple {44#false} call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {44#false} is VALID [2020-07-10 15:26:29,996 INFO L263 TraceCheckUtils]: 23: Hoare triple {44#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 then 1 else 0)); {44#false} is VALID [2020-07-10 15:26:29,996 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2020-07-10 15:26:29,997 INFO L280 TraceCheckUtils]: 25: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2020-07-10 15:26:29,998 INFO L280 TraceCheckUtils]: 26: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-10 15:26:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:30,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866118930] [2020-07-10 15:26:30,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:30,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:30,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485549734] [2020-07-10 15:26:30,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:26:30,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:30,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:30,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:30,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:30,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:30,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:30,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:30,115 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-07-10 15:26:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:30,349 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2020-07-10 15:26:30,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:30,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-07-10 15:26:30,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:30,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-10 15:26:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-10 15:26:30,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2020-07-10 15:26:30,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:30,523 INFO L225 Difference]: With dead ends: 70 [2020-07-10 15:26:30,523 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 15:26:30,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 15:26:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-10 15:26:30,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:30,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-10 15:26:30,578 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 15:26:30,578 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 15:26:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:30,583 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 15:26:30,583 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:26:30,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:30,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:30,584 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 15:26:30,584 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 15:26:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:30,588 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 15:26:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:26:30,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:30,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:30,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:30,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 15:26:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-10 15:26:30,594 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 27 [2020-07-10 15:26:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:30,595 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-10 15:26:30,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:26:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:26:30,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:30,596 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] [2020-07-10 15:26:30,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:30,597 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:30,598 INFO L82 PathProgramCache]: Analyzing trace with hash -714487667, now seen corresponding path program 1 times [2020-07-10 15:26:30,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:30,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849168705] [2020-07-10 15:26:30,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:30,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#(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; {257#true} is VALID [2020-07-10 15:26:30,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-10 15:26:30,736 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {257#true} {257#true} #109#return; {257#true} is VALID [2020-07-10 15:26:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:30,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {257#true} ~cond := #in~cond; {257#true} is VALID [2020-07-10 15:26:30,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {257#true} assume !(0 == ~cond); {257#true} is VALID [2020-07-10 15:26:30,749 INFO L280 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-10 15:26:30,750 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {257#true} {262#(<= 1 ~N~0)} #105#return; {262#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:30,751 INFO L263 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {268#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:30,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#(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; {257#true} is VALID [2020-07-10 15:26:30,752 INFO L280 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-10 15:26:30,752 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #109#return; {257#true} is VALID [2020-07-10 15:26:30,752 INFO L263 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret13 := main(); {257#true} is VALID [2020-07-10 15:26:30,752 INFO L280 TraceCheckUtils]: 5: Hoare triple {257#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {257#true} is VALID [2020-07-10 15:26:30,753 INFO L280 TraceCheckUtils]: 6: Hoare triple {257#true} assume !(~N~0 <= 0); {262#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:30,754 INFO L263 TraceCheckUtils]: 7: Hoare triple {262#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {257#true} is VALID [2020-07-10 15:26:30,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {257#true} ~cond := #in~cond; {257#true} is VALID [2020-07-10 15:26:30,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {257#true} assume !(0 == ~cond); {257#true} is VALID [2020-07-10 15:26:30,755 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-10 15:26:30,756 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {257#true} {262#(<= 1 ~N~0)} #105#return; {262#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:30,757 INFO L280 TraceCheckUtils]: 12: Hoare triple {262#(<= 1 ~N~0)} havoc ~i~0;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 ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {267#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-10 15:26:30,758 INFO L280 TraceCheckUtils]: 13: Hoare triple {267#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {258#false} is VALID [2020-07-10 15:26:30,759 INFO L280 TraceCheckUtils]: 14: Hoare triple {258#false} ~i~0 := 0; {258#false} is VALID [2020-07-10 15:26:30,759 INFO L280 TraceCheckUtils]: 15: Hoare triple {258#false} assume !(~i~0 < ~N~0); {258#false} is VALID [2020-07-10 15:26:30,759 INFO L280 TraceCheckUtils]: 16: Hoare triple {258#false} ~i~0 := 0; {258#false} is VALID [2020-07-10 15:26:30,760 INFO L280 TraceCheckUtils]: 17: Hoare triple {258#false} assume !(~i~0 < ~N~0); {258#false} is VALID [2020-07-10 15:26:30,760 INFO L280 TraceCheckUtils]: 18: Hoare triple {258#false} ~i~0 := 0; {258#false} is VALID [2020-07-10 15:26:30,760 INFO L280 TraceCheckUtils]: 19: Hoare triple {258#false} assume !(~i~0 < ~N~0); {258#false} is VALID [2020-07-10 15:26:30,760 INFO L280 TraceCheckUtils]: 20: Hoare triple {258#false} ~i~0 := 0; {258#false} is VALID [2020-07-10 15:26:30,761 INFO L280 TraceCheckUtils]: 21: Hoare triple {258#false} assume !(~i~0 < ~N~0); {258#false} is VALID [2020-07-10 15:26:30,761 INFO L280 TraceCheckUtils]: 22: Hoare triple {258#false} call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {258#false} is VALID [2020-07-10 15:26:30,761 INFO L263 TraceCheckUtils]: 23: Hoare triple {258#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 then 1 else 0)); {258#false} is VALID [2020-07-10 15:26:30,762 INFO L280 TraceCheckUtils]: 24: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2020-07-10 15:26:30,762 INFO L280 TraceCheckUtils]: 25: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2020-07-10 15:26:30,762 INFO L280 TraceCheckUtils]: 26: Hoare triple {258#false} assume !false; {258#false} is VALID [2020-07-10 15:26:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:30,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849168705] [2020-07-10 15:26:30,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:30,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:30,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403123461] [2020-07-10 15:26:30,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 15:26:30,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:30,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:30,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:30,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:30,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:30,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:30,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:30,803 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 5 states. [2020-07-10 15:26:31,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:31,114 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2020-07-10 15:26:31,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:31,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-10 15:26:31,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2020-07-10 15:26:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2020-07-10 15:26:31,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2020-07-10 15:26:31,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:31,222 INFO L225 Difference]: With dead ends: 61 [2020-07-10 15:26:31,222 INFO L226 Difference]: Without dead ends: 43 [2020-07-10 15:26:31,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:26:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-10 15:26:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2020-07-10 15:26:31,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:31,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 38 states. [2020-07-10 15:26:31,263 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 38 states. [2020-07-10 15:26:31,263 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 38 states. [2020-07-10 15:26:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:31,267 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-10 15:26:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-10 15:26:31,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:31,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:31,268 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 43 states. [2020-07-10 15:26:31,268 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 43 states. [2020-07-10 15:26:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:31,272 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-10 15:26:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-07-10 15:26:31,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:31,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:31,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:31,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-10 15:26:31,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2020-07-10 15:26:31,277 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 27 [2020-07-10 15:26:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:31,277 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2020-07-10 15:26:31,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-10 15:26:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 15:26:31,279 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:31,279 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] [2020-07-10 15:26:31,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:31,280 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:31,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:31,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1064141225, now seen corresponding path program 1 times [2020-07-10 15:26:31,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:31,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344053583] [2020-07-10 15:26:31,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:31,298 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:31,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2060880368] [2020-07-10 15:26:31,299 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:26:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:31,445 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:31,446 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:31,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:26:31,734 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:31,734 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:31,734 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:31,734 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:31,735 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:31,735 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:31,735 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:31,735 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:31,738 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:31,738 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:31,738 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:31,739 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:31,739 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:31,739 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:31,739 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:31,739 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:31,739 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:31,739 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:31,739 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:31,740 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:31,740 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:31,740 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:31,740 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:31,740 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:31,740 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:31,740 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:31,741 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:31,741 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:31,741 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:31,741 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:31,741 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:26:31,742 WARN L170 areAnnotationChecker]: L55-1 has no Hoare annotation [2020-07-10 15:26:31,742 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:26:31,742 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:26:31,742 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:31,742 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:31,743 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:26:31,743 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:26:31,743 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:26:31,743 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-10 15:26:31,743 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-10 15:26:31,743 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-10 15:26:31,743 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-10 15:26:31,743 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-10 15:26:31,744 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-10 15:26:31,744 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-10 15:26:31,744 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-10 15:26:31,744 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2020-07-10 15:26:31,744 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-10 15:26:31,744 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-10 15:26:31,745 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-10 15:26:31,745 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-10 15:26:31,745 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2020-07-10 15:26:31,745 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-10 15:26:31,745 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-10 15:26:31,745 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-10 15:26:31,745 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:26:31,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:31 BoogieIcfgContainer [2020-07-10 15:26:31,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:31,754 INFO L168 Benchmark]: Toolchain (without parser) took 3100.35 ms. Allocated memory was 139.5 MB in the beginning and 244.3 MB in the end (delta: 104.9 MB). Free memory was 104.2 MB in the beginning and 201.4 MB in the end (delta: -97.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:31,756 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:31,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.40 ms. Allocated memory is still 139.5 MB. Free memory was 104.0 MB in the beginning and 92.4 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:31,759 INFO L168 Benchmark]: Boogie Preprocessor took 135.62 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 92.4 MB in the beginning and 180.4 MB in the end (delta: -88.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:31,761 INFO L168 Benchmark]: RCFGBuilder took 523.88 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 152.2 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:31,762 INFO L168 Benchmark]: TraceAbstraction took 2119.24 ms. Allocated memory was 202.9 MB in the beginning and 244.3 MB in the end (delta: 41.4 MB). Free memory was 151.6 MB in the beginning and 201.4 MB in the end (delta: -49.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:26:31,776 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 139.5 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 316.40 ms. Allocated memory is still 139.5 MB. Free memory was 104.0 MB in the beginning and 92.4 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.62 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 92.4 MB in the beginning and 180.4 MB in the end (delta: -88.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 523.88 ms. Allocated memory is still 202.9 MB. Free memory was 180.4 MB in the beginning and 152.2 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2119.24 ms. Allocated memory was 202.9 MB in the beginning and 244.3 MB in the end (delta: 41.4 MB). Free memory was 151.6 MB in the beginning and 201.4 MB in the end (delta: -49.9 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)=6, 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 *a = malloc(sizeof(long long)*N); [L27] long long sum[1]; [L29] sum[0] = 1 [L30] i=0 VAL [\old(N)=0, a={1:0}, i=0, malloc(sizeof(long long)*N)={1:0}, N=1, sum={3:0}] [L30] COND TRUE i