/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/ifncompf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:08,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:08,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:08,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:08,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:08,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:08,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:08,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:08,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:08,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:08,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:08,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:08,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:08,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:08,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:08,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:08,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:08,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:08,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:08,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:08,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:08,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:08,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:08,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:08,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:08,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:08,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:08,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:08,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:08,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:08,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:08,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:08,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:08,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:08,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:08,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:08,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:08,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:08,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:08,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:08,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:08,541 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-17 22:49:08,557 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:08,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:08,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:08,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:08,559 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:08,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:08,559 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:08,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:08,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:08,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:08,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:08,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:08,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:08,561 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:08,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:08,561 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:08,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:08,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:08,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:08,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:08,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:08,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:08,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:08,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:08,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:08,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:08,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:08,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:08,564 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:08,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:08,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:08,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:08,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:08,872 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:08,872 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:08,873 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ifncompf.c [2020-07-17 22:49:08,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19851fe31/050cb4c651b34b0abe54b8dc539194a5/FLAG864f213cf [2020-07-17 22:49:09,464 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:09,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ifncompf.c [2020-07-17 22:49:09,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19851fe31/050cb4c651b34b0abe54b8dc539194a5/FLAG864f213cf [2020-07-17 22:49:09,850 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19851fe31/050cb4c651b34b0abe54b8dc539194a5 [2020-07-17 22:49:09,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:09,868 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:09,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:09,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:09,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:09,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:09" (1/1) ... [2020-07-17 22:49:09,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae885f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:09, skipping insertion in model container [2020-07-17 22:49:09,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:09" (1/1) ... [2020-07-17 22:49:09,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:09,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:10,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:10,161 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:10,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:10,202 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:10,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:10 WrapperNode [2020-07-17 22:49:10,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:10,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:10,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:10,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:10,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:10" (1/1) ... [2020-07-17 22:49:10,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:10" (1/1) ... [2020-07-17 22:49:10,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:10" (1/1) ... [2020-07-17 22:49:10,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:10" (1/1) ... [2020-07-17 22:49:10,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:10" (1/1) ... [2020-07-17 22:49:10,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:10" (1/1) ... [2020-07-17 22:49:10,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:10" (1/1) ... [2020-07-17 22:49:10,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:10,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:10,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:10,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:10,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:10" (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-17 22:49:10,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:10,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:10,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:10,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:10,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:10,902 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:10,903 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-17 22:49:10,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:10 BoogieIcfgContainer [2020-07-17 22:49:10,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:10,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:10,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:10,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:10,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:09" (1/3) ... [2020-07-17 22:49:10,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356c5e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:10, skipping insertion in model container [2020-07-17 22:49:10,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:10" (2/3) ... [2020-07-17 22:49:10,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356c5e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:10, skipping insertion in model container [2020-07-17 22:49:10,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:10" (3/3) ... [2020-07-17 22:49:10,917 INFO L109 eAbstractionObserver]: Analyzing ICFG ifncompf.c [2020-07-17 22:49:10,929 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:10,940 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:10,958 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:10,988 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:10,988 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:10,988 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:10,988 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:10,989 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:10,989 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:10,989 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:10,989 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-17 22:49:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:49:11,027 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:11,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:11,028 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:11,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:11,035 INFO L82 PathProgramCache]: Analyzing trace with hash -794599326, now seen corresponding path program 1 times [2020-07-17 22:49:11,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:11,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867592042] [2020-07-17 22:49:11,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:11,294 INFO L280 TraceCheckUtils]: 0: Hoare triple {52#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {43#true} is VALID [2020-07-17 22:49:11,295 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-17 22:49:11,295 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #110#return; {43#true} is VALID [2020-07-17 22:49:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:11,307 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-17 22:49:11,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-17 22:49:11,309 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-17 22:49:11,309 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #106#return; {44#false} is VALID [2020-07-17 22:49:11,312 INFO L263 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {52#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:11,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {52#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {43#true} is VALID [2020-07-17 22:49:11,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-17 22:49:11,313 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #110#return; {43#true} is VALID [2020-07-17 22:49:11,314 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret14 := main(); {43#true} is VALID [2020-07-17 22:49:11,314 INFO L280 TraceCheckUtils]: 5: Hoare triple {43#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {43#true} is VALID [2020-07-17 22:49:11,315 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#true} assume !(~N~0 <= 0); {43#true} is VALID [2020-07-17 22:49:11,315 INFO L263 TraceCheckUtils]: 7: Hoare triple {43#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {43#true} is VALID [2020-07-17 22:49:11,316 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-17 22:49:11,318 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-17 22:49:11,318 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-17 22:49:11,319 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#false} {43#true} #106#return; {44#false} is VALID [2020-07-17 22:49:11,319 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:11,320 INFO L280 TraceCheckUtils]: 13: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-17 22:49:11,320 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:11,321 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume !true; {44#false} is VALID [2020-07-17 22:49:11,321 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:11,321 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#false} assume !true; {44#false} is VALID [2020-07-17 22:49:11,322 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-17 22:49:11,322 INFO L280 TraceCheckUtils]: 19: Hoare triple {44#false} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {44#false} is VALID [2020-07-17 22:49:11,323 INFO L263 TraceCheckUtils]: 20: Hoare triple {44#false} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {44#false} is VALID [2020-07-17 22:49:11,323 INFO L280 TraceCheckUtils]: 21: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2020-07-17 22:49:11,324 INFO L280 TraceCheckUtils]: 22: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2020-07-17 22:49:11,324 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-17 22:49:11,329 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-17 22:49:11,331 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867592042] [2020-07-17 22:49:11,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:11,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:11,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364409594] [2020-07-17 22:49:11,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:49:11,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:11,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:11,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:11,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:11,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:11,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:11,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:11,434 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-07-17 22:49:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:11,701 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2020-07-17 22:49:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:11,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-07-17 22:49:11,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2020-07-17 22:49:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2020-07-17 22:49:11,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2020-07-17 22:49:11,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:11,921 INFO L225 Difference]: With dead ends: 70 [2020-07-17 22:49:11,921 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:49:11,925 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-17 22:49:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:49:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-17 22:49:11,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:11,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-17 22:49:11,979 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-17 22:49:11,979 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-17 22:49:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:11,985 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-17 22:49:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2020-07-17 22:49:11,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:11,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:11,987 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-17 22:49:11,987 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-17 22:49:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:11,991 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-17 22:49:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2020-07-17 22:49:11,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:11,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:11,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:11,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:49:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2020-07-17 22:49:11,998 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 24 [2020-07-17 22:49:11,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:11,998 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2020-07-17 22:49:11,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2020-07-17 22:49:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:49:12,000 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:12,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:12,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:12,001 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash -544938994, now seen corresponding path program 1 times [2020-07-17 22:49:12,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:12,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686373949] [2020-07-17 22:49:12,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:12,029 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:12,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496753740] [2020-07-17 22:49:12,030 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-17 22:49:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:12,092 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:49:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:12,110 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:12,190 INFO L263 TraceCheckUtils]: 0: Hoare triple {260#true} call ULTIMATE.init(); {260#true} is VALID [2020-07-17 22:49:12,190 INFO L280 TraceCheckUtils]: 1: Hoare triple {260#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {260#true} is VALID [2020-07-17 22:49:12,191 INFO L280 TraceCheckUtils]: 2: Hoare triple {260#true} assume true; {260#true} is VALID [2020-07-17 22:49:12,191 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} #110#return; {260#true} is VALID [2020-07-17 22:49:12,191 INFO L263 TraceCheckUtils]: 4: Hoare triple {260#true} call #t~ret14 := main(); {260#true} is VALID [2020-07-17 22:49:12,192 INFO L280 TraceCheckUtils]: 5: Hoare triple {260#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {260#true} is VALID [2020-07-17 22:49:12,193 INFO L280 TraceCheckUtils]: 6: Hoare triple {260#true} assume !(~N~0 <= 0); {283#(< 0 ~N~0)} is VALID [2020-07-17 22:49:12,194 INFO L263 TraceCheckUtils]: 7: Hoare triple {283#(< 0 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {283#(< 0 ~N~0)} is VALID [2020-07-17 22:49:12,195 INFO L280 TraceCheckUtils]: 8: Hoare triple {283#(< 0 ~N~0)} ~cond := #in~cond; {283#(< 0 ~N~0)} is VALID [2020-07-17 22:49:12,195 INFO L280 TraceCheckUtils]: 9: Hoare triple {283#(< 0 ~N~0)} assume !(0 == ~cond); {283#(< 0 ~N~0)} is VALID [2020-07-17 22:49:12,196 INFO L280 TraceCheckUtils]: 10: Hoare triple {283#(< 0 ~N~0)} assume true; {283#(< 0 ~N~0)} is VALID [2020-07-17 22:49:12,197 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {283#(< 0 ~N~0)} {283#(< 0 ~N~0)} #106#return; {283#(< 0 ~N~0)} is VALID [2020-07-17 22:49:12,199 INFO L280 TraceCheckUtils]: 12: Hoare triple {283#(< 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;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;~i~0 := 0; {302#(and (<= main_~i~0 0) (< 0 ~N~0))} is VALID [2020-07-17 22:49:12,200 INFO L280 TraceCheckUtils]: 13: Hoare triple {302#(and (<= main_~i~0 0) (< 0 ~N~0))} assume !(~i~0 < ~N~0); {261#false} is VALID [2020-07-17 22:49:12,200 INFO L280 TraceCheckUtils]: 14: Hoare triple {261#false} ~i~0 := 0; {261#false} is VALID [2020-07-17 22:49:12,201 INFO L280 TraceCheckUtils]: 15: Hoare triple {261#false} assume !(~i~0 < ~N~0); {261#false} is VALID [2020-07-17 22:49:12,201 INFO L280 TraceCheckUtils]: 16: Hoare triple {261#false} ~i~0 := 0; {261#false} is VALID [2020-07-17 22:49:12,201 INFO L280 TraceCheckUtils]: 17: Hoare triple {261#false} assume !(~i~0 < ~N~0); {261#false} is VALID [2020-07-17 22:49:12,202 INFO L280 TraceCheckUtils]: 18: Hoare triple {261#false} ~i~0 := 0; {261#false} is VALID [2020-07-17 22:49:12,202 INFO L280 TraceCheckUtils]: 19: Hoare triple {261#false} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {261#false} is VALID [2020-07-17 22:49:12,202 INFO L263 TraceCheckUtils]: 20: Hoare triple {261#false} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {261#false} is VALID [2020-07-17 22:49:12,203 INFO L280 TraceCheckUtils]: 21: Hoare triple {261#false} ~cond := #in~cond; {261#false} is VALID [2020-07-17 22:49:12,203 INFO L280 TraceCheckUtils]: 22: Hoare triple {261#false} assume 0 == ~cond; {261#false} is VALID [2020-07-17 22:49:12,203 INFO L280 TraceCheckUtils]: 23: Hoare triple {261#false} assume !false; {261#false} is VALID [2020-07-17 22:49:12,205 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-17 22:49:12,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686373949] [2020-07-17 22:49:12,206 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:12,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496753740] [2020-07-17 22:49:12,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:12,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:49:12,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269337534] [2020-07-17 22:49:12,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-17 22:49:12,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:12,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:49:12,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:12,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:49:12,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:12,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:49:12,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:49:12,240 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 4 states. [2020-07-17 22:49:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:12,488 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2020-07-17 22:49:12,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:49:12,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-17 22:49:12,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2020-07-17 22:49:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:12,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2020-07-17 22:49:12,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 84 transitions. [2020-07-17 22:49:12,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:12,628 INFO L225 Difference]: With dead ends: 67 [2020-07-17 22:49:12,628 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:49:12,629 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:49:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:49:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2020-07-17 22:49:12,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:12,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 38 states. [2020-07-17 22:49:12,660 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 38 states. [2020-07-17 22:49:12,660 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 38 states. [2020-07-17 22:49:12,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:12,667 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-17 22:49:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-17 22:49:12,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:12,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:12,669 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 48 states. [2020-07-17 22:49:12,669 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 48 states. [2020-07-17 22:49:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:12,674 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-17 22:49:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-17 22:49:12,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:12,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:12,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:12,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-17 22:49:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2020-07-17 22:49:12,679 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 24 [2020-07-17 22:49:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:12,679 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2020-07-17 22:49:12,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:49:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2020-07-17 22:49:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:49:12,681 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:12,681 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-17 22:49:12,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:49:12,896 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:12,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:12,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1796917477, now seen corresponding path program 1 times [2020-07-17 22:49:12,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:12,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981326498] [2020-07-17 22:49:12,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:12,936 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:12,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [119682218] [2020-07-17 22:49:12,937 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-17 22:49:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:12,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:49:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:13,010 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:13,049 INFO L263 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2020-07-17 22:49:13,049 INFO L280 TraceCheckUtils]: 1: Hoare triple {573#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {573#true} is VALID [2020-07-17 22:49:13,050 INFO L280 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2020-07-17 22:49:13,050 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #110#return; {573#true} is VALID [2020-07-17 22:49:13,050 INFO L263 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret14 := main(); {573#true} is VALID [2020-07-17 22:49:13,051 INFO L280 TraceCheckUtils]: 5: Hoare triple {573#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {573#true} is VALID [2020-07-17 22:49:13,051 INFO L280 TraceCheckUtils]: 6: Hoare triple {573#true} assume !(~N~0 <= 0); {573#true} is VALID [2020-07-17 22:49:13,061 INFO L263 TraceCheckUtils]: 7: Hoare triple {573#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {573#true} is VALID [2020-07-17 22:49:13,061 INFO L280 TraceCheckUtils]: 8: Hoare triple {573#true} ~cond := #in~cond; {573#true} is VALID [2020-07-17 22:49:13,062 INFO L280 TraceCheckUtils]: 9: Hoare triple {573#true} assume !(0 == ~cond); {573#true} is VALID [2020-07-17 22:49:13,062 INFO L280 TraceCheckUtils]: 10: Hoare triple {573#true} assume true; {573#true} is VALID [2020-07-17 22:49:13,062 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {573#true} {573#true} #106#return; {573#true} is VALID [2020-07-17 22:49:13,062 INFO L280 TraceCheckUtils]: 12: Hoare triple {573#true} 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;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(8 * ~N~0);~c~0.base, ~c~0.offset := #t~malloc3.base, #t~malloc3.offset;~i~0 := 0; {573#true} is VALID [2020-07-17 22:49:13,063 INFO L280 TraceCheckUtils]: 13: Hoare triple {573#true} assume !!(~i~0 < ~N~0); {573#true} is VALID [2020-07-17 22:49:13,063 INFO L280 TraceCheckUtils]: 14: Hoare triple {573#true} assume 0 == ~i~0;call write~int(6, ~a~0.base, ~a~0.offset, 8); {573#true} is VALID [2020-07-17 22:49:13,063 INFO L280 TraceCheckUtils]: 15: Hoare triple {573#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {573#true} is VALID [2020-07-17 22:49:13,063 INFO L280 TraceCheckUtils]: 16: Hoare triple {573#true} assume !(~i~0 < ~N~0); {573#true} is VALID [2020-07-17 22:49:13,063 INFO L280 TraceCheckUtils]: 17: Hoare triple {573#true} ~i~0 := 0; {573#true} is VALID [2020-07-17 22:49:13,064 INFO L280 TraceCheckUtils]: 18: Hoare triple {573#true} assume !!(~i~0 < ~N~0); {573#true} is VALID [2020-07-17 22:49:13,064 INFO L280 TraceCheckUtils]: 19: Hoare triple {573#true} assume 0 == ~i~0;call write~int(1, ~b~0.base, ~b~0.offset, 8); {573#true} is VALID [2020-07-17 22:49:13,064 INFO L280 TraceCheckUtils]: 20: Hoare triple {573#true} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {573#true} is VALID [2020-07-17 22:49:13,064 INFO L280 TraceCheckUtils]: 21: Hoare triple {573#true} assume !(~i~0 < ~N~0); {573#true} is VALID [2020-07-17 22:49:13,069 INFO L280 TraceCheckUtils]: 22: Hoare triple {573#true} ~i~0 := 0; {644#(= 0 main_~i~0)} is VALID [2020-07-17 22:49:13,070 INFO L280 TraceCheckUtils]: 23: Hoare triple {644#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {644#(= 0 main_~i~0)} is VALID [2020-07-17 22:49:13,071 INFO L280 TraceCheckUtils]: 24: Hoare triple {644#(= 0 main_~i~0)} assume !(0 == ~i~0);call #t~mem10 := read~int(~c~0.base, ~c~0.offset + 8 * (~i~0 - 1), 8);call #t~mem11 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem10 + #t~mem11, ~c~0.base, ~c~0.offset + 8 * ~i~0, 8);havoc #t~mem10;havoc #t~mem11; {574#false} is VALID [2020-07-17 22:49:13,071 INFO L280 TraceCheckUtils]: 25: Hoare triple {574#false} #t~post9 := ~i~0;~i~0 := 1 + #t~post9;havoc #t~post9; {574#false} is VALID [2020-07-17 22:49:13,071 INFO L280 TraceCheckUtils]: 26: Hoare triple {574#false} assume !(~i~0 < ~N~0); {574#false} is VALID [2020-07-17 22:49:13,072 INFO L280 TraceCheckUtils]: 27: Hoare triple {574#false} ~i~0 := 0; {574#false} is VALID [2020-07-17 22:49:13,072 INFO L280 TraceCheckUtils]: 28: Hoare triple {574#false} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~c~0.base, ~c~0.offset + 8 * ~i~0, 8); {574#false} is VALID [2020-07-17 22:49:13,072 INFO L263 TraceCheckUtils]: 29: Hoare triple {574#false} call __VERIFIER_assert((if #t~mem13 == ~i~0 * ~i~0 * ~i~0 then 1 else 0)); {574#false} is VALID [2020-07-17 22:49:13,072 INFO L280 TraceCheckUtils]: 30: Hoare triple {574#false} ~cond := #in~cond; {574#false} is VALID [2020-07-17 22:49:13,073 INFO L280 TraceCheckUtils]: 31: Hoare triple {574#false} assume 0 == ~cond; {574#false} is VALID [2020-07-17 22:49:13,073 INFO L280 TraceCheckUtils]: 32: Hoare triple {574#false} assume !false; {574#false} is VALID [2020-07-17 22:49:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:49:13,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981326498] [2020-07-17 22:49:13,075 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:13,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119682218] [2020-07-17 22:49:13,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:13,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:13,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451514224] [2020-07-17 22:49:13,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-17 22:49:13,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:13,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:13,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:13,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:13,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:13,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:13,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:13,115 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 3 states. [2020-07-17 22:49:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:13,246 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2020-07-17 22:49:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:13,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-17 22:49:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2020-07-17 22:49:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2020-07-17 22:49:13,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2020-07-17 22:49:13,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:13,354 INFO L225 Difference]: With dead ends: 72 [2020-07-17 22:49:13,354 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:49:13,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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-17 22:49:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:49:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2020-07-17 22:49:13,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:13,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 41 states. [2020-07-17 22:49:13,382 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 41 states. [2020-07-17 22:49:13,382 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 41 states. [2020-07-17 22:49:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:13,386 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-17 22:49:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-17 22:49:13,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:13,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:13,387 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 48 states. [2020-07-17 22:49:13,387 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 48 states. [2020-07-17 22:49:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:13,390 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-17 22:49:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-17 22:49:13,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:13,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:13,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:13,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-17 22:49:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2020-07-17 22:49:13,394 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 33 [2020-07-17 22:49:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:13,395 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2020-07-17 22:49:13,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2020-07-17 22:49:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:49:13,396 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:13,396 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-17 22:49:13,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:13,610 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:13,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1817991449, now seen corresponding path program 1 times [2020-07-17 22:49:13,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:13,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960720982] [2020-07-17 22:49:13,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:13,659 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:13,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930403080] [2020-07-17 22:49:13,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:13,776 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:13,777 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:13,990 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:14,064 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:14,064 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:14,064 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:14,064 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:14,064 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:14,065 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:14,065 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:14,065 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:14,065 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:14,065 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:14,065 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:14,065 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:14,066 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:14,066 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:14,066 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:14,066 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:14,066 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:14,066 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:14,067 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:14,067 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:14,067 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:14,067 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:14,067 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:14,067 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:14,068 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:14,068 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:14,068 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:14,068 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:14,068 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:14,068 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:14,068 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:49:14,068 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-17 22:49:14,069 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-17 22:49:14,069 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:49:14,069 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-17 22:49:14,069 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-17 22:49:14,069 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-17 22:49:14,069 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-17 22:49:14,070 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-17 22:49:14,070 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-17 22:49:14,070 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-17 22:49:14,070 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-17 22:49:14,076 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-17 22:49:14,076 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2020-07-17 22:49:14,077 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:49:14,077 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:49:14,077 WARN L170 areAnnotationChecker]: L57-4 has no Hoare annotation [2020-07-17 22:49:14,077 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-17 22:49:14,077 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-17 22:49:14,077 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-17 22:49:14,077 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-17 22:49:14,077 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-17 22:49:14,078 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2020-07-17 22:49:14,078 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2020-07-17 22:49:14,078 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:49:14,078 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-17 22:49:14,078 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2020-07-17 22:49:14,078 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-17 22:49:14,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:14 BoogieIcfgContainer [2020-07-17 22:49:14,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:14,085 INFO L168 Benchmark]: Toolchain (without parser) took 4217.94 ms. Allocated memory was 135.3 MB in the beginning and 254.8 MB in the end (delta: 119.5 MB). Free memory was 100.1 MB in the beginning and 142.1 MB in the end (delta: -42.0 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:14,086 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:14,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.19 ms. Allocated memory is still 135.3 MB. Free memory was 99.7 MB in the beginning and 88.6 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:14,087 INFO L168 Benchmark]: Boogie Preprocessor took 177.67 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 88.6 MB in the beginning and 176.0 MB in the end (delta: -87.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:14,088 INFO L168 Benchmark]: RCFGBuilder took 518.67 ms. Allocated memory is still 198.7 MB. Free memory was 176.0 MB in the beginning and 146.8 MB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:14,089 INFO L168 Benchmark]: TraceAbstraction took 3172.67 ms. Allocated memory was 198.7 MB in the beginning and 254.8 MB in the end (delta: 56.1 MB). Free memory was 146.1 MB in the beginning and 142.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 60.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:14,094 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 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 331.19 ms. Allocated memory is still 135.3 MB. Free memory was 99.7 MB in the beginning and 88.6 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 177.67 ms. Allocated memory was 135.3 MB in the beginning and 198.7 MB in the end (delta: 63.4 MB). Free memory was 88.6 MB in the beginning and 176.0 MB in the end (delta: -87.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 518.67 ms. Allocated memory is still 198.7 MB. Free memory was 176.0 MB in the beginning and 146.8 MB in the end (delta: 29.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3172.67 ms. Allocated memory was 198.7 MB in the beginning and 254.8 MB in the end (delta: 56.1 MB). Free memory was 146.1 MB in the beginning and 142.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 60.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)=4, 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); [L28] long long *c = malloc(sizeof(long long)*N); [L30] i=0 VAL [\old(N)=0, a={-2:0}, b={1:0}, c={-1:0}, i=0, malloc(sizeof(long long)*N)={-2:0}, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={1:0}, N=1] [L30] COND TRUE i