/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/condmf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:44:24,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:44:24,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:44:24,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:44:24,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:44:24,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:44:24,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:44:24,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:44:24,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:44:24,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:44:24,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:44:24,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:44:24,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:44:24,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:44:24,084 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:44:24,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:44:24,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:44:24,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:44:24,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:44:24,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:44:24,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:44:24,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:44:24,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:44:24,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:44:24,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:44:24,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:44:24,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:44:24,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:44:24,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:44:24,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:44:24,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:44:24,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:44:24,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:44:24,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:44:24,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:44:24,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:44:24,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:44:24,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:44:24,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:44:24,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:44:24,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:44:24,122 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:24,155 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:44:24,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:44:24,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:44:24,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:44:24,157 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:44:24,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:44:24,157 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:44:24,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:44:24,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:44:24,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:44:24,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:44:24,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:44:24,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:44:24,158 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:44:24,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:44:24,159 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:44:24,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:44:24,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:44:24,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:44:24,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:44:24,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:44:24,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:44:24,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:44:24,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:44:24,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:44:24,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:44:24,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:44:24,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:44:24,161 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:44:24,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:44:24,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:44:24,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:44:24,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:44:24,503 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:44:24,504 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:44:24,505 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condmf.c [2020-07-08 12:44:24,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddb51295/b00701711a7e46b6aaf07a554f928876/FLAGfc7d343f1 [2020-07-08 12:44:25,020 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:44:25,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condmf.c [2020-07-08 12:44:25,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddb51295/b00701711a7e46b6aaf07a554f928876/FLAGfc7d343f1 [2020-07-08 12:44:25,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ddb51295/b00701711a7e46b6aaf07a554f928876 [2020-07-08 12:44:25,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:44:25,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:44:25,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:25,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:44:25,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:44:25,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:25" (1/1) ... [2020-07-08 12:44:25,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f01ef99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:25, skipping insertion in model container [2020-07-08 12:44:25,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:44:25" (1/1) ... [2020-07-08 12:44:25,479 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:44:25,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:44:25,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:25,717 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:44:25,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:44:25,860 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:44:25,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:25 WrapperNode [2020-07-08 12:44:25,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:44:25,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:44:25,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:44:25,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:44:25,875 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:25" (1/1) ... [2020-07-08 12:44:25,875 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:25" (1/1) ... [2020-07-08 12:44:25,885 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:25" (1/1) ... [2020-07-08 12:44:25,885 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:25" (1/1) ... [2020-07-08 12:44:25,896 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:25" (1/1) ... [2020-07-08 12:44:25,903 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:25" (1/1) ... [2020-07-08 12:44:25,905 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:25" (1/1) ... [2020-07-08 12:44:25,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:44:25,908 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:44:25,908 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:44:25,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:44:25,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:25" (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:25,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:44:25,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:44:25,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:44:25,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:44:25,976 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:44:25,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:44:25,976 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:44:25,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:44:25,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:44:25,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:44:25,977 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:44:25,977 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:44:25,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:44:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:44:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:44:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:44:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:44:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:44:26,399 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:44:26,399 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 12:44:26,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:26 BoogieIcfgContainer [2020-07-08 12:44:26,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:44:26,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:44:26,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:44:26,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:44:26,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:44:25" (1/3) ... [2020-07-08 12:44:26,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c997f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:26, skipping insertion in model container [2020-07-08 12:44:26,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:44:25" (2/3) ... [2020-07-08 12:44:26,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c997f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:44:26, skipping insertion in model container [2020-07-08 12:44:26,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:44:26" (3/3) ... [2020-07-08 12:44:26,411 INFO L109 eAbstractionObserver]: Analyzing ICFG condmf.c [2020-07-08 12:44:26,419 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:44:26,426 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:44:26,440 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:44:26,466 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:44:26,466 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:44:26,466 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:44:26,467 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:44:26,467 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:44:26,467 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:44:26,467 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:44:26,467 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:44:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-08 12:44:26,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:44:26,488 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:26,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:44:26,489 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:26,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:26,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1524373234, now seen corresponding path program 1 times [2020-07-08 12:44:26,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:26,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603709959] [2020-07-08 12:44:26,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:26,725 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#(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; {38#true} is VALID [2020-07-08 12:44:26,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-08 12:44:26,726 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-08 12:44:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:26,739 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-08 12:44:26,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-08 12:44:26,741 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-08 12:44:26,741 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-08 12:44:26,743 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(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:26,744 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(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; {38#true} is VALID [2020-07-08 12:44:26,745 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-08 12:44:26,745 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-08 12:44:26,745 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret8 := main(); {38#true} is VALID [2020-07-08 12:44:26,746 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {38#true} is VALID [2020-07-08 12:44:26,746 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~N~0 <= 0); {38#true} is VALID [2020-07-08 12:44:26,747 INFO L263 TraceCheckUtils]: 7: Hoare triple {38#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {38#true} is VALID [2020-07-08 12:44:26,747 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-08 12:44:26,748 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-08 12:44:26,749 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-08 12:44:26,749 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-08 12:44:26,750 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {39#false} is VALID [2020-07-08 12:44:26,751 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-08 12:44:26,751 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-08 12:44:26,751 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-08 12:44:26,752 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-08 12:44:26,752 INFO L280 TraceCheckUtils]: 17: Hoare triple {39#false} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {39#false} is VALID [2020-07-08 12:44:26,753 INFO L263 TraceCheckUtils]: 18: Hoare triple {39#false} call __VERIFIER_assert((if (if #t~mem7 < 0 && 0 != #t~mem7 % 2 then #t~mem7 % 2 - 2 else #t~mem7 % 2) == (if ~N~0 < 0 && 0 != ~N~0 % 2 then ~N~0 % 2 - 2 else ~N~0 % 2) then 1 else 0)); {39#false} is VALID [2020-07-08 12:44:26,753 INFO L280 TraceCheckUtils]: 19: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-08 12:44:26,753 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-08 12:44:26,754 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-08 12:44:26,757 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:26,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603709959] [2020-07-08 12:44:26,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:26,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:44:26,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135271211] [2020-07-08 12:44:26,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:44:26,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:26,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:44:26,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:26,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:44:26,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:26,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:44:26,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:44:26,831 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-08 12:44:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:27,050 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2020-07-08 12:44:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:44:27,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-08 12:44:27,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-08 12:44:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:44:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-08 12:44:27,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2020-07-08 12:44:27,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:27,223 INFO L225 Difference]: With dead ends: 60 [2020-07-08 12:44:27,224 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:44:27,228 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:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:44:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-08 12:44:27,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:27,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-08 12:44:27,282 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 12:44:27,282 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 12:44:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:27,287 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-08 12:44:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:44:27,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:27,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:27,288 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 12:44:27,288 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 12:44:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:27,293 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-08 12:44:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:44:27,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:27,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:27,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:27,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 12:44:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-08 12:44:27,299 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2020-07-08 12:44:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:27,299 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-08 12:44:27,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:44:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:44:27,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:44:27,301 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:27,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:44:27,301 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:44:27,301 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:27,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:27,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2111179248, now seen corresponding path program 1 times [2020-07-08 12:44:27,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:27,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568862199] [2020-07-08 12:44:27,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:27,435 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#(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; {227#true} is VALID [2020-07-08 12:44:27,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-08 12:44:27,436 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {227#true} {227#true} #86#return; {227#true} is VALID [2020-07-08 12:44:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:44:27,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-08 12:44:27,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-08 12:44:27,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-08 12:44:27,447 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #82#return; {232#(<= 1 ~N~0)} is VALID [2020-07-08 12:44:27,448 INFO L263 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {238#(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:27,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {238#(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; {227#true} is VALID [2020-07-08 12:44:27,449 INFO L280 TraceCheckUtils]: 2: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-08 12:44:27,449 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {227#true} {227#true} #86#return; {227#true} is VALID [2020-07-08 12:44:27,449 INFO L263 TraceCheckUtils]: 4: Hoare triple {227#true} call #t~ret8 := main(); {227#true} is VALID [2020-07-08 12:44:27,450 INFO L280 TraceCheckUtils]: 5: Hoare triple {227#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {227#true} is VALID [2020-07-08 12:44:27,451 INFO L280 TraceCheckUtils]: 6: Hoare triple {227#true} assume !(~N~0 <= 0); {232#(<= 1 ~N~0)} is VALID [2020-07-08 12:44:27,451 INFO L263 TraceCheckUtils]: 7: Hoare triple {232#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {227#true} is VALID [2020-07-08 12:44:27,451 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#true} ~cond := #in~cond; {227#true} is VALID [2020-07-08 12:44:27,451 INFO L280 TraceCheckUtils]: 9: Hoare triple {227#true} assume !(0 == ~cond); {227#true} is VALID [2020-07-08 12:44:27,452 INFO L280 TraceCheckUtils]: 10: Hoare triple {227#true} assume true; {227#true} is VALID [2020-07-08 12:44:27,453 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {227#true} {232#(<= 1 ~N~0)} #82#return; {232#(<= 1 ~N~0)} is VALID [2020-07-08 12:44:27,454 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#(<= 1 ~N~0)} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;~i~0 := 0; {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 12:44:27,455 INFO L280 TraceCheckUtils]: 13: Hoare triple {237#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-08 12:44:27,455 INFO L280 TraceCheckUtils]: 14: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-08 12:44:27,456 INFO L280 TraceCheckUtils]: 15: Hoare triple {228#false} assume !(~i~0 < ~N~0); {228#false} is VALID [2020-07-08 12:44:27,456 INFO L280 TraceCheckUtils]: 16: Hoare triple {228#false} ~i~0 := 0; {228#false} is VALID [2020-07-08 12:44:27,456 INFO L280 TraceCheckUtils]: 17: Hoare triple {228#false} assume !!(~i~0 < ~N~0);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {228#false} is VALID [2020-07-08 12:44:27,457 INFO L263 TraceCheckUtils]: 18: Hoare triple {228#false} call __VERIFIER_assert((if (if #t~mem7 < 0 && 0 != #t~mem7 % 2 then #t~mem7 % 2 - 2 else #t~mem7 % 2) == (if ~N~0 < 0 && 0 != ~N~0 % 2 then ~N~0 % 2 - 2 else ~N~0 % 2) then 1 else 0)); {228#false} is VALID [2020-07-08 12:44:27,457 INFO L280 TraceCheckUtils]: 19: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2020-07-08 12:44:27,457 INFO L280 TraceCheckUtils]: 20: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2020-07-08 12:44:27,458 INFO L280 TraceCheckUtils]: 21: Hoare triple {228#false} assume !false; {228#false} is VALID [2020-07-08 12:44:27,459 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:27,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568862199] [2020-07-08 12:44:27,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:44:27,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:44:27,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343944635] [2020-07-08 12:44:27,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-08 12:44:27,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:44:27,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:44:27,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:27,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:44:27,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:44:27,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:44:27,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:44:27,493 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2020-07-08 12:44:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:27,837 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2020-07-08 12:44:27,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:44:27,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-08 12:44:27,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:44:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-08 12:44:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:44:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-08 12:44:27,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-08 12:44:27,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:44:27,946 INFO L225 Difference]: With dead ends: 54 [2020-07-08 12:44:27,947 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 12:44:27,948 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:27,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 12:44:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2020-07-08 12:44:27,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:44:27,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 32 states. [2020-07-08 12:44:27,978 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 32 states. [2020-07-08 12:44:27,979 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 32 states. [2020-07-08 12:44:27,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:27,984 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-08 12:44:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-08 12:44:27,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:27,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:27,985 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 39 states. [2020-07-08 12:44:27,986 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 39 states. [2020-07-08 12:44:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:44:27,990 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-08 12:44:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-08 12:44:27,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:44:27,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:44:27,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:44:27,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:44:27,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 12:44:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-08 12:44:27,994 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2020-07-08 12:44:27,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:44:27,995 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-08 12:44:27,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:44:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-08 12:44:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 12:44:27,996 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:44:27,996 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] [2020-07-08 12:44:27,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:44:27,997 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:44:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:44:27,998 INFO L82 PathProgramCache]: Analyzing trace with hash 373909448, now seen corresponding path program 1 times [2020-07-08 12:44:27,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:44:27,998 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480660214] [2020-07-08 12:44:27,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:44:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:44:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:44:28,138 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:44:28,139 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:44:28,139 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:44:28,174 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:44:28,175 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:44:28,175 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:44:28,175 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:44:28,175 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:44:28,175 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:44:28,176 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:44:28,176 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:44:28,176 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:44:28,176 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:44:28,176 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:44:28,176 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:44:28,177 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:44:28,177 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:44:28,177 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:44:28,177 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:44:28,177 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:44:28,177 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-08 12:44:28,178 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:44:28,178 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:44:28,178 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:44:28,178 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:44:28,178 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:44:28,179 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:44:28,179 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 12:44:28,179 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:44:28,179 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:44:28,179 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:44:28,179 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-08 12:44:28,180 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-08 12:44:28,180 WARN L170 areAnnotationChecker]: L28-3 has no Hoare annotation [2020-07-08 12:44:28,180 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-08 12:44:28,180 WARN L170 areAnnotationChecker]: L28-4 has no Hoare annotation [2020-07-08 12:44:28,180 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2020-07-08 12:44:28,180 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-08 12:44:28,180 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-08 12:44:28,181 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-08 12:44:28,181 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2020-07-08 12:44:28,181 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-08 12:44:28,181 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-08 12:44:28,181 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-08 12:44:28,181 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2020-07-08 12:44:28,182 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 12:44:28,182 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-08 12:44:28,182 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2020-07-08 12:44:28,182 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-08 12:44:28,182 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-08 12:44:28,182 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2020-07-08 12:44:28,183 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:28,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:44:28 BoogieIcfgContainer [2020-07-08 12:44:28,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:44:28,189 INFO L168 Benchmark]: Toolchain (without parser) took 2727.66 ms. Allocated memory was 138.4 MB in the beginning and 234.9 MB in the end (delta: 96.5 MB). Free memory was 103.1 MB in the beginning and 100.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 99.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:28,190 INFO L168 Benchmark]: CDTParser took 0.60 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:44:28,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.85 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 102.7 MB in the beginning and 181.0 MB in the end (delta: -78.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:28,192 INFO L168 Benchmark]: Boogie Preprocessor took 46.26 ms. Allocated memory is still 201.9 MB. Free memory was 181.0 MB in the beginning and 179.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:28,193 INFO L168 Benchmark]: RCFGBuilder took 495.30 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 153.8 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:28,194 INFO L168 Benchmark]: TraceAbstraction took 1781.47 ms. Allocated memory was 201.9 MB in the beginning and 234.9 MB in the end (delta: 33.0 MB). Free memory was 153.1 MB in the beginning and 100.0 MB in the end (delta: 53.1 MB). Peak memory consumption was 86.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:44:28,198 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.60 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 397.85 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 102.7 MB in the beginning and 181.0 MB in the end (delta: -78.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.26 ms. Allocated memory is still 201.9 MB. Free memory was 181.0 MB in the beginning and 179.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 495.30 ms. Allocated memory is still 201.9 MB. Free memory was 179.0 MB in the beginning and 153.8 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1781.47 ms. Allocated memory was 201.9 MB in the beginning and 234.9 MB in the end (delta: 33.0 MB). Free memory was 153.1 MB in the beginning and 100.0 MB in the end (delta: 53.1 MB). Peak memory consumption was 86.2 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)=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] int *a = malloc(sizeof(int)*N); [L28] i = 0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L28] COND TRUE i < N [L30] a[i] = 0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L28] i++ VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1] [L28] COND FALSE !(i < N) VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1] [L33] i = 0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L33] COND TRUE i < N VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L35] COND TRUE N%2 == 1 [L37] EXPR a[i] [L37] a[i] = a[i] + 2 [L33] i++ VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1] [L33] COND FALSE !(i < N) VAL [\old(N)=0, a={-1:0}, i=1, malloc(sizeof(int)*N)={-1:0}, N=1] [L45] i = 0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L45] COND TRUE i < N [L47] EXPR a[i] VAL [\old(N)=0, a={-1:0}, a[i]=2, i=0, malloc(sizeof(int)*N)={-1:0}, N=1] [L47] CALL __VERIFIER_assert(a[i] % 2 == N % 2) VAL [\old(cond)=0, \old(N)=0, N=1] [L13] COND TRUE !(cond) VAL [\old(cond)=0, \old(N)=0, cond=0, N=1] [L13] __VERIFIER_error() VAL [\old(cond)=0, \old(N)=0, cond=0, N=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 57 SDtfs, 52 SDslu, 11 SDs, 0 SdLazy, 84 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 1596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...