./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_o20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_o20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78daae7f2fbb1fbd12685beb952877b8686cc8bc3d2c7fcd55d0c5d2b019aa0d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 06:27:39,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 06:27:39,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 06:27:39,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 06:27:39,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 06:27:39,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 06:27:39,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 06:27:39,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 06:27:39,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 06:27:39,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 06:27:39,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 06:27:39,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 06:27:39,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 06:27:39,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 06:27:39,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 06:27:39,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 06:27:39,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 06:27:39,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 06:27:39,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 06:27:39,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 06:27:39,187 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 06:27:39,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 06:27:39,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 06:27:39,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 06:27:39,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 06:27:39,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 06:27:39,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 06:27:39,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 06:27:39,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 06:27:39,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 06:27:39,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 06:27:39,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 06:27:39,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 06:27:39,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 06:27:39,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 06:27:39,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 06:27:39,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 06:27:39,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 06:27:39,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 06:27:39,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 06:27:39,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 06:27:39,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 06:27:39,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 06:27:39,232 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 06:27:39,233 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 06:27:39,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 06:27:39,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 06:27:39,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 06:27:39,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 06:27:39,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 06:27:39,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 06:27:39,235 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 06:27:39,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 06:27:39,236 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 06:27:39,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 06:27:39,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 06:27:39,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 06:27:39,236 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 06:27:39,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 06:27:39,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 06:27:39,237 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 06:27:39,237 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 06:27:39,238 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 06:27:39,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 06:27:39,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 06:27:39,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 06:27:39,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 06:27:39,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:27:39,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 06:27:39,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 06:27:39,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 06:27:39,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 06:27:39,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 06:27:39,239 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 06:27:39,240 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 06:27:39,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 06:27:39,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78daae7f2fbb1fbd12685beb952877b8686cc8bc3d2c7fcd55d0c5d2b019aa0d [2022-07-12 06:27:39,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 06:27:39,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 06:27:39,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 06:27:39,435 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 06:27:39,436 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 06:27:39,437 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_o20.c [2022-07-12 06:27:39,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30016e7a4/09c76da5f2024689b71a682b61f5ce25/FLAGe304daf13 [2022-07-12 06:27:39,790 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 06:27:39,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o20.c [2022-07-12 06:27:39,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30016e7a4/09c76da5f2024689b71a682b61f5ce25/FLAGe304daf13 [2022-07-12 06:27:40,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30016e7a4/09c76da5f2024689b71a682b61f5ce25 [2022-07-12 06:27:40,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 06:27:40,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 06:27:40,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 06:27:40,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 06:27:40,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 06:27:40,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:27:40" (1/1) ... [2022-07-12 06:27:40,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a9f8219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40, skipping insertion in model container [2022-07-12 06:27:40,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:27:40" (1/1) ... [2022-07-12 06:27:40,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 06:27:40,297 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 06:27:40,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o20.c[516,529] [2022-07-12 06:27:40,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:27:40,504 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 06:27:40,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_o20.c[516,529] [2022-07-12 06:27:40,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:27:40,524 INFO L208 MainTranslator]: Completed translation [2022-07-12 06:27:40,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40 WrapperNode [2022-07-12 06:27:40,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 06:27:40,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 06:27:40,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 06:27:40,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 06:27:40,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40" (1/1) ... [2022-07-12 06:27:40,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40" (1/1) ... [2022-07-12 06:27:40,547 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-07-12 06:27:40,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 06:27:40,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 06:27:40,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 06:27:40,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 06:27:40,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40" (1/1) ... [2022-07-12 06:27:40,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40" (1/1) ... [2022-07-12 06:27:40,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40" (1/1) ... [2022-07-12 06:27:40,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40" (1/1) ... [2022-07-12 06:27:40,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40" (1/1) ... [2022-07-12 06:27:40,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40" (1/1) ... [2022-07-12 06:27:40,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40" (1/1) ... [2022-07-12 06:27:40,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 06:27:40,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 06:27:40,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 06:27:40,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 06:27:40,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40" (1/1) ... [2022-07-12 06:27:40,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:27:40,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:27:40,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 06:27:40,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 06:27:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 06:27:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 06:27:40,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 06:27:40,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 06:27:40,632 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-07-12 06:27:40,632 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-07-12 06:27:40,673 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 06:27:40,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 06:27:40,763 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 06:27:40,768 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 06:27:40,768 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 06:27:40,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:27:40 BoogieIcfgContainer [2022-07-12 06:27:40,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 06:27:40,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 06:27:40,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 06:27:40,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 06:27:40,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:27:40" (1/3) ... [2022-07-12 06:27:40,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbc10f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:27:40, skipping insertion in model container [2022-07-12 06:27:40,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:27:40" (2/3) ... [2022-07-12 06:27:40,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbc10f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:27:40, skipping insertion in model container [2022-07-12 06:27:40,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:27:40" (3/3) ... [2022-07-12 06:27:40,779 INFO L111 eAbstractionObserver]: Analyzing ICFG id_o20.c [2022-07-12 06:27:40,789 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 06:27:40,789 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 06:27:40,828 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 06:27:40,833 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c12d11d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2755d471 [2022-07-12 06:27:40,833 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 06:27:40,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 06:27:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 06:27:40,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:27:40,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:27:40,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:27:40,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:27:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-07-12 06:27:40,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:27:40,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690912460] [2022-07-12 06:27:40,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:27:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:27:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:41,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 06:27:41,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:27:41,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690912460] [2022-07-12 06:27:41,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690912460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:27:41,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:27:41,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:27:41,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092526344] [2022-07-12 06:27:41,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:27:41,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:27:41,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:27:41,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:27:41,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:27:41,126 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 06:27:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:27:41,170 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-07-12 06:27:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:27:41,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-07-12 06:27:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:27:41,178 INFO L225 Difference]: With dead ends: 28 [2022-07-12 06:27:41,178 INFO L226 Difference]: Without dead ends: 15 [2022-07-12 06:27:41,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:27:41,185 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:27:41,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:27:41,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-12 06:27:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-12 06:27:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 06:27:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-12 06:27:41,213 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-07-12 06:27:41,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:27:41,214 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-12 06:27:41,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 06:27:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-07-12 06:27:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 06:27:41,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:27:41,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:27:41,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 06:27:41,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:27:41,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:27:41,217 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-07-12 06:27:41,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:27:41,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212716241] [2022-07-12 06:27:41,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:27:41,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:27:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:41,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 06:27:41,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:27:41,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212716241] [2022-07-12 06:27:41,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212716241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:27:41,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664110081] [2022-07-12 06:27:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:27:41,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:27:41,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:27:41,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:27:41,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 06:27:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:41,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 06:27:41,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:27:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 06:27:41,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:27:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 06:27:41,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664110081] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:27:41,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:27:41,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-12 06:27:41,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277003150] [2022-07-12 06:27:41,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:27:41,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 06:27:41,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:27:41,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 06:27:41,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 06:27:41,705 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 06:27:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:27:41,747 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-07-12 06:27:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 06:27:41,747 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 16 [2022-07-12 06:27:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:27:41,749 INFO L225 Difference]: With dead ends: 27 [2022-07-12 06:27:41,749 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 06:27:41,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-12 06:27:41,752 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:27:41,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:27:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 06:27:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 06:27:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-12 06:27:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-12 06:27:41,767 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2022-07-12 06:27:41,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:27:41,768 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-12 06:27:41,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 06:27:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-12 06:27:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 06:27:41,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:27:41,769 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:27:41,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 06:27:41,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:27:41,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:27:41,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:27:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 2 times [2022-07-12 06:27:41,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:27:41,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196145609] [2022-07-12 06:27:41,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:27:41,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:27:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:42,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:42,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:42,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:42,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 06:27:42,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:27:42,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196145609] [2022-07-12 06:27:42,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196145609] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:27:42,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140969780] [2022-07-12 06:27:42,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:27:42,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:27:42,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:27:42,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:27:42,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 06:27:42,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:27:42,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:27:42,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 06:27:42,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:27:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 06:27:42,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:27:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 06:27:42,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140969780] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:27:42,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:27:42,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2022-07-12 06:27:42,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565077722] [2022-07-12 06:27:42,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:27:42,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 06:27:42,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:27:42,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 06:27:42,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-07-12 06:27:42,733 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 06:27:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:27:42,880 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-07-12 06:27:42,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 06:27:42,881 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 28 [2022-07-12 06:27:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:27:42,882 INFO L225 Difference]: With dead ends: 39 [2022-07-12 06:27:42,882 INFO L226 Difference]: Without dead ends: 33 [2022-07-12 06:27:42,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-07-12 06:27:42,883 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:27:42,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:27:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-12 06:27:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-12 06:27:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 06:27:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-12 06:27:42,889 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-07-12 06:27:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:27:42,890 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-12 06:27:42,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-12 06:27:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-12 06:27:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 06:27:42,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:27:42,891 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:27:42,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 06:27:43,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 06:27:43,114 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:27:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:27:43,114 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 3 times [2022-07-12 06:27:43,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:27:43,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114187441] [2022-07-12 06:27:43,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:27:43,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:27:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:43,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:43,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:43,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:43,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:43,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:43,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:43,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-12 06:27:43,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:27:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114187441] [2022-07-12 06:27:43,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114187441] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:27:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793003549] [2022-07-12 06:27:43,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 06:27:43,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:27:43,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:27:43,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:27:43,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 06:27:43,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-12 06:27:43,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:27:43,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 06:27:43,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:27:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-12 06:27:43,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:27:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-12 06:27:44,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793003549] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:27:44,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:27:44,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2022-07-12 06:27:44,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757639237] [2022-07-12 06:27:44,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:27:44,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 06:27:44,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:27:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 06:27:44,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 06:27:44,519 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 06:27:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:27:47,091 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-07-12 06:27:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 06:27:47,092 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) Word has length 52 [2022-07-12 06:27:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:27:47,093 INFO L225 Difference]: With dead ends: 63 [2022-07-12 06:27:47,093 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 06:27:47,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=386, Invalid=1966, Unknown=0, NotChecked=0, Total=2352 [2022-07-12 06:27:47,095 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:27:47,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:27:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 06:27:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-12 06:27:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 06:27:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-07-12 06:27:47,101 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2022-07-12 06:27:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:27:47,101 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-07-12 06:27:47,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 06:27:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-07-12 06:27:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 06:27:47,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:27:47,104 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:27:47,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 06:27:47,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:27:47,320 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:27:47,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:27:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash 415287702, now seen corresponding path program 4 times [2022-07-12 06:27:47,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:27:47,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588257990] [2022-07-12 06:27:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:27:47,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:27:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:47,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:47,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:47,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:47,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:47,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:47,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:47,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:47,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:47,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:47,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:47,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:48,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:48,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:48,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:27:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:27:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-07-12 06:27:48,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:27:48,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588257990] [2022-07-12 06:27:48,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588257990] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:27:48,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366311971] [2022-07-12 06:27:48,203 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 06:27:48,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:27:48,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:27:48,211 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 06:27:48,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 06:27:48,282 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 06:27:48,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:27:48,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-12 06:27:48,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:27:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-07-12 06:27:48,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:27:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-07-12 06:27:50,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366311971] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:27:50,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:27:50,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2022-07-12 06:27:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92792035] [2022-07-12 06:27:50,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:27:50,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-12 06:27:50,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:27:50,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-12 06:27:50,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=4093, Unknown=0, NotChecked=0, Total=4692 [2022-07-12 06:27:50,568 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2022-07-12 06:28:02,773 WARN L233 SmtUtils]: Spent 7.07s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 06:28:13,381 WARN L233 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 06:28:22,876 WARN L233 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 06:28:32,183 WARN L233 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 06:29:28,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:29:28,603 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-07-12 06:29:28,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-12 06:29:28,603 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) Word has length 100 [2022-07-12 06:29:28,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:29:28,604 INFO L225 Difference]: With dead ends: 111 [2022-07-12 06:29:28,604 INFO L226 Difference]: Without dead ends: 105 [2022-07-12 06:29:28,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 96.1s TimeCoverageRelationStatistics Valid=1291, Invalid=8021, Unknown=0, NotChecked=0, Total=9312 [2022-07-12 06:29:28,608 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 06:29:28,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1014 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 06:29:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-12 06:29:28,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-12 06:29:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 71 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (34), 32 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-12 06:29:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2022-07-12 06:29:28,616 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2022-07-12 06:29:28,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:29:28,616 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2022-07-12 06:29:28,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2022-07-12 06:29:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2022-07-12 06:29:28,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 06:29:28,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:29:28,618 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:29:28,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 06:29:28,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:29:28,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:29:28,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:29:28,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1807457588, now seen corresponding path program 5 times [2022-07-12 06:29:28,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:29:28,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218839535] [2022-07-12 06:29:28,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:29:28,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:29:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:29:28,956 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 06:29:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:29:29,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 06:29:29,036 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 06:29:29,037 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 06:29:29,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 06:29:29,040 INFO L356 BasicCegarLoop]: Path program histogram: [5, 1] [2022-07-12 06:29:29,043 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 06:29:29,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:29:29 BoogieIcfgContainer [2022-07-12 06:29:29,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 06:29:29,083 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 06:29:29,084 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 06:29:29,084 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 06:29:29,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:27:40" (3/4) ... [2022-07-12 06:29:29,085 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 06:29:29,134 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 06:29:29,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 06:29:29,135 INFO L158 Benchmark]: Toolchain (without parser) took 108867.47ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 61.6MB in the beginning and 56.9MB in the end (delta: 4.7MB). Peak memory consumption was 53.0MB. Max. memory is 16.1GB. [2022-07-12 06:29:29,135 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory is still 49.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:29:29,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.07ms. Allocated memory is still 94.4MB. Free memory was 61.3MB in the beginning and 70.9MB in the end (delta: -9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 06:29:29,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.05ms. Allocated memory is still 94.4MB. Free memory was 70.9MB in the beginning and 69.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:29:29,136 INFO L158 Benchmark]: Boogie Preprocessor took 13.96ms. Allocated memory is still 94.4MB. Free memory was 69.4MB in the beginning and 68.7MB in the end (delta: 621.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:29:29,136 INFO L158 Benchmark]: RCFGBuilder took 206.36ms. Allocated memory is still 94.4MB. Free memory was 68.5MB in the beginning and 60.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 06:29:29,136 INFO L158 Benchmark]: TraceAbstraction took 108311.42ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 59.7MB in the beginning and 60.0MB in the end (delta: -328.9kB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2022-07-12 06:29:29,137 INFO L158 Benchmark]: Witness Printer took 51.38ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 56.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 06:29:29,138 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory is still 49.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.07ms. Allocated memory is still 94.4MB. Free memory was 61.3MB in the beginning and 70.9MB in the end (delta: -9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.05ms. Allocated memory is still 94.4MB. Free memory was 70.9MB in the beginning and 69.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.96ms. Allocated memory is still 94.4MB. Free memory was 69.4MB in the beginning and 68.7MB in the end (delta: 621.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 206.36ms. Allocated memory is still 94.4MB. Free memory was 68.5MB in the beginning and 60.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 108311.42ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 59.7MB in the beginning and 60.0MB in the end (delta: -328.9kB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * Witness Printer took 51.38ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 56.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] unsigned int input = __VERIFIER_nondet_uint(); [L13] CALL, EXPR id(input) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [id(input)=20, input=20] [L13] unsigned int result = id(input); [L14] COND TRUE result == 20 VAL [input=20, result=20] [L15] reach_error() VAL [input=20, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 108.2s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 100.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 1698 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1577 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1495 IncrementalHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 121 mSDtfsCounter, 1495 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 567 GetRequests, 384 SyntacticMatches, 4 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 99.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=5, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 532 NumberOfCodeBlocks, 532 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 2375 SizeOfPredicates, 4 NumberOfNonLiveVariables, 488 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 1317/2634 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! [2022-07-12 06:29:29,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE