./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'f8647b87d9679ff1ae7ce0cdb1a68cb57cbc5ac468f0ecd53079584cb92d51fd'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 f8647b87d9679ff1ae7ce0cdb1a68cb57cbc5ac468f0ecd53079584cb92d51fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:29:16,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:29:16,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 00:29:16,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:29:16,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:29:16,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:29:16,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:29:16,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:29:16,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:29:16,585 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:29:16,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:29:16,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:29:16,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:29:16,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:29:16,586 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:29:16,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:29:16,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:29:16,586 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:29:16,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:29:16,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:29:16,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:29:16,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:29:16,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:29:16,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:29:16,590 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:29:16,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:29:16,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:29:16,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:29:16,590 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:29:16,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:29:16,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:29:16,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:29:16,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:29:16,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:29:16,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:29:16,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:29:16,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:29:16,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:29:16,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:29:16,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:29:16,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:29:16,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:29:16,592 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> f8647b87d9679ff1ae7ce0cdb1a68cb57cbc5ac468f0ecd53079584cb92d51fd [2024-11-07 00:29:16,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:29:16,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:29:16,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:29:16,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:29:16,904 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:29:16,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-11-07 00:29:18,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:29:18,567 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:29:18,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-11-07 00:29:18,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45c775b11/2256a408b1364a7eaacbc3bdda92811f/FLAG33c055ff0 [2024-11-07 00:29:18,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45c775b11/2256a408b1364a7eaacbc3bdda92811f [2024-11-07 00:29:18,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:29:18,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:29:18,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:29:18,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:29:18,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:29:18,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7818f760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:18, skipping insertion in model container [2024-11-07 00:29:18,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:29:18" (1/1) ... [2024-11-07 00:29:18,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:29:18,901 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6197,6210] [2024-11-07 00:29:18,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9182,9195] [2024-11-07 00:29:18,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12241,12254] [2024-11-07 00:29:18,974 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15128,15141] [2024-11-07 00:29:18,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18343,18356] [2024-11-07 00:29:19,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21435,21448] [2024-11-07 00:29:19,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24486,24499] [2024-11-07 00:29:19,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:29:19,060 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:29:19,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6197,6210] [2024-11-07 00:29:19,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9182,9195] [2024-11-07 00:29:19,114 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12241,12254] [2024-11-07 00:29:19,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15128,15141] [2024-11-07 00:29:19,127 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18343,18356] [2024-11-07 00:29:19,134 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21435,21448] [2024-11-07 00:29:19,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24486,24499] [2024-11-07 00:29:19,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:29:19,191 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:29:19,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19 WrapperNode [2024-11-07 00:29:19,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:29:19,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:29:19,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:29:19,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:29:19,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (1/1) ... [2024-11-07 00:29:19,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (1/1) ... [2024-11-07 00:29:19,301 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1430 [2024-11-07 00:29:19,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:29:19,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:29:19,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:29:19,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:29:19,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (1/1) ... [2024-11-07 00:29:19,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (1/1) ... [2024-11-07 00:29:19,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (1/1) ... [2024-11-07 00:29:19,369 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 00:29:19,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (1/1) ... [2024-11-07 00:29:19,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (1/1) ... [2024-11-07 00:29:19,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (1/1) ... [2024-11-07 00:29:19,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (1/1) ... [2024-11-07 00:29:19,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (1/1) ... [2024-11-07 00:29:19,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (1/1) ... [2024-11-07 00:29:19,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:29:19,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:29:19,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:29:19,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:29:19,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (1/1) ... [2024-11-07 00:29:19,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:29:19,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:19,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 00:29:19,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 00:29:19,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:29:19,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:29:19,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:29:19,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:29:19,633 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:29:19,634 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:29:20,355 INFO L? ?]: Removed 266 outVars from TransFormulas that were not future-live. [2024-11-07 00:29:20,356 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:29:20,370 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:29:20,371 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:29:20,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:29:20 BoogieIcfgContainer [2024-11-07 00:29:20,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:29:20,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:29:20,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:29:20,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:29:20,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:29:18" (1/3) ... [2024-11-07 00:29:20,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3815b9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:29:20, skipping insertion in model container [2024-11-07 00:29:20,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:29:19" (2/3) ... [2024-11-07 00:29:20,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3815b9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:29:20, skipping insertion in model container [2024-11-07 00:29:20,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:29:20" (3/3) ... [2024-11-07 00:29:20,381 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-11-07 00:29:20,390 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:29:20,391 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-07 00:29:20,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:29:20,449 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d32a4c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:29:20,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 00:29:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 271 states have (on average 1.7933579335793357) internal successors, (486), 278 states have internal predecessors, (486), 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) [2024-11-07 00:29:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 00:29:20,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:20,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:20,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:20,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:20,507 INFO L85 PathProgramCache]: Analyzing trace with hash -506083603, now seen corresponding path program 1 times [2024-11-07 00:29:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561059882] [2024-11-07 00:29:20,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:20,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:20,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561059882] [2024-11-07 00:29:20,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561059882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:20,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:20,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:20,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020316410] [2024-11-07 00:29:20,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:20,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:20,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:20,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:20,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:20,870 INFO L87 Difference]: Start difference. First operand has 279 states, 271 states have (on average 1.7933579335793357) internal successors, (486), 278 states have internal predecessors, (486), 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 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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) [2024-11-07 00:29:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:21,091 INFO L93 Difference]: Finished difference Result 392 states and 660 transitions. [2024-11-07 00:29:21,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:21,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 [2024-11-07 00:29:21,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:21,099 INFO L225 Difference]: With dead ends: 392 [2024-11-07 00:29:21,099 INFO L226 Difference]: Without dead ends: 244 [2024-11-07 00:29:21,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:21,103 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1152 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:21,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 300 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:21,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-07 00:29:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-07 00:29:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 243 states have internal predecessors, (300), 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) [2024-11-07 00:29:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 300 transitions. [2024-11-07 00:29:21,134 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 300 transitions. Word has length 48 [2024-11-07 00:29:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:21,134 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 300 transitions. [2024-11-07 00:29:21,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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) [2024-11-07 00:29:21,135 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 300 transitions. [2024-11-07 00:29:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 00:29:21,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:21,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:21,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:29:21,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:21,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:21,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1206513712, now seen corresponding path program 1 times [2024-11-07 00:29:21,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:21,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049566854] [2024-11-07 00:29:21,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:21,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:21,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049566854] [2024-11-07 00:29:21,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049566854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:21,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:21,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:21,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506399503] [2024-11-07 00:29:21,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:21,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:21,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:21,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:21,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:21,368 INFO L87 Difference]: Start difference. First operand 244 states and 300 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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) [2024-11-07 00:29:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:21,482 INFO L93 Difference]: Finished difference Result 312 states and 387 transitions. [2024-11-07 00:29:21,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:21,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 [2024-11-07 00:29:21,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:21,484 INFO L225 Difference]: With dead ends: 312 [2024-11-07 00:29:21,484 INFO L226 Difference]: Without dead ends: 186 [2024-11-07 00:29:21,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:21,485 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 638 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:21,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 144 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-07 00:29:21,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-11-07 00:29:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 179 states have (on average 1.2681564245810055) internal successors, (227), 185 states have internal predecessors, (227), 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) [2024-11-07 00:29:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 227 transitions. [2024-11-07 00:29:21,491 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 227 transitions. Word has length 48 [2024-11-07 00:29:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:21,491 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 227 transitions. [2024-11-07 00:29:21,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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) [2024-11-07 00:29:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2024-11-07 00:29:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 00:29:21,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:21,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:21,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:29:21,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:21,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:21,493 INFO L85 PathProgramCache]: Analyzing trace with hash 731649800, now seen corresponding path program 1 times [2024-11-07 00:29:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076918955] [2024-11-07 00:29:21,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:21,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:21,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:21,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076918955] [2024-11-07 00:29:21,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076918955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:21,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:21,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:29:21,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649161683] [2024-11-07 00:29:21,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:21,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:21,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:21,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:21,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:21,618 INFO L87 Difference]: Start difference. First operand 186 states and 227 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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) [2024-11-07 00:29:21,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:21,711 INFO L93 Difference]: Finished difference Result 266 states and 332 transitions. [2024-11-07 00:29:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:21,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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 [2024-11-07 00:29:21,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:21,712 INFO L225 Difference]: With dead ends: 266 [2024-11-07 00:29:21,712 INFO L226 Difference]: Without dead ends: 163 [2024-11-07 00:29:21,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:21,713 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 566 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:21,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 127 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:21,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-07 00:29:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-07 00:29:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2756410256410255) internal successors, (199), 162 states have internal predecessors, (199), 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) [2024-11-07 00:29:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2024-11-07 00:29:21,718 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 48 [2024-11-07 00:29:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:21,719 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2024-11-07 00:29:21,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 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) [2024-11-07 00:29:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2024-11-07 00:29:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 00:29:21,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:21,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:21,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:29:21,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:21,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash 613838546, now seen corresponding path program 1 times [2024-11-07 00:29:21,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:21,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515568635] [2024-11-07 00:29:21,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:21,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:21,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:21,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:21,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515568635] [2024-11-07 00:29:21,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515568635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:21,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:21,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 00:29:21,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758419039] [2024-11-07 00:29:21,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:21,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:29:21,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:21,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:29:21,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:29:21,995 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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) [2024-11-07 00:29:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:22,242 INFO L93 Difference]: Finished difference Result 326 states and 405 transitions. [2024-11-07 00:29:22,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:29:22,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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 50 [2024-11-07 00:29:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:22,243 INFO L225 Difference]: With dead ends: 326 [2024-11-07 00:29:22,243 INFO L226 Difference]: Without dead ends: 239 [2024-11-07 00:29:22,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-07 00:29:22,244 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 458 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:22,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 403 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-07 00:29:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 163. [2024-11-07 00:29:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 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) [2024-11-07 00:29:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2024-11-07 00:29:22,249 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 50 [2024-11-07 00:29:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:22,250 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2024-11-07 00:29:22,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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) [2024-11-07 00:29:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2024-11-07 00:29:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 00:29:22,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:22,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:22,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:29:22,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:22,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1717096174, now seen corresponding path program 1 times [2024-11-07 00:29:22,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:22,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955331123] [2024-11-07 00:29:22,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:22,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:22,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:22,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955331123] [2024-11-07 00:29:22,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955331123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:22,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:22,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:22,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451561733] [2024-11-07 00:29:22,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:22,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:22,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:22,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:22,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:22,648 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 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) [2024-11-07 00:29:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:23,027 INFO L93 Difference]: Finished difference Result 255 states and 313 transitions. [2024-11-07 00:29:23,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:23,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 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 50 [2024-11-07 00:29:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:23,029 INFO L225 Difference]: With dead ends: 255 [2024-11-07 00:29:23,030 INFO L226 Difference]: Without dead ends: 249 [2024-11-07 00:29:23,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:29:23,031 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1124 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:23,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 504 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:23,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-07 00:29:23,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 163. [2024-11-07 00:29:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 162 states have internal predecessors, (197), 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) [2024-11-07 00:29:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2024-11-07 00:29:23,038 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 197 transitions. Word has length 50 [2024-11-07 00:29:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:23,038 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 197 transitions. [2024-11-07 00:29:23,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 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) [2024-11-07 00:29:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 197 transitions. [2024-11-07 00:29:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-07 00:29:23,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:23,040 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:23,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:29:23,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:23,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:23,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1648014290, now seen corresponding path program 1 times [2024-11-07 00:29:23,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:23,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229556933] [2024-11-07 00:29:23,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:23,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:23,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:23,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229556933] [2024-11-07 00:29:23,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229556933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:23,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:23,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:23,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633010443] [2024-11-07 00:29:23,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:23,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:23,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:23,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:23,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:23,330 INFO L87 Difference]: Start difference. First operand 163 states and 197 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 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) [2024-11-07 00:29:23,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:23,692 INFO L93 Difference]: Finished difference Result 315 states and 397 transitions. [2024-11-07 00:29:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:23,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 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 50 [2024-11-07 00:29:23,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:23,694 INFO L225 Difference]: With dead ends: 315 [2024-11-07 00:29:23,694 INFO L226 Difference]: Without dead ends: 253 [2024-11-07 00:29:23,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:29:23,695 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 853 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:23,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 795 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:23,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-07 00:29:23,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 163. [2024-11-07 00:29:23,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 162 states have internal predecessors, (196), 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) [2024-11-07 00:29:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 196 transitions. [2024-11-07 00:29:23,700 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 196 transitions. Word has length 50 [2024-11-07 00:29:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:23,700 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 196 transitions. [2024-11-07 00:29:23,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 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) [2024-11-07 00:29:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 196 transitions. [2024-11-07 00:29:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 00:29:23,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:23,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:23,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:29:23,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:23,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1708755507, now seen corresponding path program 1 times [2024-11-07 00:29:23,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:23,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983980725] [2024-11-07 00:29:23,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:23,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:24,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:24,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983980725] [2024-11-07 00:29:24,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983980725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:24,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:24,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:29:24,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254294498] [2024-11-07 00:29:24,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:24,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:29:24,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:24,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:29:24,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:29:24,149 INFO L87 Difference]: Start difference. First operand 163 states and 196 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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) [2024-11-07 00:29:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:24,631 INFO L93 Difference]: Finished difference Result 294 states and 373 transitions. [2024-11-07 00:29:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:24,631 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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 51 [2024-11-07 00:29:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:24,632 INFO L225 Difference]: With dead ends: 294 [2024-11-07 00:29:24,632 INFO L226 Difference]: Without dead ends: 239 [2024-11-07 00:29:24,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:29:24,633 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 819 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:24,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 1200 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-07 00:29:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 151. [2024-11-07 00:29:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 150 states have internal predecessors, (182), 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) [2024-11-07 00:29:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 182 transitions. [2024-11-07 00:29:24,638 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 182 transitions. Word has length 51 [2024-11-07 00:29:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:24,638 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 182 transitions. [2024-11-07 00:29:24,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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) [2024-11-07 00:29:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 182 transitions. [2024-11-07 00:29:24,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:29:24,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:24,639 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:24,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:29:24,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:24,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash 871420535, now seen corresponding path program 1 times [2024-11-07 00:29:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:24,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501583093] [2024-11-07 00:29:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:24,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:25,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:25,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501583093] [2024-11-07 00:29:25,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501583093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:25,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:25,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:29:25,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312891421] [2024-11-07 00:29:25,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:25,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:29:25,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:25,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:29:25,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:29:25,039 INFO L87 Difference]: Start difference. First operand 151 states and 182 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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) [2024-11-07 00:29:25,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:25,489 INFO L93 Difference]: Finished difference Result 235 states and 290 transitions. [2024-11-07 00:29:25,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:25,489 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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 52 [2024-11-07 00:29:25,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:25,491 INFO L225 Difference]: With dead ends: 235 [2024-11-07 00:29:25,491 INFO L226 Difference]: Without dead ends: 231 [2024-11-07 00:29:25,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:29:25,491 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 718 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:25,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1229 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-07 00:29:25,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 147. [2024-11-07 00:29:25,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.2535211267605635) internal successors, (178), 146 states have internal predecessors, (178), 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) [2024-11-07 00:29:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2024-11-07 00:29:25,497 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 52 [2024-11-07 00:29:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:25,497 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2024-11-07 00:29:25,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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) [2024-11-07 00:29:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2024-11-07 00:29:25,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:29:25,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:25,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:25,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:29:25,499 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:25,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1375412663, now seen corresponding path program 1 times [2024-11-07 00:29:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:25,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465746635] [2024-11-07 00:29:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:25,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:26,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:26,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465746635] [2024-11-07 00:29:26,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465746635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:26,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:26,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-07 00:29:26,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974480417] [2024-11-07 00:29:26,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:26,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-07 00:29:26,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:26,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-07 00:29:26,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:29:26,173 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 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) [2024-11-07 00:29:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:27,349 INFO L93 Difference]: Finished difference Result 427 states and 546 transitions. [2024-11-07 00:29:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 00:29:27,349 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 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 52 [2024-11-07 00:29:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:27,351 INFO L225 Difference]: With dead ends: 427 [2024-11-07 00:29:27,351 INFO L226 Difference]: Without dead ends: 380 [2024-11-07 00:29:27,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 00:29:27,352 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 1782 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 2339 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:27,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 2339 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:29:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-07 00:29:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 154. [2024-11-07 00:29:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.25503355704698) internal successors, (187), 153 states have internal predecessors, (187), 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) [2024-11-07 00:29:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 187 transitions. [2024-11-07 00:29:27,356 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 187 transitions. Word has length 52 [2024-11-07 00:29:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:27,356 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 187 transitions. [2024-11-07 00:29:27,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 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) [2024-11-07 00:29:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 187 transitions. [2024-11-07 00:29:27,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:29:27,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:27,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:27,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:29:27,358 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:27,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:27,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1993375358, now seen corresponding path program 1 times [2024-11-07 00:29:27,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:27,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350065477] [2024-11-07 00:29:27,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:27,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:27,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:27,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350065477] [2024-11-07 00:29:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350065477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:27,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:27,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 00:29:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637797134] [2024-11-07 00:29:27,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:27,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 00:29:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:27,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 00:29:27,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-07 00:29:27,806 INFO L87 Difference]: Start difference. First operand 154 states and 187 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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) [2024-11-07 00:29:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:28,575 INFO L93 Difference]: Finished difference Result 418 states and 540 transitions. [2024-11-07 00:29:28,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 00:29:28,575 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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 53 [2024-11-07 00:29:28,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:28,576 INFO L225 Difference]: With dead ends: 418 [2024-11-07 00:29:28,576 INFO L226 Difference]: Without dead ends: 371 [2024-11-07 00:29:28,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:29:28,577 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1214 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 2104 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:28,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 2104 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 00:29:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-07 00:29:28,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 143. [2024-11-07 00:29:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 142 states have internal predecessors, (173), 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) [2024-11-07 00:29:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 173 transitions. [2024-11-07 00:29:28,581 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 173 transitions. Word has length 53 [2024-11-07 00:29:28,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:28,581 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 173 transitions. [2024-11-07 00:29:28,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 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) [2024-11-07 00:29:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 173 transitions. [2024-11-07 00:29:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:29:28,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:28,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:28,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:29:28,583 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:28,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:28,583 INFO L85 PathProgramCache]: Analyzing trace with hash -895336457, now seen corresponding path program 1 times [2024-11-07 00:29:28,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:28,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786403526] [2024-11-07 00:29:28,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:28,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:28,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:28,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786403526] [2024-11-07 00:29:28,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786403526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:28,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:28,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:28,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861058728] [2024-11-07 00:29:28,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:28,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:28,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:28,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:28,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:28,732 INFO L87 Difference]: Start difference. First operand 143 states and 173 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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) [2024-11-07 00:29:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:29,000 INFO L93 Difference]: Finished difference Result 233 states and 285 transitions. [2024-11-07 00:29:29,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 00:29:29,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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 54 [2024-11-07 00:29:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:29,002 INFO L225 Difference]: With dead ends: 233 [2024-11-07 00:29:29,002 INFO L226 Difference]: Without dead ends: 225 [2024-11-07 00:29:29,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:29:29,002 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 955 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:29,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 479 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-07 00:29:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 143. [2024-11-07 00:29:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.2374100719424461) internal successors, (172), 142 states have internal predecessors, (172), 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) [2024-11-07 00:29:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 172 transitions. [2024-11-07 00:29:29,008 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 172 transitions. Word has length 54 [2024-11-07 00:29:29,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:29,009 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 172 transitions. [2024-11-07 00:29:29,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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) [2024-11-07 00:29:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 172 transitions. [2024-11-07 00:29:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:29:29,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:29,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:29,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:29:29,010 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:29,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:29,010 INFO L85 PathProgramCache]: Analyzing trace with hash 4832631, now seen corresponding path program 1 times [2024-11-07 00:29:29,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:29,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500811097] [2024-11-07 00:29:29,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:29,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:29,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:29,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500811097] [2024-11-07 00:29:29,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500811097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:29,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:29,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:29,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729398087] [2024-11-07 00:29:29,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:29,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:29,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:29,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:29,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:29,163 INFO L87 Difference]: Start difference. First operand 143 states and 172 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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) [2024-11-07 00:29:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:29,456 INFO L93 Difference]: Finished difference Result 292 states and 368 transitions. [2024-11-07 00:29:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:29:29,456 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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 54 [2024-11-07 00:29:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:29,457 INFO L225 Difference]: With dead ends: 292 [2024-11-07 00:29:29,457 INFO L226 Difference]: Without dead ends: 229 [2024-11-07 00:29:29,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:29:29,458 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 353 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:29,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 700 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-07 00:29:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 143. [2024-11-07 00:29:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.2302158273381294) internal successors, (171), 142 states have internal predecessors, (171), 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) [2024-11-07 00:29:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 171 transitions. [2024-11-07 00:29:29,462 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 171 transitions. Word has length 54 [2024-11-07 00:29:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:29,462 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 171 transitions. [2024-11-07 00:29:29,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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) [2024-11-07 00:29:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 171 transitions. [2024-11-07 00:29:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:29:29,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:29,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:29,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:29:29,465 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:29,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:29,465 INFO L85 PathProgramCache]: Analyzing trace with hash -924533993, now seen corresponding path program 1 times [2024-11-07 00:29:29,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:29,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749031885] [2024-11-07 00:29:29,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:29,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:29,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:29,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749031885] [2024-11-07 00:29:29,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749031885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:29,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:29,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:29:29,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342622925] [2024-11-07 00:29:29,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:29,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 00:29:29,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:29,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 00:29:29,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:29:29,640 INFO L87 Difference]: Start difference. First operand 143 states and 171 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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) [2024-11-07 00:29:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:29,954 INFO L93 Difference]: Finished difference Result 233 states and 283 transitions. [2024-11-07 00:29:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:29:29,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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 54 [2024-11-07 00:29:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:29,955 INFO L225 Difference]: With dead ends: 233 [2024-11-07 00:29:29,955 INFO L226 Difference]: Without dead ends: 225 [2024-11-07 00:29:29,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-07 00:29:29,956 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 662 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:29,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 673 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-07 00:29:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 143. [2024-11-07 00:29:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.223021582733813) internal successors, (170), 142 states have internal predecessors, (170), 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) [2024-11-07 00:29:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2024-11-07 00:29:29,962 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 54 [2024-11-07 00:29:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:29,962 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2024-11-07 00:29:29,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 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) [2024-11-07 00:29:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2024-11-07 00:29:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:29:29,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:29,963 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:29,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:29:29,963 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:29,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1614885916, now seen corresponding path program 1 times [2024-11-07 00:29:29,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:29,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794398657] [2024-11-07 00:29:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:29,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:30,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:30,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794398657] [2024-11-07 00:29:30,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794398657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:30,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:30,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:29:30,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817680763] [2024-11-07 00:29:30,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:30,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:29:30,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:30,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:29:30,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:29:30,301 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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) [2024-11-07 00:29:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:30,749 INFO L93 Difference]: Finished difference Result 217 states and 267 transitions. [2024-11-07 00:29:30,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:29:30,749 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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 56 [2024-11-07 00:29:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:30,750 INFO L225 Difference]: With dead ends: 217 [2024-11-07 00:29:30,750 INFO L226 Difference]: Without dead ends: 211 [2024-11-07 00:29:30,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-07 00:29:30,751 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 616 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:30,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1153 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-07 00:29:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 137. [2024-11-07 00:29:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 134 states have (on average 1.2238805970149254) internal successors, (164), 136 states have internal predecessors, (164), 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) [2024-11-07 00:29:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 164 transitions. [2024-11-07 00:29:30,756 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 164 transitions. Word has length 56 [2024-11-07 00:29:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:30,756 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 164 transitions. [2024-11-07 00:29:30,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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) [2024-11-07 00:29:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 164 transitions. [2024-11-07 00:29:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:29:30,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:30,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:30,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:29:30,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:30,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:30,757 INFO L85 PathProgramCache]: Analyzing trace with hash 897405148, now seen corresponding path program 1 times [2024-11-07 00:29:30,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:30,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696695728] [2024-11-07 00:29:30,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:30,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:31,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:31,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696695728] [2024-11-07 00:29:31,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696695728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:31,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:31,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-07 00:29:31,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886796652] [2024-11-07 00:29:31,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:31,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 00:29:31,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:31,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 00:29:31,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-07 00:29:31,248 INFO L87 Difference]: Start difference. First operand 137 states and 164 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 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) [2024-11-07 00:29:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:32,238 INFO L93 Difference]: Finished difference Result 367 states and 457 transitions. [2024-11-07 00:29:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 00:29:32,239 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 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 56 [2024-11-07 00:29:32,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:32,240 INFO L225 Difference]: With dead ends: 367 [2024-11-07 00:29:32,240 INFO L226 Difference]: Without dead ends: 358 [2024-11-07 00:29:32,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=911, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 00:29:32,241 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 934 mSDsluCounter, 2619 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 2916 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:32,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 2916 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:29:32,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-07 00:29:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 147. [2024-11-07 00:29:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 144 states have (on average 1.2222222222222223) internal successors, (176), 146 states have internal predecessors, (176), 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) [2024-11-07 00:29:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 176 transitions. [2024-11-07 00:29:32,247 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 176 transitions. Word has length 56 [2024-11-07 00:29:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:32,248 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 176 transitions. [2024-11-07 00:29:32,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 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) [2024-11-07 00:29:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 176 transitions. [2024-11-07 00:29:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:29:32,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:32,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:32,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:29:32,250 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:32,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:32,250 INFO L85 PathProgramCache]: Analyzing trace with hash -712982628, now seen corresponding path program 1 times [2024-11-07 00:29:32,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:32,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053991317] [2024-11-07 00:29:32,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:32,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:32,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:32,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053991317] [2024-11-07 00:29:32,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053991317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:32,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:32,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 00:29:32,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017458752] [2024-11-07 00:29:32,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:32,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 00:29:32,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:32,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 00:29:32,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:29:32,533 INFO L87 Difference]: Start difference. First operand 147 states and 176 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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) [2024-11-07 00:29:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:32,853 INFO L93 Difference]: Finished difference Result 326 states and 415 transitions. [2024-11-07 00:29:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 00:29:32,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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 56 [2024-11-07 00:29:32,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:32,854 INFO L225 Difference]: With dead ends: 326 [2024-11-07 00:29:32,854 INFO L226 Difference]: Without dead ends: 306 [2024-11-07 00:29:32,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-07 00:29:32,855 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 810 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:32,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 961 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:29:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-07 00:29:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 127. [2024-11-07 00:29:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 125 states have (on average 1.232) internal successors, (154), 126 states have internal predecessors, (154), 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) [2024-11-07 00:29:32,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 154 transitions. [2024-11-07 00:29:32,863 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 154 transitions. Word has length 56 [2024-11-07 00:29:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:32,863 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 154 transitions. [2024-11-07 00:29:32,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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) [2024-11-07 00:29:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 154 transitions. [2024-11-07 00:29:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-07 00:29:32,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:32,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:32,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:29:32,864 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:32,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:32,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1985133879, now seen corresponding path program 1 times [2024-11-07 00:29:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:32,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100704930] [2024-11-07 00:29:32,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:32,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:33,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:33,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100704930] [2024-11-07 00:29:33,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100704930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:33,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:33,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 00:29:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88928966] [2024-11-07 00:29:33,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:33,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 00:29:33,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:33,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 00:29:33,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-07 00:29:33,182 INFO L87 Difference]: Start difference. First operand 127 states and 154 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 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) [2024-11-07 00:29:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:33,562 INFO L93 Difference]: Finished difference Result 185 states and 234 transitions. [2024-11-07 00:29:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:29:33,563 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 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 57 [2024-11-07 00:29:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:33,563 INFO L225 Difference]: With dead ends: 185 [2024-11-07 00:29:33,563 INFO L226 Difference]: Without dead ends: 169 [2024-11-07 00:29:33,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2024-11-07 00:29:33,564 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 456 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:33,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1139 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:29:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-07 00:29:33,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 104. [2024-11-07 00:29:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 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) [2024-11-07 00:29:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2024-11-07 00:29:33,568 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 57 [2024-11-07 00:29:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:33,568 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2024-11-07 00:29:33,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 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) [2024-11-07 00:29:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2024-11-07 00:29:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-07 00:29:33,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:33,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:33,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:29:33,570 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:33,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:33,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1117882514, now seen corresponding path program 1 times [2024-11-07 00:29:33,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:33,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774430202] [2024-11-07 00:29:33,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:33,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:33,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774430202] [2024-11-07 00:29:33,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774430202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:33,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:33,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419825480] [2024-11-07 00:29:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:33,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:33,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:33,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:33,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:33,633 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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) [2024-11-07 00:29:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:33,689 INFO L93 Difference]: Finished difference Result 362 states and 506 transitions. [2024-11-07 00:29:33,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 00:29:33,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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 75 [2024-11-07 00:29:33,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:33,690 INFO L225 Difference]: With dead ends: 362 [2024-11-07 00:29:33,691 INFO L226 Difference]: Without dead ends: 319 [2024-11-07 00:29:33,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:29:33,692 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 526 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:33,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 457 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:33,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-07 00:29:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 145. [2024-11-07 00:29:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 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) [2024-11-07 00:29:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2024-11-07 00:29:33,701 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 75 [2024-11-07 00:29:33,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:33,701 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2024-11-07 00:29:33,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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) [2024-11-07 00:29:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2024-11-07 00:29:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:29:33,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:33,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:33,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:29:33,702 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:33,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1016465065, now seen corresponding path program 1 times [2024-11-07 00:29:33,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:33,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883736869] [2024-11-07 00:29:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:33,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:33,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:33,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883736869] [2024-11-07 00:29:33,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883736869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:33,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:33,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:33,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546652634] [2024-11-07 00:29:33,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:33,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:33,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:33,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:33,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:33,771 INFO L87 Difference]: Start difference. First operand 145 states and 188 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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) [2024-11-07 00:29:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:33,828 INFO L93 Difference]: Finished difference Result 440 states and 618 transitions. [2024-11-07 00:29:33,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:33,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-07 00:29:33,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:33,829 INFO L225 Difference]: With dead ends: 440 [2024-11-07 00:29:33,830 INFO L226 Difference]: Without dead ends: 356 [2024-11-07 00:29:33,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:33,830 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 292 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:33,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 412 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-07 00:29:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 227. [2024-11-07 00:29:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.3672566371681416) internal successors, (309), 226 states have internal predecessors, (309), 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) [2024-11-07 00:29:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 309 transitions. [2024-11-07 00:29:33,837 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 309 transitions. Word has length 77 [2024-11-07 00:29:33,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:33,837 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 309 transitions. [2024-11-07 00:29:33,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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) [2024-11-07 00:29:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 309 transitions. [2024-11-07 00:29:33,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:29:33,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:33,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:33,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:29:33,838 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:33,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:33,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1101947074, now seen corresponding path program 1 times [2024-11-07 00:29:33,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:33,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310522500] [2024-11-07 00:29:33,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:33,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:33,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:33,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:33,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310522500] [2024-11-07 00:29:33,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310522500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:33,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:33,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:33,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157422149] [2024-11-07 00:29:33,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:33,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:33,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:33,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:33,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:33,882 INFO L87 Difference]: Start difference. First operand 227 states and 309 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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) [2024-11-07 00:29:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:33,901 INFO L93 Difference]: Finished difference Result 533 states and 751 transitions. [2024-11-07 00:29:33,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:33,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2024-11-07 00:29:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:33,903 INFO L225 Difference]: With dead ends: 533 [2024-11-07 00:29:33,903 INFO L226 Difference]: Without dead ends: 367 [2024-11-07 00:29:33,904 INFO L431 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 [2024-11-07 00:29:33,906 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 50 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:33,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 287 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-07 00:29:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2024-11-07 00:29:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.3681318681318682) internal successors, (498), 364 states have internal predecessors, (498), 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) [2024-11-07 00:29:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 498 transitions. [2024-11-07 00:29:33,917 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 498 transitions. Word has length 77 [2024-11-07 00:29:33,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:33,917 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 498 transitions. [2024-11-07 00:29:33,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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) [2024-11-07 00:29:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 498 transitions. [2024-11-07 00:29:33,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:29:33,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:33,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:33,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:29:33,919 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:33,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:33,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1035453562, now seen corresponding path program 1 times [2024-11-07 00:29:33,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:33,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910713456] [2024-11-07 00:29:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:33,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:33,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910713456] [2024-11-07 00:29:33,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910713456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:33,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:33,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:33,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086314128] [2024-11-07 00:29:33,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:33,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:33,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:33,973 INFO L87 Difference]: Start difference. First operand 365 states and 498 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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) [2024-11-07 00:29:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:33,994 INFO L93 Difference]: Finished difference Result 671 states and 932 transitions. [2024-11-07 00:29:33,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:33,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 77 [2024-11-07 00:29:33,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:33,997 INFO L225 Difference]: With dead ends: 671 [2024-11-07 00:29:33,997 INFO L226 Difference]: Without dead ends: 367 [2024-11-07 00:29:33,997 INFO L431 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 [2024-11-07 00:29:33,998 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:33,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 207 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-07 00:29:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2024-11-07 00:29:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.3626373626373627) internal successors, (496), 364 states have internal predecessors, (496), 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) [2024-11-07 00:29:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 496 transitions. [2024-11-07 00:29:34,005 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 496 transitions. Word has length 77 [2024-11-07 00:29:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:34,006 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 496 transitions. [2024-11-07 00:29:34,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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) [2024-11-07 00:29:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 496 transitions. [2024-11-07 00:29:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:29:34,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:34,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:34,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 00:29:34,007 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:34,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:34,007 INFO L85 PathProgramCache]: Analyzing trace with hash -401787049, now seen corresponding path program 1 times [2024-11-07 00:29:34,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:34,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780825399] [2024-11-07 00:29:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:34,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:34,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:34,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780825399] [2024-11-07 00:29:34,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780825399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:34,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:34,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369362242] [2024-11-07 00:29:34,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:34,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:34,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:34,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:34,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:34,086 INFO L87 Difference]: Start difference. First operand 365 states and 496 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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) [2024-11-07 00:29:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:34,130 INFO L93 Difference]: Finished difference Result 902 states and 1255 transitions. [2024-11-07 00:29:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-07 00:29:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:34,133 INFO L225 Difference]: With dead ends: 902 [2024-11-07 00:29:34,133 INFO L226 Difference]: Without dead ends: 749 [2024-11-07 00:29:34,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:34,136 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 286 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:34,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 455 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-11-07 00:29:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 592. [2024-11-07 00:29:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.3824027072758038) internal successors, (817), 591 states have internal predecessors, (817), 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) [2024-11-07 00:29:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 817 transitions. [2024-11-07 00:29:34,147 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 817 transitions. Word has length 77 [2024-11-07 00:29:34,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:34,147 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 817 transitions. [2024-11-07 00:29:34,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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) [2024-11-07 00:29:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 817 transitions. [2024-11-07 00:29:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-07 00:29:34,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:34,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:34,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 00:29:34,151 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:34,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:34,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1826714967, now seen corresponding path program 1 times [2024-11-07 00:29:34,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:34,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982955119] [2024-11-07 00:29:34,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:34,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:34,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:34,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982955119] [2024-11-07 00:29:34,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982955119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:34,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:34,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:29:34,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746862304] [2024-11-07 00:29:34,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:34,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:29:34,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:34,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:29:34,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:29:34,217 INFO L87 Difference]: Start difference. First operand 592 states and 817 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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) [2024-11-07 00:29:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:34,263 INFO L93 Difference]: Finished difference Result 1053 states and 1469 transitions. [2024-11-07 00:29:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:29:34,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 77 [2024-11-07 00:29:34,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:34,266 INFO L225 Difference]: With dead ends: 1053 [2024-11-07 00:29:34,266 INFO L226 Difference]: Without dead ends: 900 [2024-11-07 00:29:34,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 00:29:34,267 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 286 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:34,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 418 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-07 00:29:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 743. [2024-11-07 00:29:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.389487870619946) internal successors, (1031), 742 states have internal predecessors, (1031), 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) [2024-11-07 00:29:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1031 transitions. [2024-11-07 00:29:34,283 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1031 transitions. Word has length 77 [2024-11-07 00:29:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:34,283 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1031 transitions. [2024-11-07 00:29:34,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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) [2024-11-07 00:29:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1031 transitions. [2024-11-07 00:29:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:29:34,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:34,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:34,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 00:29:34,285 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:34,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:34,286 INFO L85 PathProgramCache]: Analyzing trace with hash 275968985, now seen corresponding path program 1 times [2024-11-07 00:29:34,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:34,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393622388] [2024-11-07 00:29:34,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:34,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:34,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:34,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393622388] [2024-11-07 00:29:34,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393622388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:34,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:34,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:34,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130629106] [2024-11-07 00:29:34,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:34,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:34,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:34,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:34,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:34,350 INFO L87 Difference]: Start difference. First operand 743 states and 1031 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2024-11-07 00:29:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:34,369 INFO L93 Difference]: Finished difference Result 1864 states and 2602 transitions. [2024-11-07 00:29:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:34,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2024-11-07 00:29:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:34,373 INFO L225 Difference]: With dead ends: 1864 [2024-11-07 00:29:34,373 INFO L226 Difference]: Without dead ends: 1182 [2024-11-07 00:29:34,376 INFO L431 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 [2024-11-07 00:29:34,376 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 59 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:34,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 267 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-11-07 00:29:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1108. [2024-11-07 00:29:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1107 states have (on average 1.3794037940379404) internal successors, (1527), 1107 states have internal predecessors, (1527), 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) [2024-11-07 00:29:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1527 transitions. [2024-11-07 00:29:34,397 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1527 transitions. Word has length 78 [2024-11-07 00:29:34,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:34,397 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1527 transitions. [2024-11-07 00:29:34,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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) [2024-11-07 00:29:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1527 transitions. [2024-11-07 00:29:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:29:34,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:34,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:34,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 00:29:34,398 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:34,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash -163971304, now seen corresponding path program 1 times [2024-11-07 00:29:34,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:34,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69124888] [2024-11-07 00:29:34,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:34,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:34,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69124888] [2024-11-07 00:29:34,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69124888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:34,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:34,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:34,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537133584] [2024-11-07 00:29:34,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:34,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:34,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:34,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:34,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:34,434 INFO L87 Difference]: Start difference. First operand 1108 states and 1527 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2024-11-07 00:29:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:34,456 INFO L93 Difference]: Finished difference Result 2198 states and 3047 transitions. [2024-11-07 00:29:34,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:34,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2024-11-07 00:29:34,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:34,460 INFO L225 Difference]: With dead ends: 2198 [2024-11-07 00:29:34,460 INFO L226 Difference]: Without dead ends: 1151 [2024-11-07 00:29:34,461 INFO L431 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 [2024-11-07 00:29:34,461 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:34,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 202 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-07 00:29:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1149. [2024-11-07 00:29:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.363240418118467) internal successors, (1565), 1148 states have internal predecessors, (1565), 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) [2024-11-07 00:29:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1565 transitions. [2024-11-07 00:29:34,499 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1565 transitions. Word has length 79 [2024-11-07 00:29:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:34,499 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1565 transitions. [2024-11-07 00:29:34,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2024-11-07 00:29:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1565 transitions. [2024-11-07 00:29:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:29:34,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:34,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:34,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 00:29:34,501 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:34,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:34,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1432796505, now seen corresponding path program 1 times [2024-11-07 00:29:34,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:34,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478536549] [2024-11-07 00:29:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:34,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:34,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:34,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478536549] [2024-11-07 00:29:34,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478536549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:34,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:34,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:34,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501294644] [2024-11-07 00:29:34,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:34,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:34,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:34,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:34,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:34,561 INFO L87 Difference]: Start difference. First operand 1149 states and 1565 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2024-11-07 00:29:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:34,582 INFO L93 Difference]: Finished difference Result 3213 states and 4369 transitions. [2024-11-07 00:29:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:34,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2024-11-07 00:29:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:34,589 INFO L225 Difference]: With dead ends: 3213 [2024-11-07 00:29:34,589 INFO L226 Difference]: Without dead ends: 2125 [2024-11-07 00:29:34,590 INFO L431 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 [2024-11-07 00:29:34,591 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 52 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:34,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 263 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2024-11-07 00:29:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2011. [2024-11-07 00:29:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2011 states, 2010 states have (on average 1.3432835820895523) internal successors, (2700), 2010 states have internal predecessors, (2700), 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) [2024-11-07 00:29:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2700 transitions. [2024-11-07 00:29:34,623 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2700 transitions. Word has length 79 [2024-11-07 00:29:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:34,623 INFO L471 AbstractCegarLoop]: Abstraction has 2011 states and 2700 transitions. [2024-11-07 00:29:34,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2024-11-07 00:29:34,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2700 transitions. [2024-11-07 00:29:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:29:34,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:34,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:34,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 00:29:34,625 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:34,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:34,625 INFO L85 PathProgramCache]: Analyzing trace with hash -21206962, now seen corresponding path program 1 times [2024-11-07 00:29:34,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:34,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405365433] [2024-11-07 00:29:34,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:34,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:34,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:34,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405365433] [2024-11-07 00:29:34,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405365433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:34,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:34,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:29:34,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209437070] [2024-11-07 00:29:34,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:34,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:29:34,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:34,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:29:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:29:34,689 INFO L87 Difference]: Start difference. First operand 2011 states and 2700 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2024-11-07 00:29:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:34,719 INFO L93 Difference]: Finished difference Result 5687 states and 7578 transitions. [2024-11-07 00:29:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:29:34,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2024-11-07 00:29:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:34,728 INFO L225 Difference]: With dead ends: 5687 [2024-11-07 00:29:34,729 INFO L226 Difference]: Without dead ends: 3737 [2024-11-07 00:29:34,731 INFO L431 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 [2024-11-07 00:29:34,731 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 42 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:34,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 263 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:34,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2024-11-07 00:29:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3511. [2024-11-07 00:29:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 3510 states have (on average 1.3122507122507123) internal successors, (4606), 3510 states have internal predecessors, (4606), 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) [2024-11-07 00:29:34,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 4606 transitions. [2024-11-07 00:29:34,796 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 4606 transitions. Word has length 80 [2024-11-07 00:29:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:34,796 INFO L471 AbstractCegarLoop]: Abstraction has 3511 states and 4606 transitions. [2024-11-07 00:29:34,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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) [2024-11-07 00:29:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 4606 transitions. [2024-11-07 00:29:34,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 00:29:34,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:34,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:34,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 00:29:34,797 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:34,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:34,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1223980109, now seen corresponding path program 1 times [2024-11-07 00:29:34,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:34,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61263738] [2024-11-07 00:29:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:34,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:34,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61263738] [2024-11-07 00:29:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61263738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:29:34,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:29:34,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:29:34,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553638682] [2024-11-07 00:29:34,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:29:34,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:29:34,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:34,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:29:34,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:29:34,954 INFO L87 Difference]: Start difference. First operand 3511 states and 4606 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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) [2024-11-07 00:29:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:34,987 INFO L93 Difference]: Finished difference Result 3609 states and 4735 transitions. [2024-11-07 00:29:34,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:29:34,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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 81 [2024-11-07 00:29:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:34,996 INFO L225 Difference]: With dead ends: 3609 [2024-11-07 00:29:34,997 INFO L226 Difference]: Without dead ends: 3607 [2024-11-07 00:29:34,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:29:34,998 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:34,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 603 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:29:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2024-11-07 00:29:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3607. [2024-11-07 00:29:35,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3607 states, 3606 states have (on average 1.2928452579034941) internal successors, (4662), 3606 states have internal predecessors, (4662), 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) [2024-11-07 00:29:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 4662 transitions. [2024-11-07 00:29:35,051 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 4662 transitions. Word has length 81 [2024-11-07 00:29:35,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:35,052 INFO L471 AbstractCegarLoop]: Abstraction has 3607 states and 4662 transitions. [2024-11-07 00:29:35,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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) [2024-11-07 00:29:35,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 4662 transitions. [2024-11-07 00:29:35,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 00:29:35,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:35,053 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:35,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 00:29:35,053 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:35,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1680108859, now seen corresponding path program 1 times [2024-11-07 00:29:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:35,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030564632] [2024-11-07 00:29:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:35,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:35,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:35,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030564632] [2024-11-07 00:29:35,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030564632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:29:35,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203058176] [2024-11-07 00:29:35,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:35,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:29:35,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:35,246 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:29:35,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 00:29:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:35,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 00:29:35,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:29:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:36,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:29:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:37,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203058176] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:29:37,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:29:37,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-11-07 00:29:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107409664] [2024-11-07 00:29:37,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:29:37,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 00:29:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:37,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 00:29:37,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-11-07 00:29:37,282 INFO L87 Difference]: Start difference. First operand 3607 states and 4662 transitions. Second operand has 25 states, 25 states have (on average 10.4) internal successors, (260), 24 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) [2024-11-07 00:29:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:29:38,998 INFO L93 Difference]: Finished difference Result 18283 states and 23518 transitions. [2024-11-07 00:29:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-07 00:29:38,999 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 10.4) internal successors, (260), 24 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) Word has length 103 [2024-11-07 00:29:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:29:39,058 INFO L225 Difference]: With dead ends: 18283 [2024-11-07 00:29:39,058 INFO L226 Difference]: Without dead ends: 14737 [2024-11-07 00:29:39,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=848, Invalid=2934, Unknown=0, NotChecked=0, Total=3782 [2024-11-07 00:29:39,070 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 1712 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:29:39,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 874 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:29:39,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14737 states. [2024-11-07 00:29:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14737 to 7683. [2024-11-07 00:29:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7683 states, 7682 states have (on average 1.2861234053631867) internal successors, (9880), 7682 states have internal predecessors, (9880), 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) [2024-11-07 00:29:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 9880 transitions. [2024-11-07 00:29:39,342 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 9880 transitions. Word has length 103 [2024-11-07 00:29:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:29:39,342 INFO L471 AbstractCegarLoop]: Abstraction has 7683 states and 9880 transitions. [2024-11-07 00:29:39,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.4) internal successors, (260), 24 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) [2024-11-07 00:29:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 9880 transitions. [2024-11-07 00:29:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 00:29:39,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:29:39,346 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:29:39,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 00:29:39,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-07 00:29:39,548 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-07 00:29:39,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:29:39,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1319335917, now seen corresponding path program 1 times [2024-11-07 00:29:39,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:29:39,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290970751] [2024-11-07 00:29:39,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:39,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:29:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:40,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:29:40,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290970751] [2024-11-07 00:29:40,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290970751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:29:40,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109595908] [2024-11-07 00:29:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:29:40,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:29:40,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:29:40,022 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:29:40,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 00:29:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:29:40,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 00:29:40,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:29:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:41,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:29:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:29:43,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109595908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:29:43,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:29:43,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 37 [2024-11-07 00:29:43,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605015332] [2024-11-07 00:29:43,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:29:43,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-07 00:29:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:29:43,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-07 00:29:43,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1257, Unknown=0, NotChecked=0, Total=1406 [2024-11-07 00:29:43,502 INFO L87 Difference]: Start difference. First operand 7683 states and 9880 transitions. Second operand has 38 states, 38 states have (on average 7.5) internal successors, (285), 37 states have internal predecessors, (285), 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)