./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_20x0-1.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/sum_20x0-1.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 0b12653f6fa3db43ddf9a1a43787bd2cd7fe91d3e4035502f1ea10705d9c83a6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 06:28:11,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 06:28:11,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 06:28:11,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 06:28:11,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 06:28:11,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 06:28:11,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 06:28:11,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 06:28:11,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 06:28:11,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 06:28:11,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 06:28:11,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 06:28:11,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 06:28:11,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 06:28:11,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 06:28:11,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 06:28:11,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 06:28:11,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 06:28:11,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 06:28:11,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 06:28:11,275 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 06:28:11,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 06:28:11,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 06:28:11,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 06:28:11,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 06:28:11,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 06:28:11,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 06:28:11,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 06:28:11,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 06:28:11,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 06:28:11,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 06:28:11,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 06:28:11,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 06:28:11,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 06:28:11,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 06:28:11,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 06:28:11,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 06:28:11,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 06:28:11,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 06:28:11,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 06:28:11,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 06:28:11,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 06:28:11,290 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:28:11,317 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 06:28:11,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 06:28:11,318 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 06:28:11,318 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 06:28:11,319 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 06:28:11,319 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 06:28:11,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 06:28:11,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 06:28:11,320 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 06:28:11,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 06:28:11,321 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 06:28:11,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 06:28:11,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 06:28:11,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 06:28:11,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 06:28:11,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 06:28:11,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 06:28:11,322 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 06:28:11,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 06:28:11,323 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 06:28:11,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 06:28:11,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 06:28:11,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 06:28:11,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 06:28:11,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:28:11,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 06:28:11,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 06:28:11,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 06:28:11,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 06:28:11,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 06:28:11,325 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 06:28:11,325 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 06:28:11,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 06:28:11,326 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 -> 0b12653f6fa3db43ddf9a1a43787bd2cd7fe91d3e4035502f1ea10705d9c83a6 [2022-07-12 06:28:11,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 06:28:11,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 06:28:11,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 06:28:11,569 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 06:28:11,570 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 06:28:11,571 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2022-07-12 06:28:11,615 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11ac025c/d66a2ecfbeca4b1daff079884254bee4/FLAGd0d2695ed [2022-07-12 06:28:12,008 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 06:28:12,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-1.c [2022-07-12 06:28:12,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11ac025c/d66a2ecfbeca4b1daff079884254bee4/FLAGd0d2695ed [2022-07-12 06:28:12,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11ac025c/d66a2ecfbeca4b1daff079884254bee4 [2022-07-12 06:28:12,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 06:28:12,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 06:28:12,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 06:28:12,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 06:28:12,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 06:28:12,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:28:12" (1/1) ... [2022-07-12 06:28:12,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ba7442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:28:12, skipping insertion in model container [2022-07-12 06:28:12,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:28:12" (1/1) ... [2022-07-12 06:28:12,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 06:28:12,047 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 06:28:12,150 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/sum_20x0-1.c[481,494] [2022-07-12 06:28:12,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:28:12,158 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 06:28:12,169 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/sum_20x0-1.c[481,494] [2022-07-12 06:28:12,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:28:12,181 INFO L208 MainTranslator]: Completed translation [2022-07-12 06:28:12,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:28:12 WrapperNode [2022-07-12 06:28:12,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 06:28:12,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 06:28:12,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 06:28:12,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 06:28:12,189 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:28:12" (1/1) ... [2022-07-12 06:28:12,194 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:28:12" (1/1) ... [2022-07-12 06:28:12,205 INFO L137 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-07-12 06:28:12,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 06:28:12,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 06:28:12,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 06:28:12,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 06:28:12,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:28:12" (1/1) ... [2022-07-12 06:28:12,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:28:12" (1/1) ... [2022-07-12 06:28:12,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:28:12" (1/1) ... [2022-07-12 06:28:12,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:28:12" (1/1) ... [2022-07-12 06:28:12,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:28:12" (1/1) ... [2022-07-12 06:28:12,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:28:12" (1/1) ... [2022-07-12 06:28:12,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:28:12" (1/1) ... [2022-07-12 06:28:12,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 06:28:12,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 06:28:12,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 06:28:12,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 06:28:12,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:28:12" (1/1) ... [2022-07-12 06:28:12,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:28:12,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:12,248 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:28:12,254 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:28:12,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 06:28:12,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 06:28:12,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 06:28:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2022-07-12 06:28:12,310 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2022-07-12 06:28:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 06:28:12,354 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 06:28:12,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 06:28:12,417 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 06:28:12,422 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 06:28:12,422 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 06:28:12,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:28:12 BoogieIcfgContainer [2022-07-12 06:28:12,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 06:28:12,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 06:28:12,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 06:28:12,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 06:28:12,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:28:12" (1/3) ... [2022-07-12 06:28:12,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d8bb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:28:12, skipping insertion in model container [2022-07-12 06:28:12,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:28:12" (2/3) ... [2022-07-12 06:28:12,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d8bb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:28:12, skipping insertion in model container [2022-07-12 06:28:12,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:28:12" (3/3) ... [2022-07-12 06:28:12,430 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_20x0-1.c [2022-07-12 06:28:12,441 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 06:28:12,442 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 06:28:12,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 06:28:12,485 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@555ce74b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b5a0f4c [2022-07-12 06:28:12,485 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 06:28:12,492 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:28:12,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 06:28:12,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:12,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:12,498 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:12,510 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-07-12 06:28:12,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:12,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599222691] [2022-07-12 06:28:12,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:12,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:12,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:12,783 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:28:12,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:12,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599222691] [2022-07-12 06:28:12,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599222691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:28:12,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:28:12,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:28:12,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487084764] [2022-07-12 06:28:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:28:12,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:28:12,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:12,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:28:12,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:28:12,824 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, 4 states have (on average 2.0) internal successors, (8), 5 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:28:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:12,899 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-12 06:28:12,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:28:12,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:28:12,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:12,908 INFO L225 Difference]: With dead ends: 25 [2022-07-12 06:28:12,908 INFO L226 Difference]: Without dead ends: 15 [2022-07-12 06:28:12,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:28:12,919 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:12,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:28:12,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-12 06:28:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-12 06:28:12,964 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:28:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-07-12 06:28:12,966 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-07-12 06:28:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:12,967 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-07-12 06:28:12,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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:28:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-07-12 06:28:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 06:28:12,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:12,971 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:12,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 06:28:12,972 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:12,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:12,974 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-07-12 06:28:12,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:12,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734090218] [2022-07-12 06:28:12,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:12,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:13,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:13,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:13,123 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:28:13,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:13,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734090218] [2022-07-12 06:28:13,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734090218] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:13,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906860032] [2022-07-12 06:28:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:13,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:13,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:13,132 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:28:13,134 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:28:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:13,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 06:28:13,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:13,276 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:28:13,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 06:28:13,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906860032] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:13,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:13,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2022-07-12 06:28:13,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816473006] [2022-07-12 06:28:13,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:13,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 06:28:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:13,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 06:28:13,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 06:28:13,422 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 06:28:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:13,461 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-07-12 06:28:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 06:28:13,461 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 16 [2022-07-12 06:28:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:13,462 INFO L225 Difference]: With dead ends: 22 [2022-07-12 06:28:13,462 INFO L226 Difference]: Without dead ends: 18 [2022-07-12 06:28:13,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:28:13,464 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:13,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 25 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:28:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-12 06:28:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-12 06:28:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 06:28:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-07-12 06:28:13,469 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-07-12 06:28:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:13,469 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-07-12 06:28:13,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 06:28:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-07-12 06:28:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 06:28:13,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:13,470 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:13,496 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:28:13,693 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:28:13,693 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:13,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2022-07-12 06:28:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:13,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764095890] [2022-07-12 06:28:13,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:13,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:13,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:13,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 06:28:13,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:13,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764095890] [2022-07-12 06:28:13,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764095890] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:13,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130839492] [2022-07-12 06:28:13,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:28:13,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:13,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:13,826 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:28:13,832 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:28:13,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:28:13,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:28:13,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 06:28:13,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 06:28:13,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:14,193 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 06:28:14,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130839492] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:14,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:14,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2022-07-12 06:28:14,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767158654] [2022-07-12 06:28:14,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:14,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 06:28:14,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:14,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 06:28:14,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:28:14,196 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-12 06:28:14,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:14,241 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-12 06:28:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 06:28:14,242 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 22 [2022-07-12 06:28:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:14,242 INFO L225 Difference]: With dead ends: 25 [2022-07-12 06:28:14,243 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 06:28:14,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-12 06:28:14,244 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:14,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 35 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:28:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 06:28:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 06:28:14,249 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:28:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-12 06:28:14,250 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-07-12 06:28:14,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:14,250 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-12 06:28:14,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-12 06:28:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-12 06:28:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 06:28:14,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:14,251 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:14,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 06:28:14,459 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:28:14,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:14,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:14,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2022-07-12 06:28:14,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:14,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634362268] [2022-07-12 06:28:14,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:14,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:14,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:14,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:14,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:14,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:14,579 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:28:14,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:14,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634362268] [2022-07-12 06:28:14,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634362268] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:14,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878585115] [2022-07-12 06:28:14,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 06:28:14,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:14,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:14,582 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:28:14,599 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:28:14,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 06:28:14,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:28:14,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 06:28:14,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:14,669 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:28:14,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 06:28:15,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878585115] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:15,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:15,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2022-07-12 06:28:15,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118752133] [2022-07-12 06:28:15,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:15,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 06:28:15,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:15,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 06:28:15,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-12 06:28:15,091 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-12 06:28:15,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:15,155 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-07-12 06:28:15,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 06:28:15,155 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 28 [2022-07-12 06:28:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:15,156 INFO L225 Difference]: With dead ends: 28 [2022-07-12 06:28:15,156 INFO L226 Difference]: Without dead ends: 24 [2022-07-12 06:28:15,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-07-12 06:28:15,158 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:15,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 41 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:28:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-12 06:28:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-12 06:28:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 06:28:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-12 06:28:15,163 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 28 [2022-07-12 06:28:15,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:15,163 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-12 06:28:15,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-12 06:28:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-12 06:28:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 06:28:15,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:15,165 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:15,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 06:28:15,379 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:28:15,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 371264716, now seen corresponding path program 4 times [2022-07-12 06:28:15,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:15,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308115324] [2022-07-12 06:28:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:15,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:15,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 06:28:15,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:15,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308115324] [2022-07-12 06:28:15,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308115324] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:15,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218228405] [2022-07-12 06:28:15,497 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 06:28:15,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:15,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:15,508 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:28:15,509 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:28:15,558 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 06:28:15,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:28:15,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 06:28:15,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:15,612 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-12 06:28:15,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 06:28:16,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218228405] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:16,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:16,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2022-07-12 06:28:16,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413729656] [2022-07-12 06:28:16,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:16,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 06:28:16,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:16,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 06:28:16,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-12 06:28:16,234 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-12 06:28:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:16,300 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-07-12 06:28:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:28:16,301 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) Word has length 34 [2022-07-12 06:28:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:16,302 INFO L225 Difference]: With dead ends: 31 [2022-07-12 06:28:16,302 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 06:28:16,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-07-12 06:28:16,303 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:16,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 47 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:28:16,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 06:28:16,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-12 06:28:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 06:28:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-07-12 06:28:16,308 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 34 [2022-07-12 06:28:16,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:16,309 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-07-12 06:28:16,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-12 06:28:16,309 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-07-12 06:28:16,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 06:28:16,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:16,310 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:16,327 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:28:16,515 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:28:16,516 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:16,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:16,516 INFO L85 PathProgramCache]: Analyzing trace with hash -886339242, now seen corresponding path program 5 times [2022-07-12 06:28:16,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:16,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017577422] [2022-07-12 06:28:16,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:16,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:16,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:16,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:16,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:16,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:16,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:16,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 06:28:16,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:16,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017577422] [2022-07-12 06:28:16,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017577422] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:16,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752482358] [2022-07-12 06:28:16,673 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 06:28:16,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:16,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:16,674 INFO L229 MonitoredProcess]: Starting monitored process 6 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:28:16,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 06:28:16,727 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-12 06:28:16,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:28:16,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 06:28:16,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 06:28:16,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 06:28:17,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752482358] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:17,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:17,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2022-07-12 06:28:17,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018736382] [2022-07-12 06:28:17,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:17,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 06:28:17,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:17,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 06:28:17,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-07-12 06:28:17,643 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2022-07-12 06:28:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:17,720 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-12 06:28:17,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:28:17,720 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) Word has length 40 [2022-07-12 06:28:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:17,721 INFO L225 Difference]: With dead ends: 34 [2022-07-12 06:28:17,721 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 06:28:17,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2022-07-12 06:28:17,723 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:17,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 57 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:28:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 06:28:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-12 06:28:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 06:28:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-12 06:28:17,727 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 40 [2022-07-12 06:28:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:17,728 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-12 06:28:17,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2022-07-12 06:28:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-12 06:28:17,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 06:28:17,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:17,729 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:17,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 06:28:17,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:17,951 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:17,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash -918712436, now seen corresponding path program 6 times [2022-07-12 06:28:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:17,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146760100] [2022-07-12 06:28:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:17,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:18,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:18,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:18,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:18,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:18,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:18,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:18,116 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-12 06:28:18,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:18,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146760100] [2022-07-12 06:28:18,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146760100] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:18,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554176605] [2022-07-12 06:28:18,117 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 06:28:18,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:18,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:18,118 INFO L229 MonitoredProcess]: Starting monitored process 7 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:28:18,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 06:28:18,198 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-07-12 06:28:18,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:28:18,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 06:28:18,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-12 06:28:18,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 06:28:19,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554176605] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:19,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:19,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2022-07-12 06:28:19,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648685039] [2022-07-12 06:28:19,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:19,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 06:28:19,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:19,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 06:28:19,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-07-12 06:28:19,430 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 06:28:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:19,545 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-07-12 06:28:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 06:28:19,545 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) Word has length 46 [2022-07-12 06:28:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:19,551 INFO L225 Difference]: With dead ends: 37 [2022-07-12 06:28:19,551 INFO L226 Difference]: Without dead ends: 33 [2022-07-12 06:28:19,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=474, Unknown=0, NotChecked=0, Total=702 [2022-07-12 06:28:19,552 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 97 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:19,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 67 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:28:19,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-12 06:28:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-12 06:28:19,564 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:28:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-12 06:28:19,565 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 46 [2022-07-12 06:28:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:19,565 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-12 06:28:19,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-12 06:28:19,565 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-12 06:28:19,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 06:28:19,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:19,567 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:19,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 06:28:19,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:19,776 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:19,776 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 7 times [2022-07-12 06:28:19,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:19,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804029714] [2022-07-12 06:28:19,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:19,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:19,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:19,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:19,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:19,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:19,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:19,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:19,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:19,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:19,985 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:28:19,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:19,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804029714] [2022-07-12 06:28:19,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804029714] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:19,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909265618] [2022-07-12 06:28:19,986 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 06:28:19,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:19,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:19,988 INFO L229 MonitoredProcess]: Starting monitored process 8 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:28:20,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 06:28:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:20,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 06:28:20,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:20,142 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:28:20,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 06:28:21,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909265618] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:21,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:21,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 22 [2022-07-12 06:28:21,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875500787] [2022-07-12 06:28:21,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:21,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 06:28:21,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:21,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 06:28:21,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-07-12 06:28:21,791 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-12 06:28:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:21,904 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-07-12 06:28:21,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 06:28:21,904 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 52 [2022-07-12 06:28:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:21,905 INFO L225 Difference]: With dead ends: 40 [2022-07-12 06:28:21,905 INFO L226 Difference]: Without dead ends: 36 [2022-07-12 06:28:21,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=283, Invalid=587, Unknown=0, NotChecked=0, Total=870 [2022-07-12 06:28:21,906 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 150 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:21,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 61 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:28:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-12 06:28:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-12 06:28:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 06:28:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-07-12 06:28:21,911 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 52 [2022-07-12 06:28:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:21,911 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-07-12 06:28:21,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-12 06:28:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-07-12 06:28:21,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 06:28:21,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:21,927 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:21,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 06:28:22,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:22,151 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:22,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:22,151 INFO L85 PathProgramCache]: Analyzing trace with hash -960511412, now seen corresponding path program 8 times [2022-07-12 06:28:22,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:22,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138868775] [2022-07-12 06:28:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:22,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:22,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:22,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:22,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:22,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:22,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-12 06:28:22,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:22,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138868775] [2022-07-12 06:28:22,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138868775] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:22,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673357901] [2022-07-12 06:28:22,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:28:22,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:22,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:22,342 INFO L229 MonitoredProcess]: Starting monitored process 9 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:28:22,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 06:28:22,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:28:22,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:28:22,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 06:28:22,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-12 06:28:22,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-12 06:28:24,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673357901] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:24,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:24,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2022-07-12 06:28:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808512440] [2022-07-12 06:28:24,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:24,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 06:28:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:24,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 06:28:24,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2022-07-12 06:28:24,528 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2022-07-12 06:28:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:24,631 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-12 06:28:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 06:28:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) Word has length 58 [2022-07-12 06:28:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:24,633 INFO L225 Difference]: With dead ends: 43 [2022-07-12 06:28:24,633 INFO L226 Difference]: Without dead ends: 39 [2022-07-12 06:28:24,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=344, Invalid=712, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 06:28:24,634 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:24,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 79 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:28:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-12 06:28:24,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-12 06:28:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 06:28:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-07-12 06:28:24,639 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 58 [2022-07-12 06:28:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:24,640 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-07-12 06:28:24,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2022-07-12 06:28:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-07-12 06:28:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 06:28:24,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:24,641 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:24,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 06:28:24,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-12 06:28:24,863 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:24,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:24,864 INFO L85 PathProgramCache]: Analyzing trace with hash -366706730, now seen corresponding path program 9 times [2022-07-12 06:28:24,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:24,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435868249] [2022-07-12 06:28:24,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:24,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:24,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:24,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:24,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:24,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:25,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:25,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:25,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:25,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:25,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-12 06:28:25,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:25,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435868249] [2022-07-12 06:28:25,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435868249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:25,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917029057] [2022-07-12 06:28:25,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 06:28:25,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:25,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:25,107 INFO L229 MonitoredProcess]: Starting monitored process 10 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:28:25,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 06:28:25,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-07-12 06:28:25,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:28:25,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 06:28:25,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-12 06:28:25,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 06:28:28,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917029057] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:28,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:28,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 26 [2022-07-12 06:28:28,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936367000] [2022-07-12 06:28:28,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:28,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 06:28:28,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:28,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 06:28:28,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2022-07-12 06:28:28,170 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 26 states, 24 states have (on average 2.125) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2022-07-12 06:28:28,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:28,296 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-07-12 06:28:28,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 06:28:28,297 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.125) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) Word has length 64 [2022-07-12 06:28:28,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:28,298 INFO L225 Difference]: With dead ends: 46 [2022-07-12 06:28:28,298 INFO L226 Difference]: Without dead ends: 42 [2022-07-12 06:28:28,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=411, Invalid=849, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 06:28:28,299 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 174 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:28,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 89 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:28:28,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-12 06:28:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-12 06:28:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 06:28:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-07-12 06:28:28,304 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 64 [2022-07-12 06:28:28,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:28,304 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-07-12 06:28:28,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.125) internal successors, (51), 26 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2022-07-12 06:28:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-07-12 06:28:28,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 06:28:28,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:28,305 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:28,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 06:28:28,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 06:28:28,519 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:28,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:28,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1719425780, now seen corresponding path program 10 times [2022-07-12 06:28:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:28,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189508801] [2022-07-12 06:28:28,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:28,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:28,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:28,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:28,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:28,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:28,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:28,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:28,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:28,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-07-12 06:28:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:28,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189508801] [2022-07-12 06:28:28,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189508801] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:28,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871158693] [2022-07-12 06:28:28,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 06:28:28,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:28,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:28,793 INFO L229 MonitoredProcess]: Starting monitored process 11 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:28:28,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 06:28:29,010 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 06:28:29,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:28:29,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 06:28:29,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2022-07-12 06:28:29,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-12 06:28:32,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871158693] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:32,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:32,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 28 [2022-07-12 06:28:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339080034] [2022-07-12 06:28:32,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:32,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 06:28:32,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:32,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 06:28:32,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2022-07-12 06:28:32,478 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 28 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2022-07-12 06:28:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:32,621 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-07-12 06:28:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 06:28:32,623 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) Word has length 70 [2022-07-12 06:28:32,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:32,625 INFO L225 Difference]: With dead ends: 49 [2022-07-12 06:28:32,625 INFO L226 Difference]: Without dead ends: 45 [2022-07-12 06:28:32,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=484, Invalid=998, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 06:28:32,626 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 78 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:32,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 91 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:28:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-12 06:28:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-07-12 06:28:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 06:28:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-07-12 06:28:32,634 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 70 [2022-07-12 06:28:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:32,635 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-07-12 06:28:32,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 28 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2022-07-12 06:28:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-07-12 06:28:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 06:28:32,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:32,637 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:32,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 06:28:32,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 06:28:32,843 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:32,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:32,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1354232598, now seen corresponding path program 11 times [2022-07-12 06:28:32,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:32,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490313398] [2022-07-12 06:28:32,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:32,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:32,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:32,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:32,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:32,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:33,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:33,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:33,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:33,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:33,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:33,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-07-12 06:28:33,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:33,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490313398] [2022-07-12 06:28:33,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490313398] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:33,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736197878] [2022-07-12 06:28:33,146 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 06:28:33,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:33,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:33,148 INFO L229 MonitoredProcess]: Starting monitored process 12 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:28:33,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 06:28:33,447 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-07-12 06:28:33,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:28:33,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 06:28:33,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-07-12 06:28:33,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 06:28:37,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736197878] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:37,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:37,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 30 [2022-07-12 06:28:37,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738096912] [2022-07-12 06:28:37,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:37,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 06:28:37,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:37,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 06:28:37,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2022-07-12 06:28:37,833 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 30 states, 28 states have (on average 2.107142857142857) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2022-07-12 06:28:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:37,974 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-12 06:28:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 06:28:37,975 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.107142857142857) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) Word has length 76 [2022-07-12 06:28:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:37,976 INFO L225 Difference]: With dead ends: 52 [2022-07-12 06:28:37,976 INFO L226 Difference]: Without dead ends: 48 [2022-07-12 06:28:37,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=563, Invalid=1159, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 06:28:37,977 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 111 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:37,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 89 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:28:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-12 06:28:37,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-07-12 06:28:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 33 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 06:28:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2022-07-12 06:28:37,982 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 76 [2022-07-12 06:28:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:37,982 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2022-07-12 06:28:37,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.107142857142857) internal successors, (59), 30 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2022-07-12 06:28:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2022-07-12 06:28:37,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 06:28:37,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:37,984 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:38,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 06:28:38,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 06:28:38,196 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1734686668, now seen corresponding path program 12 times [2022-07-12 06:28:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:38,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830747437] [2022-07-12 06:28:38,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:38,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-07-12 06:28:38,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:38,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830747437] [2022-07-12 06:28:38,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830747437] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:38,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734880645] [2022-07-12 06:28:38,521 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 06:28:38,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:38,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:38,523 INFO L229 MonitoredProcess]: Starting monitored process 13 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:28:38,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 06:28:38,898 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-07-12 06:28:38,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:28:38,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 06:28:38,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-07-12 06:28:38,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-12 06:28:44,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734880645] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:44,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:44,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 32 [2022-07-12 06:28:44,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676633822] [2022-07-12 06:28:44,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:44,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 06:28:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 06:28:44,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2022-07-12 06:28:44,408 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 32 states, 30 states have (on average 2.1) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2022-07-12 06:28:44,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:44,580 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2022-07-12 06:28:44,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 06:28:44,581 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.1) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) Word has length 82 [2022-07-12 06:28:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:44,582 INFO L225 Difference]: With dead ends: 55 [2022-07-12 06:28:44,582 INFO L226 Difference]: Without dead ends: 51 [2022-07-12 06:28:44,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=648, Invalid=1332, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 06:28:44,583 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 198 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:44,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 91 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:28:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-12 06:28:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-12 06:28:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 06:28:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-07-12 06:28:44,588 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 82 [2022-07-12 06:28:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:44,589 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-07-12 06:28:44,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.1) internal successors, (63), 32 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2022-07-12 06:28:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-07-12 06:28:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 06:28:44,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:44,590 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:44,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 06:28:44,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 06:28:44,800 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:44,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1433749930, now seen corresponding path program 13 times [2022-07-12 06:28:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:44,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858164892] [2022-07-12 06:28:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:44,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:44,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:44,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:44,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:44,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:44,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:44,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:45,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:45,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:45,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:45,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:45,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:45,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:45,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-07-12 06:28:45,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:45,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858164892] [2022-07-12 06:28:45,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858164892] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:45,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331902913] [2022-07-12 06:28:45,125 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 06:28:45,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:45,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:45,127 INFO L229 MonitoredProcess]: Starting monitored process 14 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:28:45,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 06:28:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:45,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 06:28:45,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2022-07-12 06:28:45,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:28:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 06:28:52,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331902913] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:28:52,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:28:52,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 34 [2022-07-12 06:28:52,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268853746] [2022-07-12 06:28:52,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:28:52,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 06:28:52,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:28:52,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 06:28:52,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 06:28:52,356 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 34 states, 32 states have (on average 2.09375) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) [2022-07-12 06:28:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:28:52,577 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-07-12 06:28:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 06:28:52,578 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.09375) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) Word has length 88 [2022-07-12 06:28:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:28:52,578 INFO L225 Difference]: With dead ends: 58 [2022-07-12 06:28:52,579 INFO L226 Difference]: Without dead ends: 54 [2022-07-12 06:28:52,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=739, Invalid=1517, Unknown=0, NotChecked=0, Total=2256 [2022-07-12 06:28:52,580 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 384 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:28:52,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 105 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:28:52,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-12 06:28:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-12 06:28:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 06:28:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-07-12 06:28:52,584 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 88 [2022-07-12 06:28:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:28:52,584 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-07-12 06:28:52,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.09375) internal successors, (67), 34 states have internal predecessors, (67), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) [2022-07-12 06:28:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-07-12 06:28:52,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 06:28:52,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:28:52,586 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:28:52,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-12 06:28:52,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 06:28:52,799 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:28:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:28:52,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1321174388, now seen corresponding path program 14 times [2022-07-12 06:28:52,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:28:52,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498949783] [2022-07-12 06:28:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:28:52,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:28:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:52,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:52,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:52,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:52,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:52,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:52,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:53,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:53,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:53,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:53,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:53,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:53,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:53,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:53,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:53,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:28:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:28:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-12 06:28:53,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:28:53,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498949783] [2022-07-12 06:28:53,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498949783] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:28:53,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523245883] [2022-07-12 06:28:53,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 06:28:53,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:28:53,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:28:53,194 INFO L229 MonitoredProcess]: Starting monitored process 15 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:28:53,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 06:28:53,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 06:28:53,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:28:53,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 06:28:53,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:28:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2022-07-12 06:28:53,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:29:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-12 06:29:02,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523245883] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:29:02,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:29:02,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 36 [2022-07-12 06:29:02,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442936975] [2022-07-12 06:29:02,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:29:02,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 06:29:02,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:29:02,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 06:29:02,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=934, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 06:29:02,090 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 36 states, 34 states have (on average 2.088235294117647) internal successors, (71), 36 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (44), 15 states have call predecessors, (44), 18 states have call successors, (44) [2022-07-12 06:29:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:29:02,280 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-07-12 06:29:02,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 06:29:02,281 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.088235294117647) internal successors, (71), 36 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (44), 15 states have call predecessors, (44), 18 states have call successors, (44) Word has length 94 [2022-07-12 06:29:02,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:29:02,282 INFO L225 Difference]: With dead ends: 61 [2022-07-12 06:29:02,282 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 06:29:02,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=836, Invalid=1714, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 06:29:02,287 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 166 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:29:02,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 115 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:29:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 06:29:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-12 06:29:02,303 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:29:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-07-12 06:29:02,304 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 94 [2022-07-12 06:29:02,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:29:02,305 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-07-12 06:29:02,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.088235294117647) internal successors, (71), 36 states have internal predecessors, (71), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (44), 15 states have call predecessors, (44), 18 states have call successors, (44) [2022-07-12 06:29:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-07-12 06:29:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 06:29:02,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:29:02,307 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:29:02,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 06:29:02,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:29:02,511 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:29:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:29:02,512 INFO L85 PathProgramCache]: Analyzing trace with hash 415287702, now seen corresponding path program 15 times [2022-07-12 06:29:02,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:29:02,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167189927] [2022-07-12 06:29:02,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:29:02,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:29:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:02,926 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:29:02,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:29:02,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167189927] [2022-07-12 06:29:02,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167189927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:29:02,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915912753] [2022-07-12 06:29:02,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 06:29:02,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:29:02,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:29:02,929 INFO L229 MonitoredProcess]: Starting monitored process 16 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:29:02,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 06:29:03,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-07-12 06:29:03,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:29:03,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 06:29:03,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:29:03,763 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:29:03,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:29:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-12 06:29:13,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915912753] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:29:13,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:29:13,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 35] total 38 [2022-07-12 06:29:13,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893506457] [2022-07-12 06:29:13,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:29:13,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-12 06:29:13,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:29:13,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-12 06:29:13,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 06:29:13,857 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 38 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (47), 16 states have call predecessors, (47), 19 states have call successors, (47) [2022-07-12 06:29:14,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:29:14,081 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2022-07-12 06:29:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 06:29:14,081 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (47), 16 states have call predecessors, (47), 19 states have call successors, (47) Word has length 100 [2022-07-12 06:29:14,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:29:14,082 INFO L225 Difference]: With dead ends: 64 [2022-07-12 06:29:14,082 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 06:29:14,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=939, Invalid=1923, Unknown=0, NotChecked=0, Total=2862 [2022-07-12 06:29:14,083 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 204 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:29:14,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 125 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:29:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 06:29:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-07-12 06:29:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.025) internal successors, (41), 41 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 17 states have return successors, (18), 17 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 06:29:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-12 06:29:14,088 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 100 [2022-07-12 06:29:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:29:14,088 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-12 06:29:14,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 38 states have internal predecessors, (75), 19 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (47), 16 states have call predecessors, (47), 19 states have call successors, (47) [2022-07-12 06:29:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-12 06:29:14,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 06:29:14,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:29:14,091 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:29:14,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-12 06:29:14,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 06:29:14,307 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:29:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:29:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash 317812044, now seen corresponding path program 16 times [2022-07-12 06:29:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:29:14,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48489862] [2022-07-12 06:29:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:29:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:29:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-07-12 06:29:14,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:29:14,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48489862] [2022-07-12 06:29:14,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48489862] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:29:14,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644667331] [2022-07-12 06:29:14,742 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 06:29:14,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:29:14,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:29:14,743 INFO L229 MonitoredProcess]: Starting monitored process 17 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:29:14,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 06:29:15,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 06:29:15,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:29:15,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 06:29:15,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:29:15,712 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-07-12 06:29:15,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:29:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 06:29:27,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644667331] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:29:27,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:29:27,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 37] total 40 [2022-07-12 06:29:27,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268430217] [2022-07-12 06:29:27,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:29:27,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 06:29:27,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:29:27,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 06:29:27,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=1158, Unknown=0, NotChecked=0, Total=1560 [2022-07-12 06:29:27,883 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 40 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 40 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 17 states have return successors, (50), 17 states have call predecessors, (50), 20 states have call successors, (50) [2022-07-12 06:29:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:29:28,157 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2022-07-12 06:29:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 06:29:28,157 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 40 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 17 states have return successors, (50), 17 states have call predecessors, (50), 20 states have call successors, (50) Word has length 106 [2022-07-12 06:29:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:29:28,158 INFO L225 Difference]: With dead ends: 67 [2022-07-12 06:29:28,158 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 06:29:28,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1048, Invalid=2144, Unknown=0, NotChecked=0, Total=3192 [2022-07-12 06:29:28,160 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 396 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:29:28,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 123 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:29:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 06:29:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-12 06:29:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 18 states have return successors, (19), 18 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 06:29:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-12 06:29:28,169 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 106 [2022-07-12 06:29:28,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:29:28,172 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-12 06:29:28,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 40 states have internal predecessors, (79), 20 states have call successors, (20), 1 states have call predecessors, (20), 17 states have return successors, (50), 17 states have call predecessors, (50), 20 states have call successors, (50) [2022-07-12 06:29:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-12 06:29:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 06:29:28,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:29:28,175 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:29:28,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 06:29:28,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 06:29:28,391 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:29:28,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:29:28,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2122437418, now seen corresponding path program 17 times [2022-07-12 06:29:28,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:29:28,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672644741] [2022-07-12 06:29:28,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:29:28,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:29:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-12 06:29:28,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:29:28,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672644741] [2022-07-12 06:29:28,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672644741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:29:28,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560362381] [2022-07-12 06:29:28,897 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 06:29:28,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:29:28,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:29:28,899 INFO L229 MonitoredProcess]: Starting monitored process 18 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:29:28,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 06:29:29,976 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-12 06:29:29,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:29:29,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 06:29:29,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:29:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-07-12 06:29:30,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:29:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-12 06:29:44,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560362381] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:29:44,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:29:44,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 39] total 42 [2022-07-12 06:29:44,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381055387] [2022-07-12 06:29:44,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:29:44,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 06:29:44,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:29:44,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 06:29:44,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=1279, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 06:29:44,594 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 42 states, 40 states have (on average 2.075) internal successors, (83), 42 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 18 states have return successors, (53), 18 states have call predecessors, (53), 21 states have call successors, (53) [2022-07-12 06:29:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:29:44,825 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-07-12 06:29:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 06:29:44,826 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 2.075) internal successors, (83), 42 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 18 states have return successors, (53), 18 states have call predecessors, (53), 21 states have call successors, (53) Word has length 112 [2022-07-12 06:29:44,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:29:44,827 INFO L225 Difference]: With dead ends: 70 [2022-07-12 06:29:44,827 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 06:29:44,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1163, Invalid=2377, Unknown=0, NotChecked=0, Total=3540 [2022-07-12 06:29:44,829 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 157 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:29:44,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 137 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:29:44,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 06:29:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-07-12 06:29:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 45 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 19 states have return successors, (20), 19 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 06:29:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2022-07-12 06:29:44,832 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 112 [2022-07-12 06:29:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:29:44,832 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2022-07-12 06:29:44,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 2.075) internal successors, (83), 42 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 18 states have return successors, (53), 18 states have call predecessors, (53), 21 states have call successors, (53) [2022-07-12 06:29:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2022-07-12 06:29:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 06:29:44,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:29:44,833 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:29:44,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 06:29:45,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 06:29:45,034 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:29:45,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:29:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash 55840780, now seen corresponding path program 18 times [2022-07-12 06:29:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:29:45,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581756580] [2022-07-12 06:29:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:29:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:29:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:29:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:29:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2022-07-12 06:29:45,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:29:45,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581756580] [2022-07-12 06:29:45,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581756580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:29:45,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185353247] [2022-07-12 06:29:45,560 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 06:29:45,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:29:45,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:29:45,562 INFO L229 MonitoredProcess]: Starting monitored process 19 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:29:45,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 06:29:47,000 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-07-12 06:29:47,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 06:29:47,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 06:29:47,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:29:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2022-07-12 06:29:47,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:30:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-07-12 06:30:04,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185353247] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:30:04,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:30:04,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 41] total 44 [2022-07-12 06:30:04,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778472923] [2022-07-12 06:30:04,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:30:04,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-12 06:30:04,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:30:04,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-12 06:30:04,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=1406, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 06:30:04,407 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 44 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 44 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 19 states have return successors, (56), 19 states have call predecessors, (56), 22 states have call successors, (56) [2022-07-12 06:30:04,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:30:04,627 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-07-12 06:30:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 06:30:04,628 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 44 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 19 states have return successors, (56), 19 states have call predecessors, (56), 22 states have call successors, (56) Word has length 118 [2022-07-12 06:30:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:30:04,628 INFO L225 Difference]: With dead ends: 73 [2022-07-12 06:30:04,629 INFO L226 Difference]: Without dead ends: 69 [2022-07-12 06:30:04,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1284, Invalid=2622, Unknown=0, NotChecked=0, Total=3906 [2022-07-12 06:30:04,630 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 86 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:30:04,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 143 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:30:04,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-12 06:30:04,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-12 06:30:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 47 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 20 states have return successors, (21), 20 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 06:30:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-07-12 06:30:04,634 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 118 [2022-07-12 06:30:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:30:04,634 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-07-12 06:30:04,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 44 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 19 states have return successors, (56), 19 states have call predecessors, (56), 22 states have call successors, (56) [2022-07-12 06:30:04,635 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-07-12 06:30:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 06:30:04,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:30:04,636 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:30:04,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 06:30:04,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:04,852 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:30:04,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:30:04,852 INFO L85 PathProgramCache]: Analyzing trace with hash -806952938, now seen corresponding path program 19 times [2022-07-12 06:30:04,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:30:04,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031686672] [2022-07-12 06:30:04,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:04,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:30:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:04,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:04,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 06:30:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-07-12 06:30:05,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:30:05,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031686672] [2022-07-12 06:30:05,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031686672] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:30:05,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996105784] [2022-07-12 06:30:05,613 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 06:30:05,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:05,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:30:05,616 INFO L229 MonitoredProcess]: Starting monitored process 20 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:30:05,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 06:30:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:30:07,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 06:30:07,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:30:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-07-12 06:30:07,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:30:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-12 06:30:27,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996105784] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:30:27,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:30:27,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 43] total 45 [2022-07-12 06:30:27,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388701205] [2022-07-12 06:30:27,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:30:27,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-12 06:30:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:30:27,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-12 06:30:27,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 06:30:27,865 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 45 states have internal predecessors, (90), 22 states have call successors, (22), 1 states have call predecessors, (22), 20 states have return successors, (58), 20 states have call predecessors, (58), 22 states have call successors, (58) [2022-07-12 06:30:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:30:28,152 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-07-12 06:30:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 06:30:28,152 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 45 states have internal predecessors, (90), 22 states have call successors, (22), 1 states have call predecessors, (22), 20 states have return successors, (58), 20 states have call predecessors, (58), 22 states have call successors, (58) Word has length 124 [2022-07-12 06:30:28,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:30:28,153 INFO L225 Difference]: With dead ends: 76 [2022-07-12 06:30:28,153 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 06:30:28,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1408, Invalid=2752, Unknown=0, NotChecked=0, Total=4160 [2022-07-12 06:30:28,155 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 419 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:30:28,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 133 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:30:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 06:30:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-12 06:30:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 49 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 21 states have return successors, (22), 21 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 06:30:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-12 06:30:28,159 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 124 [2022-07-12 06:30:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:30:28,159 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-12 06:30:28,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 45 states have internal predecessors, (90), 22 states have call successors, (22), 1 states have call predecessors, (22), 20 states have return successors, (58), 20 states have call predecessors, (58), 22 states have call successors, (58) [2022-07-12 06:30:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-12 06:30:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 06:30:28,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:30:28,161 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 06:30:28,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-12 06:30:28,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:30:28,362 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:30:28,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:30:28,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1807457588, now seen corresponding path program 20 times [2022-07-12 06:30:28,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:30:28,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144925306] [2022-07-12 06:30:28,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:30:28,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:30:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:30:28,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 06:30:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:30:28,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 06:30:28,514 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 06:30:28,515 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 06:30:28,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 06:30:28,519 INFO L356 BasicCegarLoop]: Path program histogram: [20, 1] [2022-07-12 06:30:28,523 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 06:30:28,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:30:28 BoogieIcfgContainer [2022-07-12 06:30:28,592 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 06:30:28,593 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 06:30:28,593 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 06:30:28,593 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 06:30:28,594 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:28:12" (3/4) ... [2022-07-12 06:30:28,595 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 06:30:28,649 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 06:30:28,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 06:30:28,652 INFO L158 Benchmark]: Toolchain (without parser) took 136628.33ms. Allocated memory was 83.9MB in the beginning and 408.9MB in the end (delta: 325.1MB). Free memory was 41.1MB in the beginning and 129.3MB in the end (delta: -88.2MB). Peak memory consumption was 238.3MB. Max. memory is 16.1GB. [2022-07-12 06:30:28,652 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 57.5MB in the beginning and 57.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:30:28,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.13ms. Allocated memory was 83.9MB in the beginning and 111.1MB in the end (delta: 27.3MB). Free memory was 40.9MB in the beginning and 83.3MB in the end (delta: -42.3MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2022-07-12 06:30:28,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.99ms. Allocated memory is still 111.1MB. Free memory was 83.3MB in the beginning and 81.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:30:28,653 INFO L158 Benchmark]: Boogie Preprocessor took 13.86ms. Allocated memory is still 111.1MB. Free memory was 81.8MB in the beginning and 80.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:30:28,656 INFO L158 Benchmark]: RCFGBuilder took 203.08ms. Allocated memory is still 111.1MB. Free memory was 80.7MB in the beginning and 84.8MB in the end (delta: -4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 06:30:28,657 INFO L158 Benchmark]: TraceAbstraction took 136167.49ms. Allocated memory was 111.1MB in the beginning and 408.9MB in the end (delta: 297.8MB). Free memory was 84.3MB in the beginning and 133.5MB in the end (delta: -49.2MB). Peak memory consumption was 250.1MB. Max. memory is 16.1GB. [2022-07-12 06:30:28,657 INFO L158 Benchmark]: Witness Printer took 58.39ms. Allocated memory is still 408.9MB. Free memory was 133.5MB in the beginning and 129.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 06:30:28,658 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.17ms. Allocated memory is still 83.9MB. Free memory was 57.5MB in the beginning and 57.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.13ms. Allocated memory was 83.9MB in the beginning and 111.1MB in the end (delta: 27.3MB). Free memory was 40.9MB in the beginning and 83.3MB in the end (delta: -42.3MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.99ms. Allocated memory is still 111.1MB. Free memory was 83.3MB in the beginning and 81.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.86ms. Allocated memory is still 111.1MB. Free memory was 81.8MB in the beginning and 80.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 203.08ms. Allocated memory is still 111.1MB. Free memory was 80.7MB in the beginning and 84.8MB in the end (delta: -4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 136167.49ms. Allocated memory was 111.1MB in the beginning and 408.9MB in the end (delta: 297.8MB). Free memory was 84.3MB in the beginning and 133.5MB in the end (delta: -49.2MB). Peak memory consumption was 250.1MB. Max. memory is 16.1GB. * Witness Printer took 58.39ms. Allocated memory is still 408.9MB. Free memory was 133.5MB in the beginning and 129.3MB in the end (delta: 4.2MB). 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 20; [L15] int b = 0; VAL [a=20, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=20] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=20, \old(n)=0, \result=20, m=20, n=0] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1, m=19, n=1, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2, m=18, n=2, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3, m=17, n=3, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4, m=16, n=4, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5, m=15, n=5, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6, m=14, n=6, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7, m=13, n=7, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8, m=12, n=8, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9, m=11, n=9, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10, m=10, n=10, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11, m=9, n=11, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12, m=8, n=12, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13, m=7, n=13, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14, m=6, n=14, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15, m=5, n=15, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16, m=4, n=16, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17, m=3, n=17, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18, m=2, n=18, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19, m=1, n=19, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=20, m=0, n=20, sum(n - 1, m + 1)=20] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=20, b=0, sum(a, b)=20] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b VAL [a=20, b=0, result=20] [L18] reach_error() VAL [a=20, b=0, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 136.1s, OverallIterations: 21, TraceHistogramMax: 21, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3093 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2843 mSDsluCounter, 1682 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1500 mSDsCounter, 1215 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1533 IncrementalHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1215 mSolverCounterUnsat, 182 mSDtfsCounter, 1533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3522 GetRequests, 2814 SyntacticMatches, 2 SemanticMatches, 706 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8378 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=20, InterpolantAutomatonStates: 290, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 119.6s InterpolantComputationTime, 2800 NumberOfCodeBlocks, 2800 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 3942 ConstructedInterpolants, 0 QuantifiedInterpolants, 11721 SizeOfPredicates, 209 NumberOfNonLiveVariables, 4408 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 58 InterpolantComputations, 1 PerfectInterpolantSequences, 8930/22800 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:30:28,739 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