/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/loops/for_bounded_loop1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:50:09,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:09,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:09,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:09,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:09,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:09,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:09,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:09,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:09,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:09,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:09,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:09,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:09,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:09,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:09,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:09,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:09,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:09,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:09,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:09,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:09,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:09,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:09,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:09,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:09,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:09,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:09,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:09,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:09,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:09,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:09,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:09,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:09,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:09,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:09,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:09,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:09,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:09,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:09,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:09,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:09,964 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:50:09,978 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:09,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:09,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:09,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:09,980 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:09,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:09,980 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:09,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:09,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:09,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:09,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:09,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:09,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:09,981 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:09,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:09,982 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:09,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:09,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:09,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:09,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:09,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:09,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:09,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:09,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:09,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:09,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:09,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:09,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:09,984 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:09,985 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:10,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:10,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:10,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:10,266 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:10,267 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:10,268 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/for_bounded_loop1.c [2020-07-17 22:50:10,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bcdf05d3/8cbbfa709a71436ca181fd64a2d47bd7/FLAGf10d208c2 [2020-07-17 22:50:10,825 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:10,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/for_bounded_loop1.c [2020-07-17 22:50:10,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bcdf05d3/8cbbfa709a71436ca181fd64a2d47bd7/FLAGf10d208c2 [2020-07-17 22:50:11,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bcdf05d3/8cbbfa709a71436ca181fd64a2d47bd7 [2020-07-17 22:50:11,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:11,190 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:11,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:11,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:11,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:11,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:11" (1/1) ... [2020-07-17 22:50:11,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e522c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:11, skipping insertion in model container [2020-07-17 22:50:11,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:11" (1/1) ... [2020-07-17 22:50:11,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:11,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:11,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:11,427 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:11,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:11,467 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:11,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:11 WrapperNode [2020-07-17 22:50:11,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:11,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:11,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:11,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:11,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:11" (1/1) ... [2020-07-17 22:50:11,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:11" (1/1) ... [2020-07-17 22:50:11,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:11" (1/1) ... [2020-07-17 22:50:11,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:11" (1/1) ... [2020-07-17 22:50:11,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:11" (1/1) ... [2020-07-17 22:50:11,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:11" (1/1) ... [2020-07-17 22:50:11,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:11" (1/1) ... [2020-07-17 22:50:11,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:11,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:11,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:11,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:11,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:11,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:11,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:11,637 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:50:11,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:11,637 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:50:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:50:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:50:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:11,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:11,957 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:11,957 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:50:11,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:11 BoogieIcfgContainer [2020-07-17 22:50:11,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:11,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:11,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:11,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:11,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:11" (1/3) ... [2020-07-17 22:50:11,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565eae0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:11, skipping insertion in model container [2020-07-17 22:50:11,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:11" (2/3) ... [2020-07-17 22:50:11,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565eae0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:11, skipping insertion in model container [2020-07-17 22:50:11,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:11" (3/3) ... [2020-07-17 22:50:11,975 INFO L109 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2020-07-17 22:50:11,986 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:11,993 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:12,006 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:12,028 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:12,028 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:12,029 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:12,029 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:12,029 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:12,029 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:12,029 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:12,029 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-17 22:50:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-17 22:50:12,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:12,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:12,053 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1474053726, now seen corresponding path program 1 times [2020-07-17 22:50:12,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:12,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8156730] [2020-07-17 22:50:12,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:12,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-17 22:50:12,197 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {26#true} {26#true} #51#return; {26#true} is VALID [2020-07-17 22:50:12,199 INFO L263 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2020-07-17 22:50:12,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2020-07-17 22:50:12,200 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #51#return; {26#true} is VALID [2020-07-17 22:50:12,201 INFO L263 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret3 := main(); {26#true} is VALID [2020-07-17 22:50:12,201 INFO L280 TraceCheckUtils]: 4: Hoare triple {26#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {26#true} is VALID [2020-07-17 22:50:12,201 INFO L280 TraceCheckUtils]: 5: Hoare triple {26#true} assume !!(~n~0 > 0);~i~0 := 0; {26#true} is VALID [2020-07-17 22:50:12,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2020-07-17 22:50:12,203 INFO L263 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {27#false} is VALID [2020-07-17 22:50:12,204 INFO L280 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2020-07-17 22:50:12,204 INFO L280 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2020-07-17 22:50:12,204 INFO L280 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2020-07-17 22:50:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:12,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8156730] [2020-07-17 22:50:12,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:12,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:50:12,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772731196] [2020-07-17 22:50:12,219 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-17 22:50:12,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:12,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:50:12,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:12,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:50:12,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:12,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:50:12,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:50:12,269 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2020-07-17 22:50:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:12,425 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2020-07-17 22:50:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:50:12,425 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-17 22:50:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2020-07-17 22:50:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2020-07-17 22:50:12,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2020-07-17 22:50:12,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:12,571 INFO L225 Difference]: With dead ends: 40 [2020-07-17 22:50:12,572 INFO L226 Difference]: Without dead ends: 19 [2020-07-17 22:50:12,576 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:50:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-17 22:50:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-17 22:50:12,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:12,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-17 22:50:12,625 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-17 22:50:12,626 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-17 22:50:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:12,631 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-17 22:50:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:50:12,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:12,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:12,633 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-17 22:50:12,633 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-17 22:50:12,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:12,637 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-17 22:50:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:50:12,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:12,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:12,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:12,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:50:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-17 22:50:12,644 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2020-07-17 22:50:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:12,645 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-17 22:50:12,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:50:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:50:12,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-17 22:50:12,646 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:12,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:12,647 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:12,647 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:12,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:12,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1462047953, now seen corresponding path program 1 times [2020-07-17 22:50:12,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:12,649 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184041337] [2020-07-17 22:50:12,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:12,719 INFO L280 TraceCheckUtils]: 0: Hoare triple {152#true} assume true; {152#true} is VALID [2020-07-17 22:50:12,720 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {152#true} {152#true} #51#return; {152#true} is VALID [2020-07-17 22:50:12,720 INFO L263 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2020-07-17 22:50:12,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {152#true} assume true; {152#true} is VALID [2020-07-17 22:50:12,721 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {152#true} {152#true} #51#return; {152#true} is VALID [2020-07-17 22:50:12,721 INFO L263 TraceCheckUtils]: 3: Hoare triple {152#true} call #t~ret3 := main(); {152#true} is VALID [2020-07-17 22:50:12,721 INFO L280 TraceCheckUtils]: 4: Hoare triple {152#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {152#true} is VALID [2020-07-17 22:50:12,723 INFO L280 TraceCheckUtils]: 5: Hoare triple {152#true} assume !!(~n~0 > 0);~i~0 := 0; {156#(<= (+ main_~i~0 1) main_~n~0)} is VALID [2020-07-17 22:50:12,726 INFO L280 TraceCheckUtils]: 6: Hoare triple {156#(<= (+ main_~i~0 1) main_~n~0)} assume !(~i~0 < ~n~0); {153#false} is VALID [2020-07-17 22:50:12,727 INFO L263 TraceCheckUtils]: 7: Hoare triple {153#false} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {153#false} is VALID [2020-07-17 22:50:12,727 INFO L280 TraceCheckUtils]: 8: Hoare triple {153#false} ~cond := #in~cond; {153#false} is VALID [2020-07-17 22:50:12,727 INFO L280 TraceCheckUtils]: 9: Hoare triple {153#false} assume 0 == ~cond; {153#false} is VALID [2020-07-17 22:50:12,728 INFO L280 TraceCheckUtils]: 10: Hoare triple {153#false} assume !false; {153#false} is VALID [2020-07-17 22:50:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:12,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184041337] [2020-07-17 22:50:12,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:12,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:50:12,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185556901] [2020-07-17 22:50:12,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-17 22:50:12,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:12,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:50:12,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:12,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:50:12,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:50:12,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:12,750 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2020-07-17 22:50:12,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:12,818 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-17 22:50:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:50:12,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-17 22:50:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-17 22:50:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:50:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-17 22:50:12,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2020-07-17 22:50:12,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:12,871 INFO L225 Difference]: With dead ends: 27 [2020-07-17 22:50:12,872 INFO L226 Difference]: Without dead ends: 20 [2020-07-17 22:50:12,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:50:12,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-17 22:50:12,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-17 22:50:12,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:12,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:12,887 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:12,887 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:12,890 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-17 22:50:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-17 22:50:12,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:12,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:12,891 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:12,891 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-17 22:50:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:12,894 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-17 22:50:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-17 22:50:12,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:12,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:12,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:12,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-17 22:50:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-07-17 22:50:12,898 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 11 [2020-07-17 22:50:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:12,899 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-17 22:50:12,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:50:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-17 22:50:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-17 22:50:12,900 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:12,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:12,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:50:12,901 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:12,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1463775831, now seen corresponding path program 1 times [2020-07-17 22:50:12,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:12,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677892997] [2020-07-17 22:50:12,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:13,053 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-17 22:50:13,053 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {268#true} {268#true} #51#return; {268#true} is VALID [2020-07-17 22:50:13,054 INFO L263 TraceCheckUtils]: 0: Hoare triple {268#true} call ULTIMATE.init(); {268#true} is VALID [2020-07-17 22:50:13,054 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#true} assume true; {268#true} is VALID [2020-07-17 22:50:13,054 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {268#true} {268#true} #51#return; {268#true} is VALID [2020-07-17 22:50:13,055 INFO L263 TraceCheckUtils]: 3: Hoare triple {268#true} call #t~ret3 := main(); {268#true} is VALID [2020-07-17 22:50:13,056 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {272#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-17 22:50:13,057 INFO L280 TraceCheckUtils]: 5: Hoare triple {272#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0);~i~0 := 0; {272#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-17 22:50:13,059 INFO L280 TraceCheckUtils]: 6: Hoare triple {272#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {273#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-17 22:50:13,060 INFO L263 TraceCheckUtils]: 7: Hoare triple {273#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {274#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:13,061 INFO L280 TraceCheckUtils]: 8: Hoare triple {274#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {275#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:13,062 INFO L280 TraceCheckUtils]: 9: Hoare triple {275#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {269#false} is VALID [2020-07-17 22:50:13,062 INFO L280 TraceCheckUtils]: 10: Hoare triple {269#false} assume !false; {269#false} is VALID [2020-07-17 22:50:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:13,064 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677892997] [2020-07-17 22:50:13,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:13,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:50:13,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021559454] [2020-07-17 22:50:13,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-17 22:50:13,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:13,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:50:13,081 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:13,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:50:13,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:13,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:50:13,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:50:13,083 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2020-07-17 22:50:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:13,309 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-17 22:50:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:50:13,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-17 22:50:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-17 22:50:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:50:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-17 22:50:13,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2020-07-17 22:50:13,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:13,362 INFO L225 Difference]: With dead ends: 28 [2020-07-17 22:50:13,362 INFO L226 Difference]: Without dead ends: 26 [2020-07-17 22:50:13,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-17 22:50:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-17 22:50:13,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:13,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-17 22:50:13,384 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-17 22:50:13,384 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-17 22:50:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:13,387 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-17 22:50:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-17 22:50:13,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:13,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:13,389 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-17 22:50:13,389 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-17 22:50:13,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:13,392 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-17 22:50:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-17 22:50:13,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:13,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:13,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:13,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-17 22:50:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-17 22:50:13,395 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 11 [2020-07-17 22:50:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:13,396 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-17 22:50:13,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:50:13,396 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-17 22:50:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:50:13,397 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:13,397 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:13,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:50:13,398 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:13,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:13,398 INFO L82 PathProgramCache]: Analyzing trace with hash -541842987, now seen corresponding path program 1 times [2020-07-17 22:50:13,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:13,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589363537] [2020-07-17 22:50:13,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:13,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-17 22:50:13,552 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {409#true} {409#true} #51#return; {409#true} is VALID [2020-07-17 22:50:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:13,564 INFO L280 TraceCheckUtils]: 0: Hoare triple {409#true} ~cond := #in~cond; {409#true} is VALID [2020-07-17 22:50:13,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {409#true} assume !(0 == ~cond); {409#true} is VALID [2020-07-17 22:50:13,565 INFO L280 TraceCheckUtils]: 2: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-17 22:50:13,566 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {409#true} {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #55#return; {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-17 22:50:13,566 INFO L263 TraceCheckUtils]: 0: Hoare triple {409#true} call ULTIMATE.init(); {409#true} is VALID [2020-07-17 22:50:13,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-17 22:50:13,567 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {409#true} {409#true} #51#return; {409#true} is VALID [2020-07-17 22:50:13,567 INFO L263 TraceCheckUtils]: 3: Hoare triple {409#true} call #t~ret3 := main(); {409#true} is VALID [2020-07-17 22:50:13,569 INFO L280 TraceCheckUtils]: 4: Hoare triple {409#true} ~i~0 := 0;~x~0 := 0;~y~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0; {413#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-17 22:50:13,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {413#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~n~0 > 0);~i~0 := 0; {413#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} is VALID [2020-07-17 22:50:13,571 INFO L280 TraceCheckUtils]: 6: Hoare triple {413#(and (<= main_~y~0 main_~x~0) (<= main_~x~0 main_~y~0))} assume !!(~i~0 < ~n~0);~x~0 := ~x~0 - ~y~0; {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-17 22:50:13,571 INFO L263 TraceCheckUtils]: 7: Hoare triple {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} call __VERIFIER_assert((if 0 == ~x~0 then 1 else 0)); {409#true} is VALID [2020-07-17 22:50:13,572 INFO L280 TraceCheckUtils]: 8: Hoare triple {409#true} ~cond := #in~cond; {409#true} is VALID [2020-07-17 22:50:13,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {409#true} assume !(0 == ~cond); {409#true} is VALID [2020-07-17 22:50:13,572 INFO L280 TraceCheckUtils]: 10: Hoare triple {409#true} assume true; {409#true} is VALID [2020-07-17 22:50:13,574 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {409#true} {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #55#return; {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-17 22:50:13,575 INFO L280 TraceCheckUtils]: 12: Hoare triple {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~y~0 := #t~nondet2;havoc #t~nondet2; {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2020-07-17 22:50:13,576 INFO L280 TraceCheckUtils]: 13: Hoare triple {414#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(0 != ~y~0);~x~0 := ~x~0 + ~y~0; {419#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} is VALID [2020-07-17 22:50:13,578 INFO L263 TraceCheckUtils]: 14: Hoare triple {419#(or (<= (+ main_~x~0 1) 0) (<= 1 main_~x~0))} call __VERIFIER_assert((if 0 != ~x~0 then 1 else 0)); {420#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:13,579 INFO L280 TraceCheckUtils]: 15: Hoare triple {420#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {421#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:13,580 INFO L280 TraceCheckUtils]: 16: Hoare triple {421#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {410#false} is VALID [2020-07-17 22:50:13,580 INFO L280 TraceCheckUtils]: 17: Hoare triple {410#false} assume !false; {410#false} is VALID [2020-07-17 22:50:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:13,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589363537] [2020-07-17 22:50:13,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:13,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:50:13,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721373694] [2020-07-17 22:50:13,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-17 22:50:13,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:13,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:50:13,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:13,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:50:13,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:13,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:50:13,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:13,610 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 7 states. [2020-07-17 22:50:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:13,913 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-07-17 22:50:13,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:50:13,914 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-07-17 22:50:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-17 22:50:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-17 22:50:13,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2020-07-17 22:50:13,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:13,965 INFO L225 Difference]: With dead ends: 32 [2020-07-17 22:50:13,965 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 22:50:13,966 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:50:13,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 22:50:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-17 22:50:14,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:14,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-17 22:50:14,011 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-17 22:50:14,012 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-17 22:50:14,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:14,014 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-17 22:50:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-17 22:50:14,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:14,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:14,015 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-17 22:50:14,016 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-17 22:50:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:14,018 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-17 22:50:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-17 22:50:14,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:14,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:14,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:14,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-17 22:50:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2020-07-17 22:50:14,021 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 18 [2020-07-17 22:50:14,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:14,022 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2020-07-17 22:50:14,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:50:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-17 22:50:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:50:14,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:14,023 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:14,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:50:14,024 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:14,024 INFO L82 PathProgramCache]: Analyzing trace with hash 814692392, now seen corresponding path program 1 times [2020-07-17 22:50:14,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:14,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987402470] [2020-07-17 22:50:14,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:14,077 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:50:14,078 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:50:14,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:50:14,103 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:50:14,104 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:14,104 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:14,104 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:50:14,104 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:50:14,104 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:50:14,104 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:50:14,104 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:14,105 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:14,105 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:14,105 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:14,107 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:50:14,107 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-17 22:50:14,107 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:50:14,108 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:50:14,115 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:14,115 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-17 22:50:14,116 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:50:14,116 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-17 22:50:14,116 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-17 22:50:14,116 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-17 22:50:14,116 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-17 22:50:14,116 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-17 22:50:14,116 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-17 22:50:14,117 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:50:14,117 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-17 22:50:14,117 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-17 22:50:14,117 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:50:14,119 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:50:14,119 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:50:14,119 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:50:14,119 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:50:14,120 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:50:14,120 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-17 22:50:14,120 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:50:14,120 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-17 22:50:14,120 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:50:14,120 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:50:14,120 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:50:14,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:50:14 BoogieIcfgContainer [2020-07-17 22:50:14,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:50:14,133 INFO L168 Benchmark]: Toolchain (without parser) took 2942.94 ms. Allocated memory was 136.8 MB in the beginning and 250.6 MB in the end (delta: 113.8 MB). Free memory was 101.4 MB in the beginning and 213.3 MB in the end (delta: -111.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:14,134 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 136.8 MB. Free memory is still 119.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:50:14,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.80 ms. Allocated memory is still 136.8 MB. Free memory was 101.0 MB in the beginning and 91.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:14,138 INFO L168 Benchmark]: Boogie Preprocessor took 107.02 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 91.0 MB in the beginning and 178.8 MB in the end (delta: -87.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:14,140 INFO L168 Benchmark]: RCFGBuilder took 384.88 ms. Allocated memory is still 200.3 MB. Free memory was 178.8 MB in the beginning and 161.0 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:14,142 INFO L168 Benchmark]: TraceAbstraction took 2160.60 ms. Allocated memory was 200.3 MB in the beginning and 250.6 MB in the end (delta: 50.3 MB). Free memory was 161.0 MB in the beginning and 213.3 MB in the end (delta: -52.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:50:14,148 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.54 ms. Allocated memory is still 136.8 MB. Free memory is still 119.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 277.80 ms. Allocated memory is still 136.8 MB. Free memory was 101.0 MB in the beginning and 91.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.02 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 91.0 MB in the beginning and 178.8 MB in the end (delta: -87.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 384.88 ms. Allocated memory is still 200.3 MB. Free memory was 178.8 MB in the beginning and 161.0 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2160.60 ms. Allocated memory was 200.3 MB in the beginning and 250.6 MB in the end (delta: 50.3 MB). Free memory was 161.0 MB in the beginning and 213.3 MB in the end (delta: -52.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int i=0, x=0, y=0; [L18] int n=__VERIFIER_nondet_int(); [L19] COND FALSE !(!(n>0)) [L20] i=0 VAL [i=0, n=1, x=0, y=0] [L20] COND TRUE i