/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/ifeqn5f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:26:16,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:16,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:16,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:16,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:16,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:16,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:16,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:16,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:16,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:16,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:16,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:16,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:16,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:16,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:16,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:16,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:16,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:16,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:16,993 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:16,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:16,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:16,997 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:17,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:17,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:17,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:17,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:17,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:17,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:17,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:17,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:17,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:17,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:17,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:17,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:17,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:17,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:17,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:17,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:17,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:17,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:17,017 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:17,041 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:17,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:17,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:17,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:17,045 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:17,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:17,046 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:17,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:17,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:17,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:17,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:17,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:17,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:17,048 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:17,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:17,049 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:17,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:17,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:17,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:17,049 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:17,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:17,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:17,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:17,051 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:17,051 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:17,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:17,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:17,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:17,052 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:17,052 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:17,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:17,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:17,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:17,353 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:17,353 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:17,354 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ifeqn5f.c [2020-07-10 15:26:17,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ace524f60/9a3aacf38e514b0e821c5a0bd82b654c/FLAG0a5f9b57d [2020-07-10 15:26:17,831 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:17,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ifeqn5f.c [2020-07-10 15:26:17,839 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ace524f60/9a3aacf38e514b0e821c5a0bd82b654c/FLAG0a5f9b57d [2020-07-10 15:26:18,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ace524f60/9a3aacf38e514b0e821c5a0bd82b654c [2020-07-10 15:26:18,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:18,261 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:18,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:18,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:18,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:18,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:18" (1/1) ... [2020-07-10 15:26:18,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3377739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:18, skipping insertion in model container [2020-07-10 15:26:18,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:18" (1/1) ... [2020-07-10 15:26:18,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:18,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:18,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:18,487 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:18,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:18,525 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:18,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:18 WrapperNode [2020-07-10 15:26:18,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:18,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:18,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:18,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:18,617 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:18" (1/1) ... [2020-07-10 15:26:18,618 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:18" (1/1) ... [2020-07-10 15:26:18,625 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:18" (1/1) ... [2020-07-10 15:26:18,626 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:18" (1/1) ... [2020-07-10 15:26:18,636 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:18" (1/1) ... [2020-07-10 15:26:18,642 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:18" (1/1) ... [2020-07-10 15:26:18,643 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:18" (1/1) ... [2020-07-10 15:26:18,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:18,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:18,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:18,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:18,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:18" (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:18,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:18,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:18,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:18,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:18,717 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:18,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:19,162 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:19,164 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:26:19,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:19 BoogieIcfgContainer [2020-07-10 15:26:19,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:19,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:19,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:19,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:19,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:18" (1/3) ... [2020-07-10 15:26:19,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661c7a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:19, skipping insertion in model container [2020-07-10 15:26:19,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:18" (2/3) ... [2020-07-10 15:26:19,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661c7a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:19, skipping insertion in model container [2020-07-10 15:26:19,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:19" (3/3) ... [2020-07-10 15:26:19,180 INFO L109 eAbstractionObserver]: Analyzing ICFG ifeqn5f.c [2020-07-10 15:26:19,190 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:19,199 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:19,212 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:19,232 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:19,232 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:19,232 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:19,233 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:19,233 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:19,233 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:19,233 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:19,233 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:19,249 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-10 15:26:19,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:26:19,254 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:19,255 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] [2020-07-10 15:26:19,255 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash -294712258, now seen corresponding path program 1 times [2020-07-10 15:26:19,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:19,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200678538] [2020-07-10 15:26:19,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:19,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#(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; {39#true} is VALID [2020-07-10 15:26:19,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:26:19,455 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-10 15:26:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:19,471 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-10 15:26:19,472 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-10 15:26:19,473 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:26:19,473 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-10 15:26:19,482 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(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:19,483 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#(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; {39#true} is VALID [2020-07-10 15:26:19,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:26:19,484 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-10 15:26:19,484 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret10 := main(); {39#true} is VALID [2020-07-10 15:26:19,485 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {39#true} is VALID [2020-07-10 15:26:19,485 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~N~0 <= 0); {39#true} is VALID [2020-07-10 15:26:19,486 INFO L263 TraceCheckUtils]: 7: Hoare triple {39#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {39#true} is VALID [2020-07-10 15:26:19,486 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-10 15:26:19,487 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-10 15:26:19,488 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:26:19,488 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-10 15:26:19,489 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:19,489 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-10 15:26:19,490 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:19,490 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume !true; {40#false} is VALID [2020-07-10 15:26:19,490 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:19,491 INFO L280 TraceCheckUtils]: 17: Hoare triple {40#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {40#false} is VALID [2020-07-10 15:26:19,491 INFO L263 TraceCheckUtils]: 18: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem9 == 5 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {40#false} is VALID [2020-07-10 15:26:19,492 INFO L280 TraceCheckUtils]: 19: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2020-07-10 15:26:19,492 INFO L280 TraceCheckUtils]: 20: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2020-07-10 15:26:19,493 INFO L280 TraceCheckUtils]: 21: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-10 15:26:19,496 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:19,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200678538] [2020-07-10 15:26:19,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:19,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:19,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304003377] [2020-07-10 15:26:19,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:26:19,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:19,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:19,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:19,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:19,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:19,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:19,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:19,565 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-10 15:26:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:19,759 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2020-07-10 15:26:19,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:19,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:26:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-10 15:26:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-10 15:26:19,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2020-07-10 15:26:19,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:19,921 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:26:19,921 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 15:26:19,924 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:19,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 15:26:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-10 15:26:19,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:19,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-10 15:26:19,975 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 15:26:19,975 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 15:26:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:19,980 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-10 15:26:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-10 15:26:19,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:19,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:19,981 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 15:26:19,981 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 15:26:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:19,985 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-10 15:26:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-10 15:26:19,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:19,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:19,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:19,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 15:26:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-10 15:26:19,991 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2020-07-10 15:26:19,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:19,992 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-10 15:26:19,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:19,992 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-10 15:26:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:26:19,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:19,994 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] [2020-07-10 15:26:19,994 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:19,994 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:19,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:19,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2054124171, now seen corresponding path program 1 times [2020-07-10 15:26:19,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:19,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500625187] [2020-07-10 15:26:19,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:20,018 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:20,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1979583129] [2020-07-10 15:26:20,019 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:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,076 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:26:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,093 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:20,194 INFO L263 TraceCheckUtils]: 0: Hoare triple {233#true} call ULTIMATE.init(); {233#true} is VALID [2020-07-10 15:26:20,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {233#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {233#true} is VALID [2020-07-10 15:26:20,195 INFO L280 TraceCheckUtils]: 2: Hoare triple {233#true} assume true; {233#true} is VALID [2020-07-10 15:26:20,195 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {233#true} {233#true} #91#return; {233#true} is VALID [2020-07-10 15:26:20,196 INFO L263 TraceCheckUtils]: 4: Hoare triple {233#true} call #t~ret10 := main(); {233#true} is VALID [2020-07-10 15:26:20,196 INFO L280 TraceCheckUtils]: 5: Hoare triple {233#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {233#true} is VALID [2020-07-10 15:26:20,197 INFO L280 TraceCheckUtils]: 6: Hoare triple {233#true} assume !(~N~0 <= 0); {256#(< 0 ~N~0)} is VALID [2020-07-10 15:26:20,198 INFO L263 TraceCheckUtils]: 7: Hoare triple {256#(< 0 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {256#(< 0 ~N~0)} is VALID [2020-07-10 15:26:20,199 INFO L280 TraceCheckUtils]: 8: Hoare triple {256#(< 0 ~N~0)} ~cond := #in~cond; {256#(< 0 ~N~0)} is VALID [2020-07-10 15:26:20,201 INFO L280 TraceCheckUtils]: 9: Hoare triple {256#(< 0 ~N~0)} assume !(0 == ~cond); {256#(< 0 ~N~0)} is VALID [2020-07-10 15:26:20,202 INFO L280 TraceCheckUtils]: 10: Hoare triple {256#(< 0 ~N~0)} assume true; {256#(< 0 ~N~0)} is VALID [2020-07-10 15:26:20,203 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {256#(< 0 ~N~0)} {256#(< 0 ~N~0)} #87#return; {256#(< 0 ~N~0)} is VALID [2020-07-10 15:26:20,204 INFO L280 TraceCheckUtils]: 12: Hoare triple {256#(< 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;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {275#(and (<= main_~i~0 0) (< 0 ~N~0))} is VALID [2020-07-10 15:26:20,205 INFO L280 TraceCheckUtils]: 13: Hoare triple {275#(and (<= main_~i~0 0) (< 0 ~N~0))} assume !(~i~0 < ~N~0); {234#false} is VALID [2020-07-10 15:26:20,205 INFO L280 TraceCheckUtils]: 14: Hoare triple {234#false} ~i~0 := 0; {234#false} is VALID [2020-07-10 15:26:20,206 INFO L280 TraceCheckUtils]: 15: Hoare triple {234#false} assume !(~i~0 < ~N~0); {234#false} is VALID [2020-07-10 15:26:20,206 INFO L280 TraceCheckUtils]: 16: Hoare triple {234#false} ~i~0 := 0; {234#false} is VALID [2020-07-10 15:26:20,206 INFO L280 TraceCheckUtils]: 17: Hoare triple {234#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {234#false} is VALID [2020-07-10 15:26:20,207 INFO L263 TraceCheckUtils]: 18: Hoare triple {234#false} call __VERIFIER_assert((if #t~mem9 == 5 + (5 * ~i~0 * ~i~0 + 5 * ~i~0) then 1 else 0)); {234#false} is VALID [2020-07-10 15:26:20,207 INFO L280 TraceCheckUtils]: 19: Hoare triple {234#false} ~cond := #in~cond; {234#false} is VALID [2020-07-10 15:26:20,207 INFO L280 TraceCheckUtils]: 20: Hoare triple {234#false} assume 0 == ~cond; {234#false} is VALID [2020-07-10 15:26:20,208 INFO L280 TraceCheckUtils]: 21: Hoare triple {234#false} assume !false; {234#false} is VALID [2020-07-10 15:26:20,213 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:20,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500625187] [2020-07-10 15:26:20,214 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:20,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979583129] [2020-07-10 15:26:20,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:20,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:26:20,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435945443] [2020-07-10 15:26:20,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 15:26:20,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:20,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:26:20,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:20,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:26:20,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:20,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:26:20,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:26:20,250 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2020-07-10 15:26:20,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:20,435 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2020-07-10 15:26:20,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:26:20,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 15:26:20,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-10 15:26:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-10 15:26:20,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2020-07-10 15:26:20,531 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:20,534 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:26:20,534 INFO L226 Difference]: Without dead ends: 41 [2020-07-10 15:26:20,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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:20,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-10 15:26:20,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2020-07-10 15:26:20,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:20,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 33 states. [2020-07-10 15:26:20,565 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 33 states. [2020-07-10 15:26:20,566 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 33 states. [2020-07-10 15:26:20,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:20,571 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-10 15:26:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-10 15:26:20,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:20,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:20,573 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 41 states. [2020-07-10 15:26:20,573 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 41 states. [2020-07-10 15:26:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:20,577 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-10 15:26:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-10 15:26:20,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:20,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:20,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:20,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 15:26:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-10 15:26:20,582 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2020-07-10 15:26:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:20,583 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-10 15:26:20,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:26:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:26:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:26:20,584 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:20,584 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] [2020-07-10 15:26:20,799 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:26:20,799 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:20,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:20,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1477618916, now seen corresponding path program 1 times [2020-07-10 15:26:20,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:20,800 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313479340] [2020-07-10 15:26:20,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:20,847 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:20,848 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [15208828] [2020-07-10 15:26:20,848 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:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:26:20,933 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:26:20,934 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:26:21,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:21,197 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:26:21,197 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:21,197 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:26:21,197 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:26:21,197 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:26:21,197 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:26:21,198 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:21,198 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:21,198 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:26:21,198 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:21,198 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:26:21,198 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:21,199 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:26:21,199 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:21,199 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:26:21,199 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:21,199 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:21,199 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:26:21,200 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:21,200 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:21,200 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:26:21,200 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:21,200 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:26:21,200 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:26:21,201 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:26:21,201 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:21,201 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:21,201 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:21,201 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:21,202 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:21,202 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:26:21,202 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-10 15:26:21,202 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-10 15:26:21,202 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:26:21,202 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:26:21,203 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 15:26:21,203 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:21,203 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:21,203 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:26:21,203 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-10 15:26:21,203 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 15:26:21,204 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 15:26:21,204 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 15:26:21,204 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-10 15:26:21,204 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:26:21,204 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:26:21,204 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-10 15:26:21,205 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:26:21,205 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:26:21,205 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 15:26:21,205 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:21,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:21 BoogieIcfgContainer [2020-07-10 15:26:21,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:21,211 INFO L168 Benchmark]: Toolchain (without parser) took 2950.08 ms. Allocated memory was 147.8 MB in the beginning and 233.3 MB in the end (delta: 85.5 MB). Free memory was 105.4 MB in the beginning and 89.9 MB in the end (delta: 15.4 MB). Peak memory consumption was 100.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:21,212 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 147.8 MB. Free memory was 124.1 MB in the beginning and 123.9 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:26:21,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.64 ms. Allocated memory is still 147.8 MB. Free memory was 105.1 MB in the beginning and 94.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:21,214 INFO L168 Benchmark]: Boogie Preprocessor took 119.38 ms. Allocated memory was 147.8 MB in the beginning and 203.9 MB in the end (delta: 56.1 MB). Free memory was 94.1 MB in the beginning and 181.5 MB in the end (delta: -87.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:21,215 INFO L168 Benchmark]: RCFGBuilder took 522.28 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 156.2 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:21,216 INFO L168 Benchmark]: TraceAbstraction took 2037.10 ms. Allocated memory was 203.9 MB in the beginning and 233.3 MB in the end (delta: 29.4 MB). Free memory was 155.5 MB in the beginning and 89.9 MB in the end (delta: 65.6 MB). Peak memory consumption was 95.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:21,220 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.18 ms. Allocated memory is still 147.8 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 264.64 ms. Allocated memory is still 147.8 MB. Free memory was 105.1 MB in the beginning and 94.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.38 ms. Allocated memory was 147.8 MB in the beginning and 203.9 MB in the end (delta: 56.1 MB). Free memory was 94.1 MB in the beginning and 181.5 MB in the end (delta: -87.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 522.28 ms. Allocated memory is still 203.9 MB. Free memory was 181.5 MB in the beginning and 156.2 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2037.10 ms. Allocated memory was 203.9 MB in the beginning and 233.3 MB in the end (delta: 29.4 MB). Free memory was 155.5 MB in the beginning and 89.9 MB in the end (delta: 65.6 MB). Peak memory consumption was 95.0 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); [L27] long long *b = malloc(sizeof(long long)*N); [L29] i=0 VAL [\old(N)=0, a={-1:0}, b={-2:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={-2:0}, N=1] [L29] COND TRUE i