./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.i --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/loop-lit/gj2007.i -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 e210f4af0021f1e0c887bbfa24b18aad98424108efaad4cfc57802fd9fd5ce53 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:58:39,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:58:39,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:58:39,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:58:39,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:58:39,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:58:39,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:58:39,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:58:39,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:58:39,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:58:39,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:58:39,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:58:39,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:58:39,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:58:39,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:58:39,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:58:39,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:58:39,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:58:39,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:58:39,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:58:39,373 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:58:39,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:58:39,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:58:39,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:58:39,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:58:39,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:58:39,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:58:39,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:58:39,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:58:39,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:58:39,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:58:39,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:58:39,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:58:39,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:58:39,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:58:39,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:58:39,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:58:39,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:58:39,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:58:39,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:58:39,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:58:39,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:58:39,390 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:58:39,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:58:39,412 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:58:39,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:58:39,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:58:39,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:58:39,413 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:58:39,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:58:39,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:58:39,414 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:58:39,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:58:39,415 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:58:39,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:58:39,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:58:39,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:58:39,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:58:39,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:58:39,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:58:39,416 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:58:39,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:58:39,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:58:39,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:58:39,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:58:39,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:58:39,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:58:39,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:58:39,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:58:39,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:58:39,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:58:39,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:58:39,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:58:39,418 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:58:39,418 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:58:39,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:58:39,418 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 -> e210f4af0021f1e0c887bbfa24b18aad98424108efaad4cfc57802fd9fd5ce53 [2022-07-12 03:58:39,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:58:39,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:58:39,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:58:39,633 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:58:39,635 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:58:39,636 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gj2007.i [2022-07-12 03:58:39,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9020904e/5f2d3fe64bea4a86aafca1f2f64195fc/FLAG578e25622 [2022-07-12 03:58:39,960 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:58:39,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.i [2022-07-12 03:58:39,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9020904e/5f2d3fe64bea4a86aafca1f2f64195fc/FLAG578e25622 [2022-07-12 03:58:40,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9020904e/5f2d3fe64bea4a86aafca1f2f64195fc [2022-07-12 03:58:40,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:58:40,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:58:40,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:58:40,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:58:40,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:58:40,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:58:40" (1/1) ... [2022-07-12 03:58:40,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16582b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40, skipping insertion in model container [2022-07-12 03:58:40,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:58:40" (1/1) ... [2022-07-12 03:58:40,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:58:40,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:58:40,558 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/loop-lit/gj2007.i[895,908] [2022-07-12 03:58:40,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:58:40,604 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:58:40,624 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/loop-lit/gj2007.i[895,908] [2022-07-12 03:58:40,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:58:40,635 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:58:40,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40 WrapperNode [2022-07-12 03:58:40,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:58:40,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:58:40,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:58:40,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:58:40,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40" (1/1) ... [2022-07-12 03:58:40,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40" (1/1) ... [2022-07-12 03:58:40,671 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2022-07-12 03:58:40,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:58:40,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:58:40,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:58:40,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:58:40,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40" (1/1) ... [2022-07-12 03:58:40,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40" (1/1) ... [2022-07-12 03:58:40,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40" (1/1) ... [2022-07-12 03:58:40,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40" (1/1) ... [2022-07-12 03:58:40,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40" (1/1) ... [2022-07-12 03:58:40,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40" (1/1) ... [2022-07-12 03:58:40,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40" (1/1) ... [2022-07-12 03:58:40,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:58:40,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:58:40,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:58:40,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:58:40,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40" (1/1) ... [2022-07-12 03:58:40,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:58:40,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:58:40,733 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 03:58:40,749 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 03:58:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:58:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:58:40,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:58:40,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:58:40,805 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:58:40,807 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:58:40,908 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:58:40,912 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:58:40,912 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 03:58:40,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:58:40 BoogieIcfgContainer [2022-07-12 03:58:40,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:58:40,914 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:58:40,914 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:58:40,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:58:40,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:58:40" (1/3) ... [2022-07-12 03:58:40,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377b45ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:58:40, skipping insertion in model container [2022-07-12 03:58:40,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:58:40" (2/3) ... [2022-07-12 03:58:40,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377b45ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:58:40, skipping insertion in model container [2022-07-12 03:58:40,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:58:40" (3/3) ... [2022-07-12 03:58:40,920 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007.i [2022-07-12 03:58:40,930 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:58:40,930 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:58:40,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:58:40,989 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@1d4bb914, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a9b8d32 [2022-07-12 03:58:40,990 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:58:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 03:58:41,008 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:58:41,009 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 03:58:41,009 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:58:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:58:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2022-07-12 03:58:41,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:58:41,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700390296] [2022-07-12 03:58:41,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:41,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:58:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:41,111 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 03:58:41,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:58:41,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700390296] [2022-07-12 03:58:41,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700390296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:58:41,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:58:41,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:58:41,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855316769] [2022-07-12 03:58:41,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:58:41,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:58:41,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:58:41,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:58:41,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:58:41,143 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:58:41,153 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-07-12 03:58:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:58:41,154 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 03:58:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:58:41,159 INFO L225 Difference]: With dead ends: 20 [2022-07-12 03:58:41,159 INFO L226 Difference]: Without dead ends: 8 [2022-07-12 03:58:41,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:58:41,164 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:58:41,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:58:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-07-12 03:58:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-12 03:58:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-07-12 03:58:41,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2022-07-12 03:58:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:58:41,185 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-12 03:58:41,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2022-07-12 03:58:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 03:58:41,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:58:41,186 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 03:58:41,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:58:41,187 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:58:41,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:58:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2022-07-12 03:58:41,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:58:41,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700228192] [2022-07-12 03:58:41,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:41,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:58:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:41,227 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 03:58:41,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:58:41,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700228192] [2022-07-12 03:58:41,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700228192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:58:41,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:58:41,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:58:41,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788278008] [2022-07-12 03:58:41,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:58:41,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:58:41,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:58:41,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:58:41,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:58:41,233 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:58:41,266 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2022-07-12 03:58:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:58:41,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 03:58:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:58:41,267 INFO L225 Difference]: With dead ends: 16 [2022-07-12 03:58:41,267 INFO L226 Difference]: Without dead ends: 10 [2022-07-12 03:58:41,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:58:41,268 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:58:41,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:58:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-12 03:58:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-12 03:58:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-07-12 03:58:41,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2022-07-12 03:58:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:58:41,272 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-07-12 03:58:41,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-07-12 03:58:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 03:58:41,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:58:41,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:58:41,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:58:41,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:58:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:58:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash 295691924, now seen corresponding path program 1 times [2022-07-12 03:58:41,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:58:41,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143316686] [2022-07-12 03:58:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:41,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:58:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:58:41,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:58:41,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143316686] [2022-07-12 03:58:41,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143316686] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:58:41,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201833224] [2022-07-12 03:58:41,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:41,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:41,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:58:41,340 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 03:58:41,344 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 03:58:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:41,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:58:41,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:58:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:58:41,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:58:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:58:41,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201833224] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:58:41,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:58:41,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-12 03:58:41,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026764862] [2022-07-12 03:58:41,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:58:41,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:58:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:58:41,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:58:41,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:58:41,464 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:58:41,497 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2022-07-12 03:58:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:58:41,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 03:58:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:58:41,498 INFO L225 Difference]: With dead ends: 21 [2022-07-12 03:58:41,498 INFO L226 Difference]: Without dead ends: 15 [2022-07-12 03:58:41,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:58:41,499 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:58:41,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:58:41,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-12 03:58:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-12 03:58:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-12 03:58:41,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-07-12 03:58:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:58:41,503 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-12 03:58:41,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-12 03:58:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 03:58:41,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:58:41,504 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 03:58:41,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 03:58:41,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:41,710 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:58:41,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:58:41,711 INFO L85 PathProgramCache]: Analyzing trace with hash 598153473, now seen corresponding path program 1 times [2022-07-12 03:58:41,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:58:41,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311575174] [2022-07-12 03:58:41,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:41,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:58:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:58:41,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:58:41,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311575174] [2022-07-12 03:58:41,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311575174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:58:41,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985812817] [2022-07-12 03:58:41,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:41,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:41,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:58:41,800 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 03:58:41,803 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 03:58:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:41,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 03:58:41,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:58:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:58:41,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:58:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:58:41,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985812817] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:58:41,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:58:41,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-07-12 03:58:41,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410980199] [2022-07-12 03:58:41,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:58:41,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 03:58:41,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:58:41,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 03:58:41,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:58:41,870 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:58:41,890 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-07-12 03:58:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:58:41,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 03:58:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:58:41,891 INFO L225 Difference]: With dead ends: 32 [2022-07-12 03:58:41,891 INFO L226 Difference]: Without dead ends: 23 [2022-07-12 03:58:41,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:58:41,892 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:58:41,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:58:41,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-12 03:58:41,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-12 03:58:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-07-12 03:58:41,896 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2022-07-12 03:58:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:58:41,896 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-07-12 03:58:41,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-07-12 03:58:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 03:58:41,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:58:41,897 INFO L195 NwaCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 03:58:41,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:58:42,110 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,SelfDestructingSolverStorable3 [2022-07-12 03:58:42,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:58:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:58:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1175196403, now seen corresponding path program 2 times [2022-07-12 03:58:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:58:42,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531061214] [2022-07-12 03:58:42,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:58:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:58:42,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:58:42,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531061214] [2022-07-12 03:58:42,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531061214] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:58:42,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203375784] [2022-07-12 03:58:42,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:58:42,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:42,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:58:42,219 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 03:58:42,220 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 03:58:42,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:58:42,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:58:42,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 03:58:42,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:58:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:58:42,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:58:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:58:42,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203375784] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:58:42,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:58:42,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-07-12 03:58:42,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203800203] [2022-07-12 03:58:42,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:58:42,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 03:58:42,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:58:42,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 03:58:42,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-07-12 03:58:42,444 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:58:42,489 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-07-12 03:58:42,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 03:58:42,490 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 03:58:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:58:42,491 INFO L225 Difference]: With dead ends: 48 [2022-07-12 03:58:42,491 INFO L226 Difference]: Without dead ends: 39 [2022-07-12 03:58:42,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-07-12 03:58:42,493 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:58:42,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:58:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-12 03:58:42,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-12 03:58:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-07-12 03:58:42,507 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 22 [2022-07-12 03:58:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:58:42,507 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-07-12 03:58:42,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-07-12 03:58:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 03:58:42,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:58:42,509 INFO L195 NwaCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 03:58:42,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 03:58:42,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:42,729 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:58:42,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:58:42,729 INFO L85 PathProgramCache]: Analyzing trace with hash -713215707, now seen corresponding path program 3 times [2022-07-12 03:58:42,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:58:42,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365584226] [2022-07-12 03:58:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:42,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:58:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:58:42,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:58:42,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365584226] [2022-07-12 03:58:42,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365584226] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:58:42,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440771500] [2022-07-12 03:58:42,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:58:42,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:42,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:58:42,912 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 03:58:42,940 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 03:58:42,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-12 03:58:42,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:58:42,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:58:42,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:58:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-07-12 03:58:42,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:58:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2022-07-12 03:58:43,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440771500] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:58:43,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:58:43,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5, 5] total 23 [2022-07-12 03:58:43,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725222570] [2022-07-12 03:58:43,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:58:43,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 03:58:43,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:58:43,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 03:58:43,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-07-12 03:58:43,046 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:58:43,120 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-07-12 03:58:43,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 03:58:43,121 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 03:58:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:58:43,122 INFO L225 Difference]: With dead ends: 58 [2022-07-12 03:58:43,122 INFO L226 Difference]: Without dead ends: 49 [2022-07-12 03:58:43,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-07-12 03:58:43,124 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:58:43,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 26 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:58:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-12 03:58:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-07-12 03:58:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2022-07-12 03:58:43,130 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 38 [2022-07-12 03:58:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:58:43,130 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2022-07-12 03:58:43,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2022-07-12 03:58:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 03:58:43,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:58:43,132 INFO L195 NwaCegarLoop]: trace histogram [21, 15, 6, 1, 1, 1, 1, 1, 1] [2022-07-12 03:58:43,165 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 03:58:43,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:43,349 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:58:43,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:58:43,350 INFO L85 PathProgramCache]: Analyzing trace with hash 160479836, now seen corresponding path program 4 times [2022-07-12 03:58:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:58:43,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012740330] [2022-07-12 03:58:43,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:58:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 176 proven. 240 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 03:58:43,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:58:43,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012740330] [2022-07-12 03:58:43,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012740330] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:58:43,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361459649] [2022-07-12 03:58:43,517 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 03:58:43,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:43,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:58:43,518 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 03:58:43,519 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 03:58:43,573 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 03:58:43,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:58:43,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 03:58:43,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:58:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 176 proven. 240 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 03:58:43,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:58:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 176 proven. 240 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 03:58:44,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361459649] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:58:44,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:58:44,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2022-07-12 03:58:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971993798] [2022-07-12 03:58:44,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:58:44,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 03:58:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:58:44,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 03:58:44,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 03:58:44,086 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 35 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:58:44,184 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2022-07-12 03:58:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 03:58:44,186 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-12 03:58:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:58:44,187 INFO L225 Difference]: With dead ends: 100 [2022-07-12 03:58:44,188 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 03:58:44,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 03:58:44,190 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:58:44,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:58:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 03:58:44,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-12 03:58:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-07-12 03:58:44,213 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 48 [2022-07-12 03:58:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:58:44,214 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-07-12 03:58:44,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.1714285714285713) internal successors, (76), 35 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-07-12 03:58:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 03:58:44,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:58:44,217 INFO L195 NwaCegarLoop]: trace histogram [38, 32, 6, 1, 1, 1, 1, 1, 1] [2022-07-12 03:58:44,249 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 03:58:44,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:44,434 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:58:44,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:58:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash 722625007, now seen corresponding path program 5 times [2022-07-12 03:58:44,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:58:44,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171574866] [2022-07-12 03:58:44,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:58:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 1056 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 03:58:44,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:58:44,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171574866] [2022-07-12 03:58:44,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171574866] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:58:44,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640118200] [2022-07-12 03:58:44,866 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 03:58:44,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:44,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:58:44,874 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 03:58:44,882 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 03:58:44,973 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2022-07-12 03:58:44,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:58:44,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 03:58:44,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:58:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 1056 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 03:58:45,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:58:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 1056 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-12 03:58:45,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640118200] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:58:45,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:58:45,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 53 [2022-07-12 03:58:45,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133221708] [2022-07-12 03:58:45,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:58:45,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-12 03:58:45,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:58:45,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-12 03:58:45,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2022-07-12 03:58:45,614 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 53 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 53 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:45,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:58:45,716 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2022-07-12 03:58:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-12 03:58:45,716 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 53 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-07-12 03:58:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:58:45,717 INFO L225 Difference]: With dead ends: 136 [2022-07-12 03:58:45,717 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 03:58:45,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2022-07-12 03:58:45,719 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:58:45,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:58:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 03:58:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-12 03:58:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.0593220338983051) internal successors, (125), 118 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2022-07-12 03:58:45,726 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 82 [2022-07-12 03:58:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:58:45,727 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2022-07-12 03:58:45,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.1320754716981134) internal successors, (113), 53 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-07-12 03:58:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 03:58:45,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:58:45,728 INFO L195 NwaCegarLoop]: trace histogram [56, 50, 6, 1, 1, 1, 1, 1, 1] [2022-07-12 03:58:45,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-12 03:58:45,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:45,944 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:58:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:58:45,944 INFO L85 PathProgramCache]: Analyzing trace with hash 186833573, now seen corresponding path program 6 times [2022-07-12 03:58:45,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:58:45,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643330682] [2022-07-12 03:58:45,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:45,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:58:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:58:47,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:58:47,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643330682] [2022-07-12 03:58:47,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643330682] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:58:47,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298802567] [2022-07-12 03:58:47,013 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 03:58:47,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:47,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:58:47,018 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 03:58:47,019 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 03:58:47,074 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2022-07-12 03:58:47,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:58:47,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 03:58:47,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:58:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2022-07-12 03:58:47,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:58:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2022-07-12 03:58:47,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298802567] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:58:47,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:58:47,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 9, 9] total 66 [2022-07-12 03:58:47,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085619028] [2022-07-12 03:58:47,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:58:47,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-12 03:58:47,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:58:47,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-12 03:58:47,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2022-07-12 03:58:47,380 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:58:47,623 INFO L93 Difference]: Finished difference Result 139 states and 160 transitions. [2022-07-12 03:58:47,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-12 03:58:47,623 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-12 03:58:47,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:58:47,624 INFO L225 Difference]: With dead ends: 139 [2022-07-12 03:58:47,624 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 03:58:47,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2022-07-12 03:58:47,626 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 121 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:58:47,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 18 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:58:47,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 03:58:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-12 03:58:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.1119402985074627) internal successors, (149), 134 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2022-07-12 03:58:47,633 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 118 [2022-07-12 03:58:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:58:47,634 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2022-07-12 03:58:47,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 66 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2022-07-12 03:58:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 03:58:47,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:58:47,635 INFO L195 NwaCegarLoop]: trace histogram [64, 50, 14, 1, 1, 1, 1, 1, 1] [2022-07-12 03:58:47,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-12 03:58:47,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:47,853 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:58:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:58:47,854 INFO L85 PathProgramCache]: Analyzing trace with hash -10833715, now seen corresponding path program 7 times [2022-07-12 03:58:47,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:58:47,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604986567] [2022-07-12 03:58:47,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:47,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:58:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:58:49,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:58:49,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604986567] [2022-07-12 03:58:49,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604986567] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:58:49,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598491966] [2022-07-12 03:58:49,308 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 03:58:49,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:49,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:58:49,309 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 03:58:49,311 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 03:58:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:49,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-12 03:58:49,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:58:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:58:49,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:58:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:58:51,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598491966] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:58:51,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:58:51,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 103 [2022-07-12 03:58:51,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203166956] [2022-07-12 03:58:51,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:58:51,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-07-12 03:58:51,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:58:51,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-07-12 03:58:51,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2022-07-12 03:58:51,214 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 103 states, 103 states have (on average 2.1650485436893203) internal successors, (223), 103 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:58:51,738 INFO L93 Difference]: Finished difference Result 211 states and 296 transitions. [2022-07-12 03:58:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-12 03:58:51,739 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.1650485436893203) internal successors, (223), 103 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2022-07-12 03:58:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:58:51,741 INFO L225 Difference]: With dead ends: 211 [2022-07-12 03:58:51,741 INFO L226 Difference]: Without dead ends: 207 [2022-07-12 03:58:51,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2022-07-12 03:58:51,743 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 100 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:58:51,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 26 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:58:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-12 03:58:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-12 03:58:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.2475728155339805) internal successors, (257), 206 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2022-07-12 03:58:51,764 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 134 [2022-07-12 03:58:51,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:58:51,765 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2022-07-12 03:58:51,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.1650485436893203) internal successors, (223), 103 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2022-07-12 03:58:51,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-12 03:58:51,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:58:51,771 INFO L195 NwaCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1, 1, 1] [2022-07-12 03:58:51,790 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 03:58:51,990 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,SelfDestructingSolverStorable9 [2022-07-12 03:58:51,990 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:58:51,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:58:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1394062977, now seen corresponding path program 8 times [2022-07-12 03:58:51,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:58:51,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673269045] [2022-07-12 03:58:51,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:51,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:58:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2022-07-12 03:58:53,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:58:53,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673269045] [2022-07-12 03:58:53,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673269045] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:58:53,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577080884] [2022-07-12 03:58:53,195 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:58:53,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:53,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:58:53,196 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 03:58:53,197 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 03:58:53,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:58:53,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:58:53,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-12 03:58:53,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:58:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2022-07-12 03:58:53,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:58:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2022-07-12 03:58:54,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577080884] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:58:54,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:58:54,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2022-07-12 03:58:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719246564] [2022-07-12 03:58:54,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:58:54,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-12 03:58:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:58:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-12 03:58:54,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2022-07-12 03:58:54,365 INFO L87 Difference]: Start difference. First operand 207 states and 257 transitions. Second operand has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 55 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:58:55,303 INFO L93 Difference]: Finished difference Result 2862 states and 4237 transitions. [2022-07-12 03:58:55,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-12 03:58:55,304 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 55 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2022-07-12 03:58:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:58:55,314 INFO L225 Difference]: With dead ends: 2862 [2022-07-12 03:58:55,314 INFO L226 Difference]: Without dead ends: 2858 [2022-07-12 03:58:55,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 406 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2022-07-12 03:58:55,317 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 52 mSDsluCounter, 5516 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 5623 SdHoareTripleChecker+Invalid, 2810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 03:58:55,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 5623 Invalid, 2810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 03:58:55,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2022-07-12 03:58:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 209. [2022-07-12 03:58:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.25) internal successors, (260), 208 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 260 transitions. [2022-07-12 03:58:55,361 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 260 transitions. Word has length 206 [2022-07-12 03:58:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:58:55,362 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 260 transitions. [2022-07-12 03:58:55,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.981818181818182) internal successors, (109), 55 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:55,362 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 260 transitions. [2022-07-12 03:58:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-12 03:58:55,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:58:55,364 INFO L195 NwaCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1, 1, 1] [2022-07-12 03:58:55,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-12 03:58:55,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:58:55,581 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:58:55,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:58:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash -283085658, now seen corresponding path program 9 times [2022-07-12 03:58:55,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:58:55,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376057243] [2022-07-12 03:58:55,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:58:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:58:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:58:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2022-07-12 03:58:56,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:58:56,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376057243] [2022-07-12 03:58:56,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376057243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:58:56,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:58:56,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-07-12 03:58:56,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121407510] [2022-07-12 03:58:56,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:58:56,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-12 03:58:56,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:58:56,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-12 03:58:56,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2022-07-12 03:58:56,575 INFO L87 Difference]: Start difference. First operand 209 states and 260 transitions. Second operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:58:56,780 INFO L93 Difference]: Finished difference Result 308 states and 408 transitions. [2022-07-12 03:58:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-12 03:58:56,780 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2022-07-12 03:58:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:58:56,781 INFO L225 Difference]: With dead ends: 308 [2022-07-12 03:58:56,781 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:58:56,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2022-07-12 03:58:56,782 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:58:56,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:58:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:58:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:58:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:58:56,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 208 [2022-07-12 03:58:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:58:56,790 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:58:56,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 52 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:58:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:58:56,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:58:56,792 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:58:56,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 03:58:56,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:58:58,623 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:58:58,623 INFO L899 garLoopResultBuilder]: For program point L27-2(lines 27 34) no Hoare annotation was computed. [2022-07-12 03:58:58,623 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-07-12 03:58:58,624 INFO L902 garLoopResultBuilder]: At program point L36(lines 24 37) the Hoare annotation is: true [2022-07-12 03:58:58,624 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:58:58,624 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:58:58,624 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:58:58,624 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 33) no Hoare annotation was computed. [2022-07-12 03:58:58,626 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 27 34) the Hoare annotation is: (or (and (<= |ULTIMATE.start_main_~x~0#1| 56) (<= |ULTIMATE.start_main_~y~0#1| 56) (<= 56 |ULTIMATE.start_main_~x~0#1|) (<= 56 |ULTIMATE.start_main_~y~0#1|)) (and (<= 71 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 71) (<= 71 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~x~0#1| 72)) (and (<= 99 |ULTIMATE.start_main_~x~0#1|) (<= 99 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 99) (< |ULTIMATE.start_main_~x~0#1| 100)) (and (<= 57 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 57) (<= 57 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 57)) (and (<= |ULTIMATE.start_main_~x~0#1| 64) (<= 64 |ULTIMATE.start_main_~x~0#1|) (<= 64 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 64)) (and (<= |ULTIMATE.start_main_~x~0#1| 63) (<= 63 |ULTIMATE.start_main_~y~0#1|) (<= 63 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 63)) (and (<= |ULTIMATE.start_main_~y~0#1| 76) (< |ULTIMATE.start_main_~x~0#1| 77) (<= 76 |ULTIMATE.start_main_~x~0#1|) (<= 76 |ULTIMATE.start_main_~y~0#1|)) (and (<= |ULTIMATE.start_main_~y~0#1| 68) (< |ULTIMATE.start_main_~x~0#1| 69) (<= 68 |ULTIMATE.start_main_~x~0#1|) (<= 68 |ULTIMATE.start_main_~y~0#1|)) (and (< |ULTIMATE.start_main_~x~0#1| 89) (<= |ULTIMATE.start_main_~y~0#1| 88) (<= 88 |ULTIMATE.start_main_~x~0#1|) (<= 88 |ULTIMATE.start_main_~y~0#1|)) (and (<= |ULTIMATE.start_main_~y~0#1| 77) (<= 77 |ULTIMATE.start_main_~y~0#1|) (< |ULTIMATE.start_main_~x~0#1| 78) (<= 77 |ULTIMATE.start_main_~x~0#1|)) (and (<= 95 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~x~0#1| 96) (<= 95 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 95)) (and (< |ULTIMATE.start_main_~x~0#1| 71) (<= 70 |ULTIMATE.start_main_~y~0#1|) (<= 70 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 70)) (and (<= |ULTIMATE.start_main_~y~0#1| 73) (<= 73 |ULTIMATE.start_main_~y~0#1|) (< |ULTIMATE.start_main_~x~0#1| 74) (<= 73 |ULTIMATE.start_main_~x~0#1|)) (and (<= |ULTIMATE.start_main_~y~0#1| 96) (<= 96 |ULTIMATE.start_main_~y~0#1|) (< |ULTIMATE.start_main_~x~0#1| 97) (<= 96 |ULTIMATE.start_main_~x~0#1|)) (and (<= 80 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 80) (< |ULTIMATE.start_main_~x~0#1| 81) (<= 80 |ULTIMATE.start_main_~y~0#1|)) (and (<= 91 |ULTIMATE.start_main_~y~0#1|) (<= 91 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~x~0#1| 92) (<= |ULTIMATE.start_main_~y~0#1| 91)) (and (<= |ULTIMATE.start_main_~x~0#1| 61) (<= 61 |ULTIMATE.start_main_~x~0#1|) (<= 61 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 61)) (and (<= 55 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 55) (<= |ULTIMATE.start_main_~x~0#1| 55) (<= 55 |ULTIMATE.start_main_~x~0#1|)) (and (< |ULTIMATE.start_main_~x~0#1| 94) (<= 93 |ULTIMATE.start_main_~x~0#1|) (<= 93 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 93)) (and (<= |ULTIMATE.start_main_~y~0#1| 59) (<= 59 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 59) (<= 59 |ULTIMATE.start_main_~x~0#1|)) (and (<= 81 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 81) (< |ULTIMATE.start_main_~x~0#1| 82) (<= 81 |ULTIMATE.start_main_~x~0#1|)) (and (< |ULTIMATE.start_main_~x~0#1| 76) (<= 75 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 75) (<= 75 |ULTIMATE.start_main_~x~0#1|)) (and (< |ULTIMATE.start_main_~x~0#1| 68) (<= 67 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 67) (<= 67 |ULTIMATE.start_main_~y~0#1|)) (and (<= |ULTIMATE.start_main_~y~0#1| 74) (<= 74 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~x~0#1| 75) (<= 74 |ULTIMATE.start_main_~y~0#1|)) (and (<= 82 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 82) (< |ULTIMATE.start_main_~x~0#1| 83) (<= 82 |ULTIMATE.start_main_~y~0#1|)) (and (<= |ULTIMATE.start_main_~x~0#1| 62) (<= 62 |ULTIMATE.start_main_~y~0#1|) (<= 62 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 62)) (and (<= |ULTIMATE.start_main_~y~0#1| 89) (<= 89 |ULTIMATE.start_main_~y~0#1|) (< |ULTIMATE.start_main_~x~0#1| 90) (<= 89 |ULTIMATE.start_main_~x~0#1|)) (and (<= 100 |ULTIMATE.start_main_~x~0#1|) (< 99 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 100)) (and (<= 58 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 58) (<= 58 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 58)) (and (<= 54 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 54) (<= 54 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 54)) (and (< |ULTIMATE.start_main_~x~0#1| 91) (<= 90 |ULTIMATE.start_main_~y~0#1|) (<= 90 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 90)) (and (< |ULTIMATE.start_main_~x~0#1| 87) (<= |ULTIMATE.start_main_~y~0#1| 86) (<= 86 |ULTIMATE.start_main_~x~0#1|) (<= 86 |ULTIMATE.start_main_~y~0#1|)) (and (<= 83 |ULTIMATE.start_main_~x~0#1|) (<= 83 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 83) (< |ULTIMATE.start_main_~x~0#1| 84)) (and (<= 92 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~x~0#1| 93) (<= |ULTIMATE.start_main_~y~0#1| 92) (<= 92 |ULTIMATE.start_main_~y~0#1|)) (and (<= 87 |ULTIMATE.start_main_~y~0#1|) (<= 87 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 87) (< |ULTIMATE.start_main_~x~0#1| 88)) (and (< |ULTIMATE.start_main_~x~0#1| 79) (<= 78 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 78) (<= 78 |ULTIMATE.start_main_~y~0#1|)) (and (< |ULTIMATE.start_main_~x~0#1| 73) (<= 72 |ULTIMATE.start_main_~x~0#1|) (<= 72 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 72)) (and (<= |ULTIMATE.start_main_~y~0#1| 53) (<= |ULTIMATE.start_main_~x~0#1| 53) (<= 53 |ULTIMATE.start_main_~y~0#1|) (<= 53 |ULTIMATE.start_main_~x~0#1|)) (and (<= 98 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 98) (<= 98 |ULTIMATE.start_main_~y~0#1|) (< |ULTIMATE.start_main_~x~0#1| 99)) (and (<= |ULTIMATE.start_main_~y~0#1| 52) (<= 52 |ULTIMATE.start_main_~x~0#1|) (<= 52 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 52)) (and (<= 94 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 94) (<= 94 |ULTIMATE.start_main_~y~0#1|) (< |ULTIMATE.start_main_~x~0#1| 95)) (and (<= |ULTIMATE.start_main_~x~0#1| 60) (<= 60 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 60) (<= 60 |ULTIMATE.start_main_~y~0#1|)) (and (<= 51 |ULTIMATE.start_main_~y~0#1|) (<= 51 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 51) (<= |ULTIMATE.start_main_~y~0#1| 51)) (and (<= 69 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~x~0#1| 70) (<= 69 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 69)) (and (< |ULTIMATE.start_main_~x~0#1| 80) (<= |ULTIMATE.start_main_~y~0#1| 79) (<= 79 |ULTIMATE.start_main_~y~0#1|) (<= 79 |ULTIMATE.start_main_~x~0#1|)) (and (<= |ULTIMATE.start_main_~y~0#1| 85) (<= 85 |ULTIMATE.start_main_~x~0#1|) (<= 85 |ULTIMATE.start_main_~y~0#1|) (< |ULTIMATE.start_main_~x~0#1| 86)) (and (<= 66 |ULTIMATE.start_main_~y~0#1|) (< |ULTIMATE.start_main_~x~0#1| 67) (<= |ULTIMATE.start_main_~y~0#1| 66) (<= 66 |ULTIMATE.start_main_~x~0#1|)) (and (<= 84 |ULTIMATE.start_main_~y~0#1|) (< |ULTIMATE.start_main_~x~0#1| 85) (<= |ULTIMATE.start_main_~y~0#1| 84) (<= 84 |ULTIMATE.start_main_~x~0#1|)) (and (<= 97 |ULTIMATE.start_main_~y~0#1|) (<= 97 |ULTIMATE.start_main_~x~0#1|) (< |ULTIMATE.start_main_~x~0#1| 98) (<= |ULTIMATE.start_main_~y~0#1| 97)) (and (<= |ULTIMATE.start_main_~y~0#1| 65) (<= 65 |ULTIMATE.start_main_~x~0#1|) (<= 65 |ULTIMATE.start_main_~y~0#1|) (< |ULTIMATE.start_main_~x~0#1| 66)) (and (<= |ULTIMATE.start_main_~x~0#1| 50) (<= |ULTIMATE.start_main_~y~0#1| 50) (<= 50 |ULTIMATE.start_main_~y~0#1|))) [2022-07-12 03:58:58,626 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-07-12 03:58:58,626 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-07-12 03:58:58,626 INFO L902 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2022-07-12 03:58:58,630 INFO L356 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1] [2022-07-12 03:58:58,631 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:58:58,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:58:58 BoogieIcfgContainer [2022-07-12 03:58:58,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:58:58,667 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:58:58,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:58:58,667 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:58:58,667 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:58:40" (3/4) ... [2022-07-12 03:58:58,669 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:58:58,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-07-12 03:58:58,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-12 03:58:58,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:58:58,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:58:58,695 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:58:58,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:58:58,696 INFO L158 Benchmark]: Toolchain (without parser) took 18285.64ms. Allocated memory was 123.7MB in the beginning and 262.1MB in the end (delta: 138.4MB). Free memory was 90.3MB in the beginning and 184.1MB in the end (delta: -93.8MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2022-07-12 03:58:58,696 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 39.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:58:58,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.97ms. Allocated memory is still 123.7MB. Free memory was 90.3MB in the beginning and 99.1MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:58:58,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.06ms. Allocated memory is still 123.7MB. Free memory was 98.7MB in the beginning and 97.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:58:58,697 INFO L158 Benchmark]: Boogie Preprocessor took 18.27ms. Allocated memory is still 123.7MB. Free memory was 97.4MB in the beginning and 96.5MB in the end (delta: 969.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:58:58,697 INFO L158 Benchmark]: RCFGBuilder took 220.27ms. Allocated memory is still 123.7MB. Free memory was 96.4MB in the beginning and 88.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:58:58,697 INFO L158 Benchmark]: TraceAbstraction took 17752.00ms. Allocated memory was 123.7MB in the beginning and 262.1MB in the end (delta: 138.4MB). Free memory was 87.4MB in the beginning and 186.2MB in the end (delta: -98.8MB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. [2022-07-12 03:58:58,697 INFO L158 Benchmark]: Witness Printer took 28.67ms. Allocated memory is still 262.1MB. Free memory was 186.2MB in the beginning and 184.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:58:58,698 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.20ms. Allocated memory is still 83.9MB. Free memory is still 39.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.97ms. Allocated memory is still 123.7MB. Free memory was 90.3MB in the beginning and 99.1MB in the end (delta: -8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.06ms. Allocated memory is still 123.7MB. Free memory was 98.7MB in the beginning and 97.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.27ms. Allocated memory is still 123.7MB. Free memory was 97.4MB in the beginning and 96.5MB in the end (delta: 969.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 220.27ms. Allocated memory is still 123.7MB. Free memory was 96.4MB in the beginning and 88.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17752.00ms. Allocated memory was 123.7MB in the beginning and 262.1MB in the end (delta: 138.4MB). Free memory was 87.4MB in the beginning and 186.2MB in the end (delta: -98.8MB). Peak memory consumption was 148.5MB. Max. memory is 16.1GB. * Witness Printer took 28.67ms. Allocated memory is still 262.1MB. Free memory was 186.2MB in the beginning and 184.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.7s, OverallIterations: 12, TraceHistogramMax: 101, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 317 mSDsluCounter, 5822 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5638 mSDsCounter, 1018 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3887 IncrementalHoareTripleChecker+Invalid, 4905 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1018 mSolverCounterUnsat, 184 mSDtfsCounter, 3887 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1648 GetRequests, 1238 SyntacticMatches, 8 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=11, InterpolantAutomatonStates: 418, 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, 12 MinimizatonAttempts, 2649 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 106 NumberOfFragments, 660 HoareAnnotationTreeSize, 3 FomulaSimplifications, 15473 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 500 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 1560 NumberOfCodeBlocks, 1478 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 2200 ConstructedInterpolants, 0 QuantifiedInterpolants, 7901 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1541 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 30 InterpolantComputations, 3 PerfectInterpolantSequences, 26464/68563 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((x <= 56 && y <= 56) && 56 <= x) && 56 <= y) || (((71 <= y && y <= 71) && 71 <= x) && x < 72)) || (((99 <= x && 99 <= y) && y <= 99) && x < 100)) || (((57 <= x && y <= 57) && 57 <= y) && x <= 57)) || (((x <= 64 && 64 <= x) && 64 <= y) && y <= 64)) || (((x <= 63 && 63 <= y) && 63 <= x) && y <= 63)) || (((y <= 76 && x < 77) && 76 <= x) && 76 <= y)) || (((y <= 68 && x < 69) && 68 <= x) && 68 <= y)) || (((x < 89 && y <= 88) && 88 <= x) && 88 <= y)) || (((y <= 77 && 77 <= y) && x < 78) && 77 <= x)) || (((95 <= x && x < 96) && 95 <= y) && y <= 95)) || (((x < 71 && 70 <= y) && 70 <= x) && y <= 70)) || (((y <= 73 && 73 <= y) && x < 74) && 73 <= x)) || (((y <= 96 && 96 <= y) && x < 97) && 96 <= x)) || (((80 <= x && y <= 80) && x < 81) && 80 <= y)) || (((91 <= y && 91 <= x) && x < 92) && y <= 91)) || (((x <= 61 && 61 <= x) && 61 <= y) && y <= 61)) || (((55 <= y && y <= 55) && x <= 55) && 55 <= x)) || (((x < 94 && 93 <= x) && 93 <= y) && y <= 93)) || (((y <= 59 && 59 <= y) && x <= 59) && 59 <= x)) || (((81 <= y && y <= 81) && x < 82) && 81 <= x)) || (((x < 76 && 75 <= y) && y <= 75) && 75 <= x)) || (((x < 68 && 67 <= x) && y <= 67) && 67 <= y)) || (((y <= 74 && 74 <= x) && x < 75) && 74 <= y)) || (((82 <= x && y <= 82) && x < 83) && 82 <= y)) || (((x <= 62 && 62 <= y) && 62 <= x) && y <= 62)) || (((y <= 89 && 89 <= y) && x < 90) && 89 <= x)) || ((100 <= x && 99 < y) && y <= 100)) || (((58 <= y && y <= 58) && 58 <= x) && x <= 58)) || (((54 <= x && x <= 54) && 54 <= y) && y <= 54)) || (((x < 91 && 90 <= y) && 90 <= x) && y <= 90)) || (((x < 87 && y <= 86) && 86 <= x) && 86 <= y)) || (((83 <= x && 83 <= y) && y <= 83) && x < 84)) || (((92 <= x && x < 93) && y <= 92) && 92 <= y)) || (((87 <= y && 87 <= x) && y <= 87) && x < 88)) || (((x < 79 && 78 <= x) && y <= 78) && 78 <= y)) || (((x < 73 && 72 <= x) && 72 <= y) && y <= 72)) || (((y <= 53 && x <= 53) && 53 <= y) && 53 <= x)) || (((98 <= x && y <= 98) && 98 <= y) && x < 99)) || (((y <= 52 && 52 <= x) && 52 <= y) && x <= 52)) || (((94 <= x && y <= 94) && 94 <= y) && x < 95)) || (((x <= 60 && 60 <= x) && y <= 60) && 60 <= y)) || (((51 <= y && 51 <= x) && x <= 51) && y <= 51)) || (((69 <= x && x < 70) && 69 <= y) && y <= 69)) || (((x < 80 && y <= 79) && 79 <= y) && 79 <= x)) || (((y <= 85 && 85 <= x) && 85 <= y) && x < 86)) || (((66 <= y && x < 67) && y <= 66) && 66 <= x)) || (((84 <= y && x < 85) && y <= 84) && 84 <= x)) || (((97 <= y && 97 <= x) && x < 98) && y <= 97)) || (((y <= 65 && 65 <= x) && 65 <= y) && x < 66)) || ((x <= 50 && y <= 50) && 50 <= y) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-12 03:58:58,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE