/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/indp4f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:25,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:25,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:25,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:25,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:25,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:25,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:25,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:25,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:25,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:25,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:25,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:25,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:25,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:25,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:25,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:25,525 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:25,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:25,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:25,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:25,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:25,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:25,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:25,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:25,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:25,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:25,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:25,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:25,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:25,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:25,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:25,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:25,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:25,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:25,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:25,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:25,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:25,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:25,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:25,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:25,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:25,545 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:25,559 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:25,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:25,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:25,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:25,561 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:25,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:25,562 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:25,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:25,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:25,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:25,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:25,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:25,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:25,563 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:25,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:25,563 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:25,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:25,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:25,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:25,564 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:25,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:25,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:25,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:25,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:25,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:25,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:25,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:25,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:25,566 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:25,566 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:25,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:25,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:25,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:25,845 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:25,845 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:25,846 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/indp4f.c [2020-07-10 15:26:25,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a561ea529/385b8265ee0e4d58a73ae6f17803ba58/FLAG85ceb51ed [2020-07-10 15:26:26,328 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:26,329 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp4f.c [2020-07-10 15:26:26,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a561ea529/385b8265ee0e4d58a73ae6f17803ba58/FLAG85ceb51ed [2020-07-10 15:26:26,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a561ea529/385b8265ee0e4d58a73ae6f17803ba58 [2020-07-10 15:26:26,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:26,718 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:26,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:26,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:26,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:26,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:26" (1/1) ... [2020-07-10 15:26:26,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa76d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:26, skipping insertion in model container [2020-07-10 15:26:26,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:26" (1/1) ... [2020-07-10 15:26:26,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:26,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:26,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:26,972 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:26,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:27,010 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:27,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:27 WrapperNode [2020-07-10 15:26:27,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:27,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:27,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:27,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:27,027 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:27" (1/1) ... [2020-07-10 15:26:27,028 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:27" (1/1) ... [2020-07-10 15:26:27,115 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:27" (1/1) ... [2020-07-10 15:26:27,116 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:27" (1/1) ... [2020-07-10 15:26:27,125 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:27" (1/1) ... [2020-07-10 15:26:27,132 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:27" (1/1) ... [2020-07-10 15:26:27,134 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:27" (1/1) ... [2020-07-10 15:26:27,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:27,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:27,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:27,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:27,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:27" (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:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:27,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:27,782 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:27,783 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 15:26:27,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:27 BoogieIcfgContainer [2020-07-10 15:26:27,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:27,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:27,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:27,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:27,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:26" (1/3) ... [2020-07-10 15:26:27,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eed12ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:27, skipping insertion in model container [2020-07-10 15:26:27,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:27" (2/3) ... [2020-07-10 15:26:27,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eed12ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:27, skipping insertion in model container [2020-07-10 15:26:27,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:27" (3/3) ... [2020-07-10 15:26:27,799 INFO L109 eAbstractionObserver]: Analyzing ICFG indp4f.c [2020-07-10 15:26:27,811 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:27,821 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:27,839 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:27,868 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:27,869 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:27,869 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:27,869 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:27,869 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:27,869 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:27,870 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:27,870 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-10 15:26:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:26:27,900 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:27,902 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] [2020-07-10 15:26:27,903 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:27,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1155719453, now seen corresponding path program 1 times [2020-07-10 15:26:27,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:27,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884280576] [2020-07-10 15:26:27,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:28,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {49#(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; {40#true} is VALID [2020-07-10 15:26:28,218 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-10 15:26:28,218 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2020-07-10 15:26:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:28,228 INFO L280 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2020-07-10 15:26:28,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2020-07-10 15:26:28,230 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-10 15:26:28,230 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID [2020-07-10 15:26:28,232 INFO L263 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(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:28,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(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; {40#true} is VALID [2020-07-10 15:26:28,233 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-10 15:26:28,233 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2020-07-10 15:26:28,234 INFO L263 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2020-07-10 15:26:28,234 INFO L280 TraceCheckUtils]: 5: Hoare triple {40#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {40#true} is VALID [2020-07-10 15:26:28,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {40#true} assume !(~N~0 <= 0); {40#true} is VALID [2020-07-10 15:26:28,235 INFO L263 TraceCheckUtils]: 7: Hoare triple {40#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {40#true} is VALID [2020-07-10 15:26:28,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2020-07-10 15:26:28,237 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2020-07-10 15:26:28,238 INFO L280 TraceCheckUtils]: 10: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-10 15:26:28,238 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID [2020-07-10 15:26:28,240 INFO L280 TraceCheckUtils]: 12: Hoare triple {41#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;~i~0 := 0; {41#false} is VALID [2020-07-10 15:26:28,240 INFO L280 TraceCheckUtils]: 13: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-10 15:26:28,241 INFO L280 TraceCheckUtils]: 14: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-10 15:26:28,241 INFO L280 TraceCheckUtils]: 15: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-10 15:26:28,242 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-10 15:26:28,242 INFO L280 TraceCheckUtils]: 17: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-10 15:26:28,242 INFO L280 TraceCheckUtils]: 18: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-10 15:26:28,243 INFO L280 TraceCheckUtils]: 19: Hoare triple {41#false} assume !!(~i~0 < ~N~0);call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {41#false} is VALID [2020-07-10 15:26:28,243 INFO L263 TraceCheckUtils]: 20: Hoare triple {41#false} call __VERIFIER_assert((if #t~mem8 == ~i~0 * ~i~0 then 1 else 0)); {41#false} is VALID [2020-07-10 15:26:28,244 INFO L280 TraceCheckUtils]: 21: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2020-07-10 15:26:28,244 INFO L280 TraceCheckUtils]: 22: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2020-07-10 15:26:28,245 INFO L280 TraceCheckUtils]: 23: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-10 15:26:28,248 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:28,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884280576] [2020-07-10 15:26:28,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:28,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:28,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520335744] [2020-07-10 15:26:28,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:26:28,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:28,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:28,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:28,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:28,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:28,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:28,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:28,354 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-07-10 15:26:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:28,594 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2020-07-10 15:26:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:28,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-10 15:26:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-10 15:26:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-10 15:26:28,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2020-07-10 15:26:28,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:28,798 INFO L225 Difference]: With dead ends: 64 [2020-07-10 15:26:28,798 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 15:26:28,803 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:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 15:26:28,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-10 15:26:28,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:28,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2020-07-10 15:26:28,866 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 15:26:28,866 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 15:26:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:28,871 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-10 15:26:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:26:28,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:28,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:28,873 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2020-07-10 15:26:28,873 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2020-07-10 15:26:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:28,878 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-10 15:26:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:26:28,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:28,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:28,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:28,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:26:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-10 15:26:28,884 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 24 [2020-07-10 15:26:28,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:28,885 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-10 15:26:28,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:26:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-10 15:26:28,887 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:28,887 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] [2020-07-10 15:26:28,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:28,888 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:28,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:28,888 INFO L82 PathProgramCache]: Analyzing trace with hash -124144225, now seen corresponding path program 1 times [2020-07-10 15:26:28,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:28,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165146843] [2020-07-10 15:26:28,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:28,913 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:28,913 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679282532] [2020-07-10 15:26:28,914 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:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:28,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:26:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:29,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:29,126 INFO L263 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {242#true} is VALID [2020-07-10 15:26:29,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {242#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {242#true} is VALID [2020-07-10 15:26:29,127 INFO L280 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2020-07-10 15:26:29,127 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #95#return; {242#true} is VALID [2020-07-10 15:26:29,128 INFO L263 TraceCheckUtils]: 4: Hoare triple {242#true} call #t~ret9 := main(); {242#true} is VALID [2020-07-10 15:26:29,128 INFO L280 TraceCheckUtils]: 5: Hoare triple {242#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {242#true} is VALID [2020-07-10 15:26:29,129 INFO L280 TraceCheckUtils]: 6: Hoare triple {242#true} assume !(~N~0 <= 0); {265#(< 0 ~N~0)} is VALID [2020-07-10 15:26:29,130 INFO L263 TraceCheckUtils]: 7: Hoare triple {265#(< 0 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {265#(< 0 ~N~0)} is VALID [2020-07-10 15:26:29,131 INFO L280 TraceCheckUtils]: 8: Hoare triple {265#(< 0 ~N~0)} ~cond := #in~cond; {265#(< 0 ~N~0)} is VALID [2020-07-10 15:26:29,132 INFO L280 TraceCheckUtils]: 9: Hoare triple {265#(< 0 ~N~0)} assume !(0 == ~cond); {265#(< 0 ~N~0)} is VALID [2020-07-10 15:26:29,133 INFO L280 TraceCheckUtils]: 10: Hoare triple {265#(< 0 ~N~0)} assume true; {265#(< 0 ~N~0)} is VALID [2020-07-10 15:26:29,133 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {265#(< 0 ~N~0)} {265#(< 0 ~N~0)} #91#return; {265#(< 0 ~N~0)} is VALID [2020-07-10 15:26:29,135 INFO L280 TraceCheckUtils]: 12: Hoare triple {265#(< 0 ~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;~i~0 := 0; {284#(and (<= main_~i~0 0) (< 0 ~N~0))} is VALID [2020-07-10 15:26:29,136 INFO L280 TraceCheckUtils]: 13: Hoare triple {284#(and (<= main_~i~0 0) (< 0 ~N~0))} assume !(~i~0 < ~N~0); {243#false} is VALID [2020-07-10 15:26:29,136 INFO L280 TraceCheckUtils]: 14: Hoare triple {243#false} ~i~0 := 0; {243#false} is VALID [2020-07-10 15:26:29,137 INFO L280 TraceCheckUtils]: 15: Hoare triple {243#false} assume !(~i~0 < ~N~0); {243#false} is VALID [2020-07-10 15:26:29,137 INFO L280 TraceCheckUtils]: 16: Hoare triple {243#false} ~i~0 := 0; {243#false} is VALID [2020-07-10 15:26:29,137 INFO L280 TraceCheckUtils]: 17: Hoare triple {243#false} assume !(~i~0 < ~N~0); {243#false} is VALID [2020-07-10 15:26:29,137 INFO L280 TraceCheckUtils]: 18: Hoare triple {243#false} ~i~0 := 0; {243#false} is VALID [2020-07-10 15:26:29,138 INFO L280 TraceCheckUtils]: 19: Hoare triple {243#false} assume !!(~i~0 < ~N~0);call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {243#false} is VALID [2020-07-10 15:26:29,138 INFO L263 TraceCheckUtils]: 20: Hoare triple {243#false} call __VERIFIER_assert((if #t~mem8 == ~i~0 * ~i~0 then 1 else 0)); {243#false} is VALID [2020-07-10 15:26:29,138 INFO L280 TraceCheckUtils]: 21: Hoare triple {243#false} ~cond := #in~cond; {243#false} is VALID [2020-07-10 15:26:29,139 INFO L280 TraceCheckUtils]: 22: Hoare triple {243#false} assume 0 == ~cond; {243#false} is VALID [2020-07-10 15:26:29,139 INFO L280 TraceCheckUtils]: 23: Hoare triple {243#false} assume !false; {243#false} is VALID [2020-07-10 15:26:29,140 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:29,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165146843] [2020-07-10 15:26:29,141 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:29,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679282532] [2020-07-10 15:26:29,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:29,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:26:29,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577273432] [2020-07-10 15:26:29,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-10 15:26:29,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:29,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:26:29,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:29,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:26:29,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:29,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:26:29,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:26:29,177 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 4 states. [2020-07-10 15:26:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:29,372 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2020-07-10 15:26:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:26:29,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-10 15:26:29,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2020-07-10 15:26:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2020-07-10 15:26:29,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 68 transitions. [2020-07-10 15:26:29,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:29,476 INFO L225 Difference]: With dead ends: 59 [2020-07-10 15:26:29,476 INFO L226 Difference]: Without dead ends: 42 [2020-07-10 15:26:29,478 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:26:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-10 15:26:29,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-07-10 15:26:29,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:29,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 35 states. [2020-07-10 15:26:29,512 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 35 states. [2020-07-10 15:26:29,513 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 35 states. [2020-07-10 15:26:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:29,518 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-10 15:26:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-10 15:26:29,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:29,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:29,519 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 42 states. [2020-07-10 15:26:29,519 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 42 states. [2020-07-10 15:26:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:29,524 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-10 15:26:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-10 15:26:29,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:29,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:29,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:29,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:26:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-07-10 15:26:29,528 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2020-07-10 15:26:29,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:29,529 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-07-10 15:26:29,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:26:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-10 15:26:29,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:26:29,530 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:29,530 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:26:29,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:26:29,747 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:29,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash -191015719, now seen corresponding path program 1 times [2020-07-10 15:26:29,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:29,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227896110] [2020-07-10 15:26:29,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:29,767 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:29,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867355304] [2020-07-10 15:26:29,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:29,880 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:29,881 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:30,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:30,179 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:30,180 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:30,180 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:30,180 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:30,182 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:30,182 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:30,183 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:30,183 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:30,183 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:30,183 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:30,183 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:30,186 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:30,187 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:30,187 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:30,187 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:30,187 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:30,187 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:30,187 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:30,188 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:30,188 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:30,188 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:30,188 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:30,188 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:30,188 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:30,189 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:30,189 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:30,189 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:30,189 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:30,191 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-10 15:26:30,192 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-10 15:26:30,192 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-10 15:26:30,192 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-10 15:26:30,192 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-10 15:26:30,192 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-10 15:26:30,192 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-10 15:26:30,192 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-10 15:26:30,193 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-10 15:26:30,193 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-10 15:26:30,193 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-10 15:26:30,193 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-10 15:26:30,193 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-10 15:26:30,193 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-10 15:26:30,194 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-10 15:26:30,194 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2020-07-10 15:26:30,194 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 15:26:30,194 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 15:26:30,199 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:30,200 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:30,200 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:30,200 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-10 15:26:30,200 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 15:26:30,200 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:30,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:30 BoogieIcfgContainer [2020-07-10 15:26:30,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:30,211 INFO L168 Benchmark]: Toolchain (without parser) took 3492.15 ms. Allocated memory was 138.9 MB in the beginning and 236.5 MB in the end (delta: 97.5 MB). Free memory was 103.6 MB in the beginning and 98.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:30,212 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:26:30,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.58 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 92.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:30,214 INFO L168 Benchmark]: Boogie Preprocessor took 124.93 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.6 MB in the beginning and 180.8 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:30,217 INFO L168 Benchmark]: RCFGBuilder took 650.72 ms. Allocated memory is still 202.9 MB. Free memory was 180.8 MB in the beginning and 156.0 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:30,218 INFO L168 Benchmark]: TraceAbstraction took 2417.00 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 155.0 MB in the beginning and 98.4 MB in the end (delta: 56.6 MB). Peak memory consumption was 90.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:30,230 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.24 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.58 ms. Allocated memory is still 138.9 MB. Free memory was 103.6 MB in the beginning and 92.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.93 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.6 MB in the beginning and 180.8 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 650.72 ms. Allocated memory is still 202.9 MB. Free memory was 180.8 MB in the beginning and 156.0 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2417.00 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 155.0 MB in the beginning and 98.4 MB in the end (delta: 56.6 MB). Peak memory consumption was 90.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=2, 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); [L28] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, N=1] [L28] COND TRUE i