/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/ss1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:27:12,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:27:12,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:27:12,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:27:12,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:27:12,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:27:12,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:27:12,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:27:12,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:27:12,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:27:12,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:27:12,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:27:12,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:27:12,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:27:12,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:27:12,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:27:12,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:27:12,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:27:12,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:27:12,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:27:12,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:27:12,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:27:12,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:27:12,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:27:12,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:27:12,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:27:12,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:27:12,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:27:12,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:27:12,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:27:12,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:27:12,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:27:12,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:27:12,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:27:12,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:27:12,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:27:12,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:27:12,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:27:12,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:27:12,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:27:12,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:27:12,364 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:27:12,382 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:27:12,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:27:12,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:27:12,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:27:12,384 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:27:12,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:27:12,384 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:27:12,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:27:12,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:27:12,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:27:12,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:27:12,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:27:12,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:27:12,387 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:27:12,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:27:12,388 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:27:12,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:27:12,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:27:12,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:27:12,389 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:27:12,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:27:12,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:12,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:27:12,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:27:12,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:27:12,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:27:12,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:27:12,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:27:12,391 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:27:12,391 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:27:12,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:27:12,717 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:27:12,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:27:12,723 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:27:12,723 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:27:12,724 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ss1f.c [2020-07-10 15:27:12,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63acdbab6/ad92ce3a093a415da1800dcece39e223/FLAG71bd02fd6 [2020-07-10 15:27:13,359 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:27:13,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss1f.c [2020-07-10 15:27:13,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63acdbab6/ad92ce3a093a415da1800dcece39e223/FLAG71bd02fd6 [2020-07-10 15:27:13,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63acdbab6/ad92ce3a093a415da1800dcece39e223 [2020-07-10 15:27:13,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:27:13,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:27:13,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:13,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:27:13,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:27:13,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:13" (1/1) ... [2020-07-10 15:27:13,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48111a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:13, skipping insertion in model container [2020-07-10 15:27:13,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:27:13" (1/1) ... [2020-07-10 15:27:13,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:27:13,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:27:13,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:13,921 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:27:13,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:27:13,965 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:27:13,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:13 WrapperNode [2020-07-10 15:27:13,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:27:13,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:27:13,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:27:13,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:27:14,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:13" (1/1) ... [2020-07-10 15:27:14,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:13" (1/1) ... [2020-07-10 15:27:14,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:13" (1/1) ... [2020-07-10 15:27:14,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:13" (1/1) ... [2020-07-10 15:27:14,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:13" (1/1) ... [2020-07-10 15:27:14,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:13" (1/1) ... [2020-07-10 15:27:14,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:13" (1/1) ... [2020-07-10 15:27:14,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:27:14,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:27:14,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:27:14,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:27:14,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:27:14,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:27:14,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:27:14,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:27:14,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:27:14,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:27:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:27:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:27:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:27:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:27:14,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:27:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:27:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:27:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:27:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:27:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:27:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:27:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:27:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:27:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:27:14,671 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:27:14,671 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-10 15:27:14,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:14 BoogieIcfgContainer [2020-07-10 15:27:14,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:27:14,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:27:14,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:27:14,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:27:14,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:27:13" (1/3) ... [2020-07-10 15:27:14,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79de3fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:14, skipping insertion in model container [2020-07-10 15:27:14,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:27:13" (2/3) ... [2020-07-10 15:27:14,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79de3fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:27:14, skipping insertion in model container [2020-07-10 15:27:14,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:27:14" (3/3) ... [2020-07-10 15:27:14,685 INFO L109 eAbstractionObserver]: Analyzing ICFG ss1f.c [2020-07-10 15:27:14,695 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:27:14,702 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:27:14,716 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:27:14,741 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:27:14,741 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:27:14,742 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:27:14,742 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:27:14,742 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:27:14,743 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:27:14,743 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:27:14,743 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:27:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-07-10 15:27:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:27:14,774 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:14,776 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] [2020-07-10 15:27:14,776 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:14,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1562148239, now seen corresponding path program 1 times [2020-07-10 15:27:14,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:14,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052291371] [2020-07-10 15:27:14,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:15,030 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:27:15,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-10 15:27:15,032 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2020-07-10 15:27:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:15,057 INFO L280 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2020-07-10 15:27:15,059 INFO L280 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2020-07-10 15:27:15,060 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-10 15:27:15,060 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID [2020-07-10 15:27:15,063 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:27:15,064 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:27:15,065 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2020-07-10 15:27:15,065 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #95#return; {40#true} is VALID [2020-07-10 15:27:15,066 INFO L263 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret13 := main(); {40#true} is VALID [2020-07-10 15:27:15,066 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:27:15,068 INFO L280 TraceCheckUtils]: 6: Hoare triple {40#true} assume !(~N~0 <= 0); {40#true} is VALID [2020-07-10 15:27:15,068 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:27:15,069 INFO L280 TraceCheckUtils]: 8: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2020-07-10 15:27:15,070 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2020-07-10 15:27:15,071 INFO L280 TraceCheckUtils]: 10: Hoare triple {41#false} assume true; {41#false} is VALID [2020-07-10 15:27:15,071 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {41#false} {40#true} #91#return; {41#false} is VALID [2020-07-10 15:27:15,072 INFO L280 TraceCheckUtils]: 12: Hoare triple {41#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {41#false} is VALID [2020-07-10 15:27:15,072 INFO L280 TraceCheckUtils]: 13: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-10 15:27:15,074 INFO L280 TraceCheckUtils]: 14: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-10 15:27:15,075 INFO L280 TraceCheckUtils]: 15: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-10 15:27:15,077 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-10 15:27:15,077 INFO L280 TraceCheckUtils]: 17: Hoare triple {41#false} assume !(~i~0 < ~N~0); {41#false} is VALID [2020-07-10 15:27:15,077 INFO L280 TraceCheckUtils]: 18: Hoare triple {41#false} ~i~0 := 0; {41#false} is VALID [2020-07-10 15:27:15,078 INFO L280 TraceCheckUtils]: 19: Hoare triple {41#false} assume !true; {41#false} is VALID [2020-07-10 15:27:15,079 INFO L280 TraceCheckUtils]: 20: Hoare triple {41#false} call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {41#false} is VALID [2020-07-10 15:27:15,080 INFO L263 TraceCheckUtils]: 21: Hoare triple {41#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 * (2 + ~N~0) then 1 else 0)); {41#false} is VALID [2020-07-10 15:27:15,080 INFO L280 TraceCheckUtils]: 22: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2020-07-10 15:27:15,080 INFO L280 TraceCheckUtils]: 23: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2020-07-10 15:27:15,081 INFO L280 TraceCheckUtils]: 24: Hoare triple {41#false} assume !false; {41#false} is VALID [2020-07-10 15:27:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:15,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052291371] [2020-07-10 15:27:15,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:15,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:27:15,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315954671] [2020-07-10 15:27:15,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:27:15,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:15,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:27:15,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:15,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:27:15,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:15,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:27:15,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:15,236 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2020-07-10 15:27:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:15,496 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2020-07-10 15:27:15,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:27:15,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:27:15,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:15,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-10 15:27:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:27:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2020-07-10 15:27:15,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2020-07-10 15:27:15,668 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:27:15,682 INFO L225 Difference]: With dead ends: 64 [2020-07-10 15:27:15,682 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:27:15,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:27:15,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:27:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-10 15:27:15,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:15,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-10 15:27:15,750 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 15:27:15,750 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 15:27:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:15,755 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:27:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:27:15,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:15,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:15,757 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 15:27:15,757 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 15:27:15,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:15,762 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:27:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:27:15,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:15,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:15,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:15,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:27:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-10 15:27:15,768 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2020-07-10 15:27:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:15,769 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-10 15:27:15,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:27:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:27:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:27:15,771 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:15,771 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] [2020-07-10 15:27:15,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:27:15,772 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash 369304979, now seen corresponding path program 1 times [2020-07-10 15:27:15,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:15,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378448951] [2020-07-10 15:27:15,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:15,800 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:15,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1423711297] [2020-07-10 15:27:15,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:15,871 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:27:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:15,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:16,000 INFO L263 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2020-07-10 15:27:16,001 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {236#true} is VALID [2020-07-10 15:27:16,001 INFO L280 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2020-07-10 15:27:16,002 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #95#return; {236#true} is VALID [2020-07-10 15:27:16,002 INFO L263 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret13 := main(); {236#true} is VALID [2020-07-10 15:27:16,002 INFO L280 TraceCheckUtils]: 5: Hoare triple {236#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {236#true} is VALID [2020-07-10 15:27:16,003 INFO L280 TraceCheckUtils]: 6: Hoare triple {236#true} assume !(~N~0 <= 0); {259#(< 0 ~N~0)} is VALID [2020-07-10 15:27:16,005 INFO L263 TraceCheckUtils]: 7: Hoare triple {259#(< 0 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {259#(< 0 ~N~0)} is VALID [2020-07-10 15:27:16,005 INFO L280 TraceCheckUtils]: 8: Hoare triple {259#(< 0 ~N~0)} ~cond := #in~cond; {259#(< 0 ~N~0)} is VALID [2020-07-10 15:27:16,006 INFO L280 TraceCheckUtils]: 9: Hoare triple {259#(< 0 ~N~0)} assume !(0 == ~cond); {259#(< 0 ~N~0)} is VALID [2020-07-10 15:27:16,007 INFO L280 TraceCheckUtils]: 10: Hoare triple {259#(< 0 ~N~0)} assume true; {259#(< 0 ~N~0)} is VALID [2020-07-10 15:27:16,011 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {259#(< 0 ~N~0)} {259#(< 0 ~N~0)} #91#return; {259#(< 0 ~N~0)} is VALID [2020-07-10 15:27:16,013 INFO L280 TraceCheckUtils]: 12: Hoare triple {259#(< 0 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {278#(and (<= main_~i~0 0) (< 0 ~N~0))} is VALID [2020-07-10 15:27:16,014 INFO L280 TraceCheckUtils]: 13: Hoare triple {278#(and (<= main_~i~0 0) (< 0 ~N~0))} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-10 15:27:16,015 INFO L280 TraceCheckUtils]: 14: Hoare triple {237#false} ~i~0 := 0; {237#false} is VALID [2020-07-10 15:27:16,015 INFO L280 TraceCheckUtils]: 15: Hoare triple {237#false} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-10 15:27:16,015 INFO L280 TraceCheckUtils]: 16: Hoare triple {237#false} ~i~0 := 0; {237#false} is VALID [2020-07-10 15:27:16,016 INFO L280 TraceCheckUtils]: 17: Hoare triple {237#false} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-10 15:27:16,016 INFO L280 TraceCheckUtils]: 18: Hoare triple {237#false} ~i~0 := 0; {237#false} is VALID [2020-07-10 15:27:16,016 INFO L280 TraceCheckUtils]: 19: Hoare triple {237#false} assume !(~i~0 < ~N~0); {237#false} is VALID [2020-07-10 15:27:16,017 INFO L280 TraceCheckUtils]: 20: Hoare triple {237#false} call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {237#false} is VALID [2020-07-10 15:27:16,017 INFO L263 TraceCheckUtils]: 21: Hoare triple {237#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 * (2 + ~N~0) then 1 else 0)); {237#false} is VALID [2020-07-10 15:27:16,017 INFO L280 TraceCheckUtils]: 22: Hoare triple {237#false} ~cond := #in~cond; {237#false} is VALID [2020-07-10 15:27:16,018 INFO L280 TraceCheckUtils]: 23: Hoare triple {237#false} assume 0 == ~cond; {237#false} is VALID [2020-07-10 15:27:16,018 INFO L280 TraceCheckUtils]: 24: Hoare triple {237#false} assume !false; {237#false} is VALID [2020-07-10 15:27:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:27:16,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378448951] [2020-07-10 15:27:16,020 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:16,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423711297] [2020-07-10 15:27:16,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:27:16,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:27:16,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863991298] [2020-07-10 15:27:16,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-10 15:27:16,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:16,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:27:16,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:16,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:27:16,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:16,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:27:16,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:27:16,061 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 4 states. [2020-07-10 15:27:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:16,265 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2020-07-10 15:27:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:27:16,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-10 15:27:16,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2020-07-10 15:27:16,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:27:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2020-07-10 15:27:16,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2020-07-10 15:27:16,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:27:16,381 INFO L225 Difference]: With dead ends: 53 [2020-07-10 15:27:16,382 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 15:27:16,384 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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:27:16,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 15:27:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2020-07-10 15:27:16,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:16,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 34 states. [2020-07-10 15:27:16,435 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 34 states. [2020-07-10 15:27:16,436 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 34 states. [2020-07-10 15:27:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:16,441 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-10 15:27:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-07-10 15:27:16,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:16,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:16,446 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 38 states. [2020-07-10 15:27:16,446 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 38 states. [2020-07-10 15:27:16,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:16,453 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2020-07-10 15:27:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-07-10 15:27:16,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:16,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:16,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:16,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:16,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:27:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2020-07-10 15:27:16,459 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2020-07-10 15:27:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:16,460 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-07-10 15:27:16,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:27:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-07-10 15:27:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 15:27:16,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:16,464 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] [2020-07-10 15:27:16,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:27:16,681 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1815337701, now seen corresponding path program 1 times [2020-07-10 15:27:16,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:16,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765225682] [2020-07-10 15:27:16,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:16,726 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:16,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207406196] [2020-07-10 15:27:16,727 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:27:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:16,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:16,850 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:17,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:17,160 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:27:17,163 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:17,163 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:17,163 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:27:17,163 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:17,164 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:17,164 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:17,164 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:17,166 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:17,167 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:17,167 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:17,167 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:17,167 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:17,167 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:17,168 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:17,168 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:17,168 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:17,168 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:27:17,168 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:17,169 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:17,169 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:17,169 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:17,169 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:17,176 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:17,177 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:27:17,177 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:17,177 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:27:17,177 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:17,177 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:17,177 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:17,178 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:17,178 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-10 15:27:17,178 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:27:17,178 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:27:17,179 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2020-07-10 15:27:17,179 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2020-07-10 15:27:17,179 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2020-07-10 15:27:17,179 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2020-07-10 15:27:17,179 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2020-07-10 15:27:17,179 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-10 15:27:17,180 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-10 15:27:17,180 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-10 15:27:17,180 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2020-07-10 15:27:17,180 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2020-07-10 15:27:17,180 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:27:17,181 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:27:17,181 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-10 15:27:17,181 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-10 15:27:17,181 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-10 15:27:17,181 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:27:17,182 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:27:17,182 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:27:17,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:17 BoogieIcfgContainer [2020-07-10 15:27:17,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:17,192 INFO L168 Benchmark]: Toolchain (without parser) took 3528.99 ms. Allocated memory was 144.2 MB in the beginning and 232.8 MB in the end (delta: 88.6 MB). Free memory was 100.9 MB in the beginning and 94.8 MB in the end (delta: 6.1 MB). Peak memory consumption was 94.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:17,194 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:17,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.62 ms. Allocated memory is still 144.2 MB. Free memory was 100.7 MB in the beginning and 89.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:17,198 INFO L168 Benchmark]: Boogie Preprocessor took 149.80 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 89.4 MB in the beginning and 179.3 MB in the end (delta: -89.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:17,200 INFO L168 Benchmark]: RCFGBuilder took 559.08 ms. Allocated memory is still 201.9 MB. Free memory was 179.3 MB in the beginning and 152.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:17,206 INFO L168 Benchmark]: TraceAbstraction took 2509.80 ms. Allocated memory was 201.9 MB in the beginning and 232.8 MB in the end (delta: 30.9 MB). Free memory was 151.8 MB in the beginning and 94.8 MB in the end (delta: 57.0 MB). Peak memory consumption was 87.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:17,218 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.23 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 303.62 ms. Allocated memory is still 144.2 MB. Free memory was 100.7 MB in the beginning and 89.4 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.80 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 89.4 MB in the beginning and 179.3 MB in the end (delta: -89.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 559.08 ms. Allocated memory is still 201.9 MB. Free memory was 179.3 MB in the beginning and 152.5 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2509.80 ms. Allocated memory was 201.9 MB in the beginning and 232.8 MB in the end (delta: 30.9 MB). Free memory was 151.8 MB in the beginning and 94.8 MB in the end (delta: 57.0 MB). Peak memory consumption was 87.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=5, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long sum[1]; [L27] long long *a = malloc(sizeof(long long)*N); [L29] sum[0] = 0 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, N=1, sum={2:0}] [L30] COND TRUE i