/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/modsf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:44:46,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:44:46,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:44:46,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:44:46,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:44:46,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:44:46,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:44:46,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:44:46,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:44:46,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:44:46,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:44:46,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:44:46,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:44:46,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:44:46,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:44:46,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:44:46,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:44:46,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:44:46,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:44:46,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:44:46,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:44:46,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:44:46,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:44:46,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:44:46,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:44:46,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:44:46,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:44:46,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:44:46,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:44:46,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:44:46,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:44:46,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:44:46,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:44:46,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:44:46,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:44:46,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:44:46,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:44:46,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:44:46,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:44:46,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:44:46,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:44:46,741 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-08 12:44:46,766 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:44:46,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:44:46,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:44:46,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:44:46,770 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:44:46,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:44:46,770 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:44:46,770 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:44:46,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:44:46,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:44:46,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:44:46,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:44:46,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:44:46,773 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:44:46,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:44:46,773 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:44:46,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:44:46,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:44:46,774 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:44:46,774 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:44:46,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:44:46,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:44:46,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:44:46,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:44:46,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:44:46,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:44:46,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:44:46,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:44:46,780 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:44:46,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:44:47,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:44:47,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:44:47,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:44:47,111 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:44:47,111 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:44:47,112 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/modsf.c [2020-07-08 12:44:47,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0f963e98/2400c59c023f4e049e9ac6a40c2cbb09/FLAG2ea9e88f4 [2020-07-08 12:44:47,637 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:44:47,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/modsf.c [2020-07-08 12:44:47,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0f963e98/2400c59c023f4e049e9ac6a40c2cbb09/FLAG2ea9e88f4 [2020-07-08 12:44:48,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0f963e98/2400c59c023f4e049e9ac6a40c2cbb09 [2020-07-08 12:44:48,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:44:48,019 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:44:48,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:48,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:44:48,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:44:48,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:48" (1/1) ... [2020-07-08 12:44:48,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c1444d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:48, skipping insertion in model container [2020-07-08 12:44:48,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:48" (1/1) ... [2020-07-08 12:44:48,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:44:48,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:44:48,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:48,265 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:44:48,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:48,311 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:44:48,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:48 WrapperNode [2020-07-08 12:44:48,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:48,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:44:48,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:44:48,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:44:48,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:48" (1/1) ... [2020-07-08 12:44:48,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:48" (1/1) ... [2020-07-08 12:44:48,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:48" (1/1) ... [2020-07-08 12:44:48,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:48" (1/1) ... [2020-07-08 12:44:48,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:48" (1/1) ... [2020-07-08 12:44:48,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:48" (1/1) ... [2020-07-08 12:44:48,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:48" (1/1) ... [2020-07-08 12:44:48,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:44:48,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:44:48,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:44:48,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:44:48,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:48" (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-08 12:44:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:44:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:44:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:44:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:44:48,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:44:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:44:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:44:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:44:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:44:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:44:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:44:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:44:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:44:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:44:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:44:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:44:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:44:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:44:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:44:49,087 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:44:49,087 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-08 12:44:49,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:49 BoogieIcfgContainer [2020-07-08 12:44:49,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:44:49,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:44:49,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:44:49,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:44:49,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:44:48" (1/3) ... [2020-07-08 12:44:49,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10896d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:49, skipping insertion in model container [2020-07-08 12:44:49,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:48" (2/3) ... [2020-07-08 12:44:49,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10896d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:49, skipping insertion in model container [2020-07-08 12:44:49,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:49" (3/3) ... [2020-07-08 12:44:49,104 INFO L109 eAbstractionObserver]: Analyzing ICFG modsf.c [2020-07-08 12:44:49,115 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:44:49,121 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:44:49,134 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:44:49,154 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:44:49,154 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:44:49,154 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:44:49,155 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:44:49,155 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:44:49,155 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:44:49,155 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:44:49,155 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:44:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2020-07-08 12:44:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:44:49,181 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:49,182 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] [2020-07-08 12:44:49,182 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:49,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:49,188 INFO L82 PathProgramCache]: Analyzing trace with hash -173101897, now seen corresponding path program 1 times [2020-07-08 12:44:49,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:49,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699130733] [2020-07-08 12:44:49,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:49,454 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-08 12:44:49,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-08 12:44:49,456 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #109#return; {43#true} is VALID [2020-07-08 12:44:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:49,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-08 12:44:49,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-08 12:44:49,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-08 12:44:49,474 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #105#return; {44#false} is VALID [2020-07-08 12:44:49,477 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-08 12:44:49,477 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-08 12:44:49,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2020-07-08 12:44:49,478 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #109#return; {43#true} is VALID [2020-07-08 12:44:49,479 INFO L263 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret14 := main(); {43#true} is VALID [2020-07-08 12:44:49,479 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-08 12:44:49,480 INFO L280 TraceCheckUtils]: 6: Hoare triple {43#true} assume !(~N~0 <= 0); {43#true} is VALID [2020-07-08 12:44:49,480 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-08 12:44:49,480 INFO L280 TraceCheckUtils]: 8: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2020-07-08 12:44:49,482 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2020-07-08 12:44:49,482 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#false} assume true; {44#false} is VALID [2020-07-08 12:44:49,482 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#false} {43#true} #105#return; {44#false} is VALID [2020-07-08 12:44:49,483 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {44#false} is VALID [2020-07-08 12:44:49,484 INFO L280 TraceCheckUtils]: 13: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-08 12:44:49,484 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-08 12:44:49,484 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-08 12:44:49,485 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-08 12:44:49,485 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#false} assume !(~i~0 < ~N~0); {44#false} is VALID [2020-07-08 12:44:49,486 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-08 12:44:49,486 INFO L280 TraceCheckUtils]: 19: Hoare triple {44#false} assume !true; {44#false} is VALID [2020-07-08 12:44:49,486 INFO L280 TraceCheckUtils]: 20: Hoare triple {44#false} ~i~0 := 0; {44#false} is VALID [2020-07-08 12:44:49,487 INFO L280 TraceCheckUtils]: 21: Hoare triple {44#false} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {44#false} is VALID [2020-07-08 12:44:49,487 INFO L263 TraceCheckUtils]: 22: Hoare triple {44#false} call __VERIFIER_assert((if 1 == #t~mem13 then 1 else 0)); {44#false} is VALID [2020-07-08 12:44:49,488 INFO L280 TraceCheckUtils]: 23: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2020-07-08 12:44:49,488 INFO L280 TraceCheckUtils]: 24: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2020-07-08 12:44:49,489 INFO L280 TraceCheckUtils]: 25: Hoare triple {44#false} assume !false; {44#false} is VALID [2020-07-08 12:44:49,493 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-08 12:44:49,494 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699130733] [2020-07-08 12:44:49,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:49,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:44:49,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033821854] [2020-07-08 12:44:49,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:44:49,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:49,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:44:49,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:49,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:44:49,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:49,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:44:49,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:44:49,580 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2020-07-08 12:44:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:49,926 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2020-07-08 12:44:49,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:44:49,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 12:44:49,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-08 12:44:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2020-07-08 12:44:49,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2020-07-08 12:44:50,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:50,177 INFO L225 Difference]: With dead ends: 70 [2020-07-08 12:44:50,177 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:44:50,187 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-08 12:44:50,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:44:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-08 12:44:50,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:50,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-08 12:44:50,242 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-08 12:44:50,243 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-08 12:44:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:50,248 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-08 12:44:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 12:44:50,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:50,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:50,250 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-08 12:44:50,250 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-08 12:44:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:50,255 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-08 12:44:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 12:44:50,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:50,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:50,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:50,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 12:44:50,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-08 12:44:50,262 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2020-07-08 12:44:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:50,263 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-08 12:44:50,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:44:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 12:44:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:44:50,265 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:50,265 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] [2020-07-08 12:44:50,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:44:50,266 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1503462707, now seen corresponding path program 1 times [2020-07-08 12:44:50,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:50,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831777920] [2020-07-08 12:44:50,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:50,425 INFO L280 TraceCheckUtils]: 0: Hoare triple {274#(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; {263#true} is VALID [2020-07-08 12:44:50,426 INFO L280 TraceCheckUtils]: 1: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-08 12:44:50,426 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {263#true} {263#true} #109#return; {263#true} is VALID [2020-07-08 12:44:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:50,436 INFO L280 TraceCheckUtils]: 0: Hoare triple {263#true} ~cond := #in~cond; {263#true} is VALID [2020-07-08 12:44:50,436 INFO L280 TraceCheckUtils]: 1: Hoare triple {263#true} assume !(0 == ~cond); {263#true} is VALID [2020-07-08 12:44:50,437 INFO L280 TraceCheckUtils]: 2: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-08 12:44:50,438 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {263#true} {268#(<= 1 ~N~0)} #105#return; {268#(<= 1 ~N~0)} is VALID [2020-07-08 12:44:50,439 INFO L263 TraceCheckUtils]: 0: Hoare triple {263#true} call ULTIMATE.init(); {274#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:44:50,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {274#(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; {263#true} is VALID [2020-07-08 12:44:50,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-08 12:44:50,441 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {263#true} {263#true} #109#return; {263#true} is VALID [2020-07-08 12:44:50,441 INFO L263 TraceCheckUtils]: 4: Hoare triple {263#true} call #t~ret14 := main(); {263#true} is VALID [2020-07-08 12:44:50,441 INFO L280 TraceCheckUtils]: 5: Hoare triple {263#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {263#true} is VALID [2020-07-08 12:44:50,442 INFO L280 TraceCheckUtils]: 6: Hoare triple {263#true} assume !(~N~0 <= 0); {268#(<= 1 ~N~0)} is VALID [2020-07-08 12:44:50,443 INFO L263 TraceCheckUtils]: 7: Hoare triple {268#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {263#true} is VALID [2020-07-08 12:44:50,443 INFO L280 TraceCheckUtils]: 8: Hoare triple {263#true} ~cond := #in~cond; {263#true} is VALID [2020-07-08 12:44:50,443 INFO L280 TraceCheckUtils]: 9: Hoare triple {263#true} assume !(0 == ~cond); {263#true} is VALID [2020-07-08 12:44:50,444 INFO L280 TraceCheckUtils]: 10: Hoare triple {263#true} assume true; {263#true} is VALID [2020-07-08 12:44:50,445 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {263#true} {268#(<= 1 ~N~0)} #105#return; {268#(<= 1 ~N~0)} is VALID [2020-07-08 12:44:50,446 INFO L280 TraceCheckUtils]: 12: Hoare triple {268#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {273#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 12:44:50,448 INFO L280 TraceCheckUtils]: 13: Hoare triple {273#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-08 12:44:50,448 INFO L280 TraceCheckUtils]: 14: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-08 12:44:50,448 INFO L280 TraceCheckUtils]: 15: Hoare triple {264#false} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-08 12:44:50,449 INFO L280 TraceCheckUtils]: 16: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-08 12:44:50,449 INFO L280 TraceCheckUtils]: 17: Hoare triple {264#false} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-08 12:44:50,450 INFO L280 TraceCheckUtils]: 18: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-08 12:44:50,450 INFO L280 TraceCheckUtils]: 19: Hoare triple {264#false} assume !(~i~0 < ~N~0); {264#false} is VALID [2020-07-08 12:44:50,451 INFO L280 TraceCheckUtils]: 20: Hoare triple {264#false} ~i~0 := 0; {264#false} is VALID [2020-07-08 12:44:50,451 INFO L280 TraceCheckUtils]: 21: Hoare triple {264#false} assume !!(~i~0 < ~N~0);call #t~mem13 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); {264#false} is VALID [2020-07-08 12:44:50,451 INFO L263 TraceCheckUtils]: 22: Hoare triple {264#false} call __VERIFIER_assert((if 1 == #t~mem13 then 1 else 0)); {264#false} is VALID [2020-07-08 12:44:50,451 INFO L280 TraceCheckUtils]: 23: Hoare triple {264#false} ~cond := #in~cond; {264#false} is VALID [2020-07-08 12:44:50,452 INFO L280 TraceCheckUtils]: 24: Hoare triple {264#false} assume 0 == ~cond; {264#false} is VALID [2020-07-08 12:44:50,452 INFO L280 TraceCheckUtils]: 25: Hoare triple {264#false} assume !false; {264#false} is VALID [2020-07-08 12:44:50,454 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-08 12:44:50,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831777920] [2020-07-08 12:44:50,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:50,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:44:50,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631701679] [2020-07-08 12:44:50,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-08 12:44:50,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:50,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:44:50,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:50,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:44:50,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:50,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:44:50,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:44:50,499 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2020-07-08 12:44:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:50,890 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-07-08 12:44:50,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:44:50,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-08 12:44:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:50,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-08 12:44:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-08 12:44:50,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2020-07-08 12:44:51,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:51,033 INFO L225 Difference]: With dead ends: 67 [2020-07-08 12:44:51,033 INFO L226 Difference]: Without dead ends: 47 [2020-07-08 12:44:51,034 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:44:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-08 12:44:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2020-07-08 12:44:51,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:51,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 39 states. [2020-07-08 12:44:51,076 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 39 states. [2020-07-08 12:44:51,077 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 39 states. [2020-07-08 12:44:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:51,082 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-08 12:44:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2020-07-08 12:44:51,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:51,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:51,084 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 47 states. [2020-07-08 12:44:51,084 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 47 states. [2020-07-08 12:44:51,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:51,089 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2020-07-08 12:44:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2020-07-08 12:44:51,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:51,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:51,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:51,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-08 12:44:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-07-08 12:44:51,094 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 26 [2020-07-08 12:44:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:51,095 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-07-08 12:44:51,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:44:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-07-08 12:44:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 12:44:51,097 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:51,097 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:44:51,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:44:51,098 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:51,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:51,098 INFO L82 PathProgramCache]: Analyzing trace with hash -260192085, now seen corresponding path program 1 times [2020-07-08 12:44:51,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:51,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847923865] [2020-07-08 12:44:51,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:51,131 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 12:44:51,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [811178445] [2020-07-08 12:44:51,132 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-08 12:44:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:44:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:44:51,297 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:44:51,297 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:44:51,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-08 12:44:51,575 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:44:51,575 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:44:51,575 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:44:51,575 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:44:51,575 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:44:51,575 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:44:51,576 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:44:51,576 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:44:51,576 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:44:51,576 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:44:51,576 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:44:51,576 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:44:51,577 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:44:51,577 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:44:51,577 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:44:51,577 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:44:51,577 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:44:51,577 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-08 12:44:51,577 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:44:51,578 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:44:51,578 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:44:51,578 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:44:51,578 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:44:51,578 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:44:51,578 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 12:44:51,579 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:44:51,579 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:44:51,579 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:44:51,579 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:44:51,579 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:44:51,579 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:44:51,579 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-08 12:44:51,580 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 12:44:51,580 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 12:44:51,580 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-08 12:44:51,580 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:44:51,580 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:44:51,580 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:44:51,580 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-08 12:44:51,581 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-08 12:44:51,581 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-08 12:44:51,581 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-08 12:44:51,581 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 12:44:51,581 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2020-07-08 12:44:51,581 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-08 12:44:51,581 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-08 12:44:51,582 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 12:44:51,582 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 12:44:51,582 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 12:44:51,582 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-08 12:44:51,582 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-08 12:44:51,582 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-08 12:44:51,582 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-08 12:44:51,582 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-08 12:44:51,583 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2020-07-08 12:44:51,583 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-08 12:44:51,583 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-08 12:44:51,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:44:51 BoogieIcfgContainer [2020-07-08 12:44:51,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:44:51,589 INFO L168 Benchmark]: Toolchain (without parser) took 3569.90 ms. Allocated memory was 144.2 MB in the beginning and 249.0 MB in the end (delta: 104.9 MB). Free memory was 101.3 MB in the beginning and 205.7 MB in the end (delta: -104.5 MB). Peak memory consumption was 400.9 kB. Max. memory is 7.1 GB. [2020-07-08 12:44:51,590 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:44:51,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.29 ms. Allocated memory is still 144.2 MB. Free memory was 100.9 MB in the beginning and 89.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:51,592 INFO L168 Benchmark]: Boogie Preprocessor took 147.12 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 89.7 MB in the beginning and 179.1 MB in the end (delta: -89.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:51,593 INFO L168 Benchmark]: RCFGBuilder took 632.85 ms. Allocated memory is still 201.9 MB. Free memory was 179.1 MB in the beginning and 150.0 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:51,594 INFO L168 Benchmark]: TraceAbstraction took 2490.11 ms. Allocated memory was 201.9 MB in the beginning and 249.0 MB in the end (delta: 47.2 MB). Free memory was 150.0 MB in the beginning and 205.7 MB in the end (delta: -55.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:44:51,598 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.29 ms. Allocated memory is still 144.2 MB. Free memory was 100.9 MB in the beginning and 89.7 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 147.12 ms. Allocated memory was 144.2 MB in the beginning and 201.9 MB in the end (delta: 57.7 MB). Free memory was 89.7 MB in the beginning and 179.1 MB in the end (delta: -89.4 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 632.85 ms. Allocated memory is still 201.9 MB. Free memory was 179.1 MB in the beginning and 150.0 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2490.11 ms. Allocated memory was 201.9 MB in the beginning and 249.0 MB in the end (delta: 47.2 MB). Free memory was 150.0 MB in the beginning and 205.7 MB in the end (delta: -55.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=6, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; [L26] long long sum[1]; [L27] long long *a = malloc(sizeof(long long)*N); [L29] sum[0] = 0 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, N=1, sum={2:0}] [L30] COND TRUE i