./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-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_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-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', '6c42bca5197a9d3789842b36ec154209e56c2a7008fcac4a7338bcb4050288a1'] 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_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-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 6c42bca5197a9d3789842b36ec154209e56c2a7008fcac4a7338bcb4050288a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:19:17,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:19:17,770 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:19:17,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:19:17,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:19:17,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:19:17,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:19:17,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:19:17,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:19:17,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:19:17,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:19:17,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:19:17,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:19:17,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:19:17,800 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:19:17,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:19:17,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:19:17,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:19:17,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:19:17,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:19:17,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:19:17,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:19:17,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:19:17,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:19:17,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:19:17,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:19:17,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:19:17,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:19:17,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:19:17,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:19:17,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:19:17,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:19:17,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:19:17,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:19:17,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:19:17,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:19:17,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:19:17,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:19:17,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:19:17,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:19:17,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:19:17,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:19:17,806 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 -> 6c42bca5197a9d3789842b36ec154209e56c2a7008fcac4a7338bcb4050288a1 [2024-11-07 00:19:18,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:19:18,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:19:18,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:19:18,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:19:18,169 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:19:18,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-07 00:19:19,619 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:19:20,038 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:19:20,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-07 00:19:20,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4332c976c/e1f6195d8ed54bf69af0e42b969affa9/FLAGea512e6f1 [2024-11-07 00:19:20,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4332c976c/e1f6195d8ed54bf69af0e42b969affa9 [2024-11-07 00:19:20,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:19:20,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:19:20,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:19:20,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:19:20,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:19:20,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:19:20" (1/1) ... [2024-11-07 00:19:20,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d044df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:20, skipping insertion in model container [2024-11-07 00:19:20,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:19:20" (1/1) ... [2024-11-07 00:19:20,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:19:20,658 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_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[24502,24515] [2024-11-07 00:19:20,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:19:20,797 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:19:20,909 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_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[24502,24515] [2024-11-07 00:19:21,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:19:21,023 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:19:21,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:21 WrapperNode [2024-11-07 00:19:21,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:19:21,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:19:21,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:19:21,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:19:21,033 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:19:21" (1/1) ... [2024-11-07 00:19:21,066 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:19:21" (1/1) ... [2024-11-07 00:19:21,212 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2318 [2024-11-07 00:19:21,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:19:21,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:19:21,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:19:21,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:19:21,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:21" (1/1) ... [2024-11-07 00:19:21,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:21" (1/1) ... [2024-11-07 00:19:21,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:21" (1/1) ... [2024-11-07 00:19:21,293 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:19:21,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:21" (1/1) ... [2024-11-07 00:19:21,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:21" (1/1) ... [2024-11-07 00:19:21,346 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:21" (1/1) ... [2024-11-07 00:19:21,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:21" (1/1) ... [2024-11-07 00:19:21,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:21" (1/1) ... [2024-11-07 00:19:21,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:21" (1/1) ... [2024-11-07 00:19:21,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:19:21,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:19:21,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:19:21,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:19:21,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:21" (1/1) ... [2024-11-07 00:19:21,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:19:21,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:19:21,451 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:19:21,458 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:19:21,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:19:21,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:19:21,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:19:21,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:19:21,637 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:19:21,639 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:19:23,668 INFO L? ?]: Removed 159 outVars from TransFormulas that were not future-live. [2024-11-07 00:19:23,668 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:19:23,713 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:19:23,713 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:19:23,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:19:23 BoogieIcfgContainer [2024-11-07 00:19:23,717 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:19:23,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:19:23,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:19:23,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:19:23,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:19:20" (1/3) ... [2024-11-07 00:19:23,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532b9fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:19:23, skipping insertion in model container [2024-11-07 00:19:23,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:19:21" (2/3) ... [2024-11-07 00:19:23,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532b9fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:19:23, skipping insertion in model container [2024-11-07 00:19:23,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:19:23" (3/3) ... [2024-11-07 00:19:23,728 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-07 00:19:23,745 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:19:23,745 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:19:23,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:19:23,853 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;@9f84a23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:19:23,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:19:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 592 states, 590 states have (on average 1.7881355932203389) internal successors, (1055), 591 states have internal predecessors, (1055), 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:19:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-07 00:19:23,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:23,893 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:23,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:23,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:23,901 INFO L85 PathProgramCache]: Analyzing trace with hash 888634146, now seen corresponding path program 1 times [2024-11-07 00:19:23,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:23,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777616070] [2024-11-07 00:19:23,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:23,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:24,971 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:19:24,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:24,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777616070] [2024-11-07 00:19:24,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777616070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:24,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:24,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:24,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743870029] [2024-11-07 00:19:24,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:24,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:24,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:25,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:25,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:25,010 INFO L87 Difference]: Start difference. First operand has 592 states, 590 states have (on average 1.7881355932203389) internal successors, (1055), 591 states have internal predecessors, (1055), 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 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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:19:25,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:25,313 INFO L93 Difference]: Finished difference Result 1084 states and 1917 transitions. [2024-11-07 00:19:25,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:25,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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 238 [2024-11-07 00:19:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:25,348 INFO L225 Difference]: With dead ends: 1084 [2024-11-07 00:19:25,348 INFO L226 Difference]: Without dead ends: 901 [2024-11-07 00:19:25,352 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:19:25,356 INFO L432 NwaCegarLoop]: 1009 mSDtfsCounter, 593 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:25,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1833 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:19:25,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-11-07 00:19:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 899. [2024-11-07 00:19:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 1.5701559020044544) internal successors, (1410), 898 states have internal predecessors, (1410), 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:19:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1410 transitions. [2024-11-07 00:19:25,502 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1410 transitions. Word has length 238 [2024-11-07 00:19:25,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:25,503 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1410 transitions. [2024-11-07 00:19:25,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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:19:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1410 transitions. [2024-11-07 00:19:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-07 00:19:25,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:25,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:25,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:19:25,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:25,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:25,519 INFO L85 PathProgramCache]: Analyzing trace with hash -749177318, now seen corresponding path program 1 times [2024-11-07 00:19:25,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:25,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221744697] [2024-11-07 00:19:25,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:25,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:26,911 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:19:26,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:26,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221744697] [2024-11-07 00:19:26,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221744697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:26,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:26,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:19:26,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892213942] [2024-11-07 00:19:26,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:26,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:19:26,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:26,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:19:26,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:26,918 INFO L87 Difference]: Start difference. First operand 899 states and 1410 transitions. Second operand has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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:19:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:27,206 INFO L93 Difference]: Finished difference Result 4385 states and 6863 transitions. [2024-11-07 00:19:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:19:27,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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 238 [2024-11-07 00:19:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:27,224 INFO L225 Difference]: With dead ends: 4385 [2024-11-07 00:19:27,224 INFO L226 Difference]: Without dead ends: 3497 [2024-11-07 00:19:27,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:19:27,230 INFO L432 NwaCegarLoop]: 1475 mSDtfsCounter, 2789 mSDsluCounter, 2321 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2789 SdHoareTripleChecker+Valid, 3796 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:27,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2789 Valid, 3796 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:19:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2024-11-07 00:19:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 1761. [2024-11-07 00:19:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1761 states, 1760 states have (on average 1.559090909090909) internal successors, (2744), 1760 states have internal predecessors, (2744), 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:19:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2744 transitions. [2024-11-07 00:19:27,361 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2744 transitions. Word has length 238 [2024-11-07 00:19:27,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:27,363 INFO L471 AbstractCegarLoop]: Abstraction has 1761 states and 2744 transitions. [2024-11-07 00:19:27,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.5) internal successors, (238), 4 states have internal predecessors, (238), 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:19:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2744 transitions. [2024-11-07 00:19:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-07 00:19:27,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:27,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:27,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:19:27,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:27,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:27,372 INFO L85 PathProgramCache]: Analyzing trace with hash -396010790, now seen corresponding path program 1 times [2024-11-07 00:19:27,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:27,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699578427] [2024-11-07 00:19:27,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:27,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:27,643 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:19:27,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:27,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699578427] [2024-11-07 00:19:27,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699578427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:27,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:27,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326266931] [2024-11-07 00:19:27,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:27,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:27,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:27,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:27,648 INFO L87 Difference]: Start difference. First operand 1761 states and 2744 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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:19:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:27,759 INFO L93 Difference]: Finished difference Result 5096 states and 7908 transitions. [2024-11-07 00:19:27,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:27,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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 240 [2024-11-07 00:19:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:27,777 INFO L225 Difference]: With dead ends: 5096 [2024-11-07 00:19:27,777 INFO L226 Difference]: Without dead ends: 3460 [2024-11-07 00:19:27,781 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:19:27,785 INFO L432 NwaCegarLoop]: 1732 mSDtfsCounter, 790 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:27,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 2610 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2024-11-07 00:19:27,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3458. [2024-11-07 00:19:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 3457 states have (on average 1.5501880242985246) internal successors, (5359), 3457 states have internal predecessors, (5359), 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:19:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 5359 transitions. [2024-11-07 00:19:27,932 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 5359 transitions. Word has length 240 [2024-11-07 00:19:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:27,932 INFO L471 AbstractCegarLoop]: Abstraction has 3458 states and 5359 transitions. [2024-11-07 00:19:27,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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:19:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 5359 transitions. [2024-11-07 00:19:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-07 00:19:27,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:27,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:27,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:19:27,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:27,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:27,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1683461535, now seen corresponding path program 1 times [2024-11-07 00:19:27,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:27,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622301633] [2024-11-07 00:19:27,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:27,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:28,110 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:19:28,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:28,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622301633] [2024-11-07 00:19:28,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622301633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:28,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:28,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:28,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286238592] [2024-11-07 00:19:28,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:28,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:28,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:28,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:28,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:28,113 INFO L87 Difference]: Start difference. First operand 3458 states and 5359 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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:19:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:28,280 INFO L93 Difference]: Finished difference Result 10307 states and 15961 transitions. [2024-11-07 00:19:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:28,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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 240 [2024-11-07 00:19:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:28,312 INFO L225 Difference]: With dead ends: 10307 [2024-11-07 00:19:28,312 INFO L226 Difference]: Without dead ends: 6887 [2024-11-07 00:19:28,320 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:19:28,321 INFO L432 NwaCegarLoop]: 1822 mSDtfsCounter, 908 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:28,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 2731 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6887 states. [2024-11-07 00:19:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6887 to 3477. [2024-11-07 00:19:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3477 states, 3476 states have (on average 1.5497698504027617) internal successors, (5387), 3476 states have internal predecessors, (5387), 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:19:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3477 states to 3477 states and 5387 transitions. [2024-11-07 00:19:28,519 INFO L78 Accepts]: Start accepts. Automaton has 3477 states and 5387 transitions. Word has length 240 [2024-11-07 00:19:28,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:28,519 INFO L471 AbstractCegarLoop]: Abstraction has 3477 states and 5387 transitions. [2024-11-07 00:19:28,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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:19:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3477 states and 5387 transitions. [2024-11-07 00:19:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-07 00:19:28,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:28,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:28,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:19:28,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:28,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:28,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2119940694, now seen corresponding path program 1 times [2024-11-07 00:19:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:28,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543405450] [2024-11-07 00:19:28,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:28,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:28,702 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:19:28,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:28,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543405450] [2024-11-07 00:19:28,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543405450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:28,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:28,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:28,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316098516] [2024-11-07 00:19:28,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:28,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:28,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:28,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:28,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:28,706 INFO L87 Difference]: Start difference. First operand 3477 states and 5387 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:19:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:28,772 INFO L93 Difference]: Finished difference Result 6916 states and 10707 transitions. [2024-11-07 00:19:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:28,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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 241 [2024-11-07 00:19:28,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:28,791 INFO L225 Difference]: With dead ends: 6916 [2024-11-07 00:19:28,791 INFO L226 Difference]: Without dead ends: 3495 [2024-11-07 00:19:28,796 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:19:28,799 INFO L432 NwaCegarLoop]: 932 mSDtfsCounter, 5 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:28,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1849 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:28,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2024-11-07 00:19:28,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3495. [2024-11-07 00:19:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3495 states, 3494 states have (on average 1.54779622209502) internal successors, (5408), 3494 states have internal predecessors, (5408), 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:19:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 5408 transitions. [2024-11-07 00:19:28,915 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 5408 transitions. Word has length 241 [2024-11-07 00:19:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:28,915 INFO L471 AbstractCegarLoop]: Abstraction has 3495 states and 5408 transitions. [2024-11-07 00:19:28,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:19:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 5408 transitions. [2024-11-07 00:19:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-07 00:19:28,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:28,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:28,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:19:28,924 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:28,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:28,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1326316299, now seen corresponding path program 1 times [2024-11-07 00:19:28,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:28,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007455003] [2024-11-07 00:19:28,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:28,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:29,243 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:19:29,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:29,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007455003] [2024-11-07 00:19:29,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007455003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:29,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:29,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:29,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428341765] [2024-11-07 00:19:29,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:29,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:29,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:29,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:29,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:29,246 INFO L87 Difference]: Start difference. First operand 3495 states and 5408 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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:19:29,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:29,380 INFO L93 Difference]: Finished difference Result 10026 states and 15449 transitions. [2024-11-07 00:19:29,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:29,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 242 [2024-11-07 00:19:29,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:29,424 INFO L225 Difference]: With dead ends: 10026 [2024-11-07 00:19:29,425 INFO L226 Difference]: Without dead ends: 6772 [2024-11-07 00:19:29,437 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:19:29,438 INFO L432 NwaCegarLoop]: 1794 mSDtfsCounter, 783 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 2672 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:29,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 2672 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6772 states. [2024-11-07 00:19:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6772 to 6770. [2024-11-07 00:19:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6770 states, 6769 states have (on average 1.5364160141823016) internal successors, (10400), 6769 states have internal predecessors, (10400), 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:19:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6770 states to 6770 states and 10400 transitions. [2024-11-07 00:19:29,669 INFO L78 Accepts]: Start accepts. Automaton has 6770 states and 10400 transitions. Word has length 242 [2024-11-07 00:19:29,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:29,670 INFO L471 AbstractCegarLoop]: Abstraction has 6770 states and 10400 transitions. [2024-11-07 00:19:29,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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:19:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 6770 states and 10400 transitions. [2024-11-07 00:19:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-07 00:19:29,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:29,684 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:29,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:19:29,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:29,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1679226606, now seen corresponding path program 1 times [2024-11-07 00:19:29,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:29,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413129854] [2024-11-07 00:19:29,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:29,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:30,477 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:19:30,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:30,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413129854] [2024-11-07 00:19:30,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413129854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:30,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:30,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:19:30,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107376625] [2024-11-07 00:19:30,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:30,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:19:30,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:30,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:19:30,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:30,480 INFO L87 Difference]: Start difference. First operand 6770 states and 10400 transitions. Second operand has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 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:19:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:30,763 INFO L93 Difference]: Finished difference Result 26034 states and 39868 transitions. [2024-11-07 00:19:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:19:30,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 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 242 [2024-11-07 00:19:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:30,814 INFO L225 Difference]: With dead ends: 26034 [2024-11-07 00:19:30,814 INFO L226 Difference]: Without dead ends: 19440 [2024-11-07 00:19:30,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:30,834 INFO L432 NwaCegarLoop]: 1887 mSDtfsCounter, 1973 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1973 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:30,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1973 Valid, 3601 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19440 states. [2024-11-07 00:19:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19440 to 13124. [2024-11-07 00:19:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13124 states, 13123 states have (on average 1.523432142040692) internal successors, (19992), 13123 states have internal predecessors, (19992), 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:19:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13124 states to 13124 states and 19992 transitions. [2024-11-07 00:19:31,385 INFO L78 Accepts]: Start accepts. Automaton has 13124 states and 19992 transitions. Word has length 242 [2024-11-07 00:19:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:31,386 INFO L471 AbstractCegarLoop]: Abstraction has 13124 states and 19992 transitions. [2024-11-07 00:19:31,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.5) internal successors, (242), 4 states have internal predecessors, (242), 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:19:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 13124 states and 19992 transitions. [2024-11-07 00:19:31,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-07 00:19:31,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:31,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:31,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:19:31,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:31,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:31,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1986050080, now seen corresponding path program 1 times [2024-11-07 00:19:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:31,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918740437] [2024-11-07 00:19:31,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:32,364 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:19:32,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:32,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918740437] [2024-11-07 00:19:32,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918740437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:32,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:19:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107841232] [2024-11-07 00:19:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:32,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:19:32,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:32,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:19:32,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:32,368 INFO L87 Difference]: Start difference. First operand 13124 states and 19992 transitions. Second operand has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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:19:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:32,605 INFO L93 Difference]: Finished difference Result 38397 states and 58300 transitions. [2024-11-07 00:19:32,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:19:32,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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 244 [2024-11-07 00:19:32,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:32,678 INFO L225 Difference]: With dead ends: 38397 [2024-11-07 00:19:32,679 INFO L226 Difference]: Without dead ends: 26107 [2024-11-07 00:19:32,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:32,708 INFO L432 NwaCegarLoop]: 1811 mSDtfsCounter, 865 mSDsluCounter, 2720 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 4531 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:32,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 4531 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26107 states. [2024-11-07 00:19:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26107 to 14041. [2024-11-07 00:19:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14041 states, 14040 states have (on average 1.5354700854700856) internal successors, (21558), 14040 states have internal predecessors, (21558), 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:19:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14041 states to 14041 states and 21558 transitions. [2024-11-07 00:19:33,334 INFO L78 Accepts]: Start accepts. Automaton has 14041 states and 21558 transitions. Word has length 244 [2024-11-07 00:19:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:33,334 INFO L471 AbstractCegarLoop]: Abstraction has 14041 states and 21558 transitions. [2024-11-07 00:19:33,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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:19:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 14041 states and 21558 transitions. [2024-11-07 00:19:33,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-07 00:19:33,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:33,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:33,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:19:33,360 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:33,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:33,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1595792642, now seen corresponding path program 1 times [2024-11-07 00:19:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:33,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968948805] [2024-11-07 00:19:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:33,569 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:19:33,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:33,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968948805] [2024-11-07 00:19:33,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968948805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:33,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:33,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223667713] [2024-11-07 00:19:33,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:33,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:33,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:33,575 INFO L87 Difference]: Start difference. First operand 14041 states and 21558 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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:19:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:33,888 INFO L93 Difference]: Finished difference Result 40098 states and 61263 transitions. [2024-11-07 00:19:33,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:33,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 244 [2024-11-07 00:19:33,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:33,960 INFO L225 Difference]: With dead ends: 40098 [2024-11-07 00:19:33,960 INFO L226 Difference]: Without dead ends: 27172 [2024-11-07 00:19:33,984 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:19:33,987 INFO L432 NwaCegarLoop]: 1780 mSDtfsCounter, 770 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:33,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 2658 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27172 states. [2024-11-07 00:19:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27172 to 27170. [2024-11-07 00:19:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27170 states, 27169 states have (on average 1.5226176892782215) internal successors, (41368), 27169 states have internal predecessors, (41368), 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:19:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27170 states to 27170 states and 41368 transitions. [2024-11-07 00:19:34,803 INFO L78 Accepts]: Start accepts. Automaton has 27170 states and 41368 transitions. Word has length 244 [2024-11-07 00:19:34,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:34,803 INFO L471 AbstractCegarLoop]: Abstraction has 27170 states and 41368 transitions. [2024-11-07 00:19:34,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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:19:34,804 INFO L276 IsEmpty]: Start isEmpty. Operand 27170 states and 41368 transitions. [2024-11-07 00:19:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-07 00:19:34,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:34,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:34,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:19:34,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:34,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1348262658, now seen corresponding path program 1 times [2024-11-07 00:19:34,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:34,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345981034] [2024-11-07 00:19:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:34,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:35,004 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:19:35,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:35,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345981034] [2024-11-07 00:19:35,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345981034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:35,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:35,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:35,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921153168] [2024-11-07 00:19:35,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:35,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:35,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:35,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:35,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:35,007 INFO L87 Difference]: Start difference. First operand 27170 states and 41368 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:19:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:35,305 INFO L93 Difference]: Finished difference Result 75526 states and 113766 transitions. [2024-11-07 00:19:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:35,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 246 [2024-11-07 00:19:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:35,446 INFO L225 Difference]: With dead ends: 75526 [2024-11-07 00:19:35,447 INFO L226 Difference]: Without dead ends: 51364 [2024-11-07 00:19:35,628 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:19:35,630 INFO L432 NwaCegarLoop]: 922 mSDtfsCounter, 769 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:35,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1836 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51364 states. [2024-11-07 00:19:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51364 to 27650. [2024-11-07 00:19:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27650 states, 27649 states have (on average 1.5199103041701327) internal successors, (42024), 27649 states have internal predecessors, (42024), 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:19:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27650 states to 27650 states and 42024 transitions. [2024-11-07 00:19:36,650 INFO L78 Accepts]: Start accepts. Automaton has 27650 states and 42024 transitions. Word has length 246 [2024-11-07 00:19:36,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:36,650 INFO L471 AbstractCegarLoop]: Abstraction has 27650 states and 42024 transitions. [2024-11-07 00:19:36,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:19:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 27650 states and 42024 transitions. [2024-11-07 00:19:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-07 00:19:36,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:36,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:36,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:19:36,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:36,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1198751225, now seen corresponding path program 1 times [2024-11-07 00:19:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:36,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628993977] [2024-11-07 00:19:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:36,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:36,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:19:36,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:36,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628993977] [2024-11-07 00:19:36,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628993977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:36,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:36,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:36,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948127071] [2024-11-07 00:19:36,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:36,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:36,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:36,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:36,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:36,882 INFO L87 Difference]: Start difference. First operand 27650 states and 42024 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:19:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:37,190 INFO L93 Difference]: Finished difference Result 76686 states and 115422 transitions. [2024-11-07 00:19:37,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:37,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 246 [2024-11-07 00:19:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:37,341 INFO L225 Difference]: With dead ends: 76686 [2024-11-07 00:19:37,341 INFO L226 Difference]: Without dead ends: 52236 [2024-11-07 00:19:37,389 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:19:37,390 INFO L432 NwaCegarLoop]: 1772 mSDtfsCounter, 804 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 2650 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:37,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 2650 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:37,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52236 states. [2024-11-07 00:19:38,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52236 to 52234. [2024-11-07 00:19:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52234 states, 52233 states have (on average 1.500047862462428) internal successors, (78352), 52233 states have internal predecessors, (78352), 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:19:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52234 states to 52234 states and 78352 transitions. [2024-11-07 00:19:38,498 INFO L78 Accepts]: Start accepts. Automaton has 52234 states and 78352 transitions. Word has length 246 [2024-11-07 00:19:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:38,499 INFO L471 AbstractCegarLoop]: Abstraction has 52234 states and 78352 transitions. [2024-11-07 00:19:38,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:19:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 52234 states and 78352 transitions. [2024-11-07 00:19:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-07 00:19:38,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:38,551 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:38,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:19:38,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:38,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:38,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1987202927, now seen corresponding path program 1 times [2024-11-07 00:19:38,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:38,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915996587] [2024-11-07 00:19:38,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:38,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:38,707 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:19:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915996587] [2024-11-07 00:19:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915996587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:38,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:38,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971411438] [2024-11-07 00:19:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:38,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:38,709 INFO L87 Difference]: Start difference. First operand 52234 states and 78352 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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:19:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:39,302 INFO L93 Difference]: Finished difference Result 100900 states and 150757 transitions. [2024-11-07 00:19:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:39,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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 247 [2024-11-07 00:19:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:39,462 INFO L225 Difference]: With dead ends: 100900 [2024-11-07 00:19:39,462 INFO L226 Difference]: Without dead ends: 53334 [2024-11-07 00:19:39,516 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:19:39,517 INFO L432 NwaCegarLoop]: 932 mSDtfsCounter, 7 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1848 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:19:39,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1848 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53334 states. [2024-11-07 00:19:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53334 to 53334. [2024-11-07 00:19:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53334 states, 53333 states have (on average 1.4939343370896068) internal successors, (79676), 53333 states have internal predecessors, (79676), 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:19:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53334 states to 53334 states and 79676 transitions. [2024-11-07 00:19:40,638 INFO L78 Accepts]: Start accepts. Automaton has 53334 states and 79676 transitions. Word has length 247 [2024-11-07 00:19:40,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:40,639 INFO L471 AbstractCegarLoop]: Abstraction has 53334 states and 79676 transitions. [2024-11-07 00:19:40,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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:19:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 53334 states and 79676 transitions. [2024-11-07 00:19:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-07 00:19:40,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:40,690 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:40,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:19:40,691 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:40,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash -542835919, now seen corresponding path program 1 times [2024-11-07 00:19:40,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:40,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141866490] [2024-11-07 00:19:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:40,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:41,699 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:19:41,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:41,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141866490] [2024-11-07 00:19:41,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141866490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:41,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:41,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:19:41,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127579794] [2024-11-07 00:19:41,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:41,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:19:41,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:41,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:19:41,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:41,702 INFO L87 Difference]: Start difference. First operand 53334 states and 79676 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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:19:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:42,081 INFO L93 Difference]: Finished difference Result 107276 states and 160142 transitions. [2024-11-07 00:19:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:19:42,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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 248 [2024-11-07 00:19:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:42,248 INFO L225 Difference]: With dead ends: 107276 [2024-11-07 00:19:42,248 INFO L226 Difference]: Without dead ends: 58434 [2024-11-07 00:19:42,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:42,311 INFO L432 NwaCegarLoop]: 1037 mSDtfsCounter, 92 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:42,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 2983 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58434 states. [2024-11-07 00:19:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58434 to 56838. [2024-11-07 00:19:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56838 states, 56837 states have (on average 1.5032285307106286) internal successors, (85439), 56837 states have internal predecessors, (85439), 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:19:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56838 states to 56838 states and 85439 transitions. [2024-11-07 00:19:43,706 INFO L78 Accepts]: Start accepts. Automaton has 56838 states and 85439 transitions. Word has length 248 [2024-11-07 00:19:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:43,708 INFO L471 AbstractCegarLoop]: Abstraction has 56838 states and 85439 transitions. [2024-11-07 00:19:43,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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:19:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 56838 states and 85439 transitions. [2024-11-07 00:19:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-07 00:19:43,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:43,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:43,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:19:43,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:43,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1628469204, now seen corresponding path program 1 times [2024-11-07 00:19:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:43,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47048116] [2024-11-07 00:19:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:43,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:44,608 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:19:44,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:44,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47048116] [2024-11-07 00:19:44,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47048116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:44,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:44,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:19:44,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573052885] [2024-11-07 00:19:44,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:44,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:19:44,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:44,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:19:44,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:44,612 INFO L87 Difference]: Start difference. First operand 56838 states and 85439 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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:19:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:44,915 INFO L93 Difference]: Finished difference Result 98504 states and 147176 transitions. [2024-11-07 00:19:44,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:19:44,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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 248 [2024-11-07 00:19:44,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:45,009 INFO L225 Difference]: With dead ends: 98504 [2024-11-07 00:19:45,009 INFO L226 Difference]: Without dead ends: 50786 [2024-11-07 00:19:45,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:45,066 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 90 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 3012 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:45,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 3012 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50786 states. [2024-11-07 00:19:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50786 to 50086. [2024-11-07 00:19:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50086 states, 50085 states have (on average 1.5047818708196066) internal successors, (75367), 50085 states have internal predecessors, (75367), 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:19:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50086 states to 50086 states and 75367 transitions. [2024-11-07 00:19:46,096 INFO L78 Accepts]: Start accepts. Automaton has 50086 states and 75367 transitions. Word has length 248 [2024-11-07 00:19:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:46,096 INFO L471 AbstractCegarLoop]: Abstraction has 50086 states and 75367 transitions. [2024-11-07 00:19:46,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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:19:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 50086 states and 75367 transitions. [2024-11-07 00:19:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-07 00:19:46,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:46,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:46,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:19:46,156 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:46,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:46,157 INFO L85 PathProgramCache]: Analyzing trace with hash -971257748, now seen corresponding path program 1 times [2024-11-07 00:19:46,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:46,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102557333] [2024-11-07 00:19:46,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:46,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:46,372 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:19:46,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:46,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102557333] [2024-11-07 00:19:46,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102557333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:46,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:46,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:46,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062444228] [2024-11-07 00:19:46,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:46,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:46,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:46,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:46,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:46,375 INFO L87 Difference]: Start difference. First operand 50086 states and 75367 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:19:47,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:47,386 INFO L93 Difference]: Finished difference Result 114578 states and 171761 transitions. [2024-11-07 00:19:47,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:47,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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 250 [2024-11-07 00:19:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:47,527 INFO L225 Difference]: With dead ends: 114578 [2024-11-07 00:19:47,528 INFO L226 Difference]: Without dead ends: 82264 [2024-11-07 00:19:47,577 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:19:47,578 INFO L432 NwaCegarLoop]: 865 mSDtfsCounter, 514 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:47,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1576 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 00:19:47,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82264 states. [2024-11-07 00:19:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82264 to 82262. [2024-11-07 00:19:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82262 states, 82261 states have (on average 1.493526701596139) internal successors, (122859), 82261 states have internal predecessors, (122859), 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:19:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82262 states to 82262 states and 122859 transitions. [2024-11-07 00:19:49,181 INFO L78 Accepts]: Start accepts. Automaton has 82262 states and 122859 transitions. Word has length 250 [2024-11-07 00:19:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:49,182 INFO L471 AbstractCegarLoop]: Abstraction has 82262 states and 122859 transitions. [2024-11-07 00:19:49,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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:19:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 82262 states and 122859 transitions. [2024-11-07 00:19:49,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-07 00:19:49,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:49,257 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:49,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:19:49,258 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:49,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:49,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1119784345, now seen corresponding path program 1 times [2024-11-07 00:19:49,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:49,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193116760] [2024-11-07 00:19:49,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:49,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:50,054 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:19:50,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:50,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193116760] [2024-11-07 00:19:50,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193116760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:50,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:50,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:19:50,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408582912] [2024-11-07 00:19:50,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:50,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:19:50,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:50,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:19:50,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:50,057 INFO L87 Difference]: Start difference. First operand 82262 states and 122859 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 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:19:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:50,807 INFO L93 Difference]: Finished difference Result 226505 states and 336279 transitions. [2024-11-07 00:19:50,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:19:50,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 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 250 [2024-11-07 00:19:50,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:51,020 INFO L225 Difference]: With dead ends: 226505 [2024-11-07 00:19:51,020 INFO L226 Difference]: Without dead ends: 150783 [2024-11-07 00:19:51,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:19:51,119 INFO L432 NwaCegarLoop]: 1464 mSDtfsCounter, 875 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 3835 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:51,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 3835 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150783 states. [2024-11-07 00:19:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150783 to 81925. [2024-11-07 00:19:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81925 states, 81924 states have (on average 1.4925174552023828) internal successors, (122273), 81924 states have internal predecessors, (122273), 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:19:53,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81925 states to 81925 states and 122273 transitions. [2024-11-07 00:19:53,453 INFO L78 Accepts]: Start accepts. Automaton has 81925 states and 122273 transitions. Word has length 250 [2024-11-07 00:19:53,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:53,453 INFO L471 AbstractCegarLoop]: Abstraction has 81925 states and 122273 transitions. [2024-11-07 00:19:53,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 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:19:53,453 INFO L276 IsEmpty]: Start isEmpty. Operand 81925 states and 122273 transitions. [2024-11-07 00:19:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-07 00:19:53,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:53,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:53,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:19:53,505 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:53,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1261976102, now seen corresponding path program 1 times [2024-11-07 00:19:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:53,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207931058] [2024-11-07 00:19:53,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:53,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:53,622 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:19:53,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:53,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207931058] [2024-11-07 00:19:53,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207931058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:53,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:53,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:19:53,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112809361] [2024-11-07 00:19:53,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:53,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:19:53,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:53,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:19:53,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:19:53,625 INFO L87 Difference]: Start difference. First operand 81925 states and 122273 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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:19:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:54,267 INFO L93 Difference]: Finished difference Result 211207 states and 313119 transitions. [2024-11-07 00:19:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:19:54,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 253 [2024-11-07 00:19:54,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:54,501 INFO L225 Difference]: With dead ends: 211207 [2024-11-07 00:19:54,502 INFO L226 Difference]: Without dead ends: 142161 [2024-11-07 00:19:54,589 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:19:54,590 INFO L432 NwaCegarLoop]: 1688 mSDtfsCounter, 773 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 2596 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:19:54,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 2596 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:19:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142161 states. [2024-11-07 00:19:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142161 to 81428. [2024-11-07 00:19:56,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81428 states, 81427 states have (on average 1.4932270622766404) internal successors, (121589), 81427 states have internal predecessors, (121589), 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:19:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81428 states to 81428 states and 121589 transitions. [2024-11-07 00:19:56,782 INFO L78 Accepts]: Start accepts. Automaton has 81428 states and 121589 transitions. Word has length 253 [2024-11-07 00:19:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:19:56,783 INFO L471 AbstractCegarLoop]: Abstraction has 81428 states and 121589 transitions. [2024-11-07 00:19:56,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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:19:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 81428 states and 121589 transitions. [2024-11-07 00:19:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-07 00:19:56,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:19:56,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:56,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:19:56,846 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:19:56,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:19:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash -309092293, now seen corresponding path program 1 times [2024-11-07 00:19:56,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:19:56,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060867794] [2024-11-07 00:19:56,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:19:56,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:19:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:19:57,685 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:19:57,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:19:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060867794] [2024-11-07 00:19:57,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060867794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:19:57,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:19:57,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:19:57,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779376906] [2024-11-07 00:19:57,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:19:57,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:19:57,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:19:57,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:19:57,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:19:57,688 INFO L87 Difference]: Start difference. First operand 81428 states and 121589 transitions. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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:19:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:19:58,591 INFO L93 Difference]: Finished difference Result 223505 states and 332839 transitions. [2024-11-07 00:19:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:19:58,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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 254 [2024-11-07 00:19:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:19:58,790 INFO L225 Difference]: With dead ends: 223505 [2024-11-07 00:19:58,790 INFO L226 Difference]: Without dead ends: 142760 [2024-11-07 00:19:59,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:19:59,237 INFO L432 NwaCegarLoop]: 1480 mSDtfsCounter, 809 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 3783 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:19:59,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 3783 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:19:59,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142760 states. [2024-11-07 00:20:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142760 to 142758. [2024-11-07 00:20:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142758 states, 142757 states have (on average 1.4779800640248815) internal successors, (210992), 142757 states have internal predecessors, (210992), 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:20:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142758 states to 142758 states and 210992 transitions. [2024-11-07 00:20:01,773 INFO L78 Accepts]: Start accepts. Automaton has 142758 states and 210992 transitions. Word has length 254 [2024-11-07 00:20:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:01,773 INFO L471 AbstractCegarLoop]: Abstraction has 142758 states and 210992 transitions. [2024-11-07 00:20:01,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 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:20:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 142758 states and 210992 transitions. [2024-11-07 00:20:01,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 00:20:01,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:01,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:01,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:20:01,862 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:01,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:01,862 INFO L85 PathProgramCache]: Analyzing trace with hash 126098103, now seen corresponding path program 1 times [2024-11-07 00:20:01,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:01,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142425487] [2024-11-07 00:20:01,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:01,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:01,967 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:20:01,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:01,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142425487] [2024-11-07 00:20:01,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142425487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:01,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:01,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:20:01,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491521761] [2024-11-07 00:20:01,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:01,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:20:01,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:01,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:20:01,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:20:01,970 INFO L87 Difference]: Start difference. First operand 142758 states and 210992 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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:20:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:03,289 INFO L93 Difference]: Finished difference Result 298059 states and 438423 transitions. [2024-11-07 00:20:03,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:20:03,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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 256 [2024-11-07 00:20:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:03,587 INFO L225 Difference]: With dead ends: 298059 [2024-11-07 00:20:03,587 INFO L226 Difference]: Without dead ends: 207184 [2024-11-07 00:20:03,681 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:20:03,682 INFO L432 NwaCegarLoop]: 1311 mSDtfsCounter, 886 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:03,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 2223 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:20:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207184 states. [2024-11-07 00:20:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207184 to 140579. [2024-11-07 00:20:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140579 states, 140578 states have (on average 1.4748182503663447) internal successors, (207327), 140578 states have internal predecessors, (207327), 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:20:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140579 states to 140579 states and 207327 transitions. [2024-11-07 00:20:07,192 INFO L78 Accepts]: Start accepts. Automaton has 140579 states and 207327 transitions. Word has length 256 [2024-11-07 00:20:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:07,192 INFO L471 AbstractCegarLoop]: Abstraction has 140579 states and 207327 transitions. [2024-11-07 00:20:07,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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:20:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 140579 states and 207327 transitions. [2024-11-07 00:20:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 00:20:07,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:07,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:07,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 00:20:07,282 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:07,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:07,282 INFO L85 PathProgramCache]: Analyzing trace with hash -110963397, now seen corresponding path program 1 times [2024-11-07 00:20:07,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:07,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984188463] [2024-11-07 00:20:07,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:07,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:07,425 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:20:07,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:07,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984188463] [2024-11-07 00:20:07,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984188463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:07,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:07,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:20:07,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008745530] [2024-11-07 00:20:07,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:07,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:20:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:07,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:20:07,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:20:07,428 INFO L87 Difference]: Start difference. First operand 140579 states and 207327 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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:20:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:09,346 INFO L93 Difference]: Finished difference Result 404750 states and 594954 transitions. [2024-11-07 00:20:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:20:09,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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 256 [2024-11-07 00:20:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:09,796 INFO L225 Difference]: With dead ends: 404750 [2024-11-07 00:20:09,796 INFO L226 Difference]: Without dead ends: 274107 [2024-11-07 00:20:09,912 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:20:09,913 INFO L432 NwaCegarLoop]: 1740 mSDtfsCounter, 760 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:09,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 2616 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:20:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274107 states. [2024-11-07 00:20:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274107 to 274105. [2024-11-07 00:20:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274105 states, 274104 states have (on average 1.4627951434492017) internal successors, (400958), 274104 states have internal predecessors, (400958), 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:20:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274105 states to 274105 states and 400958 transitions. [2024-11-07 00:20:15,365 INFO L78 Accepts]: Start accepts. Automaton has 274105 states and 400958 transitions. Word has length 256 [2024-11-07 00:20:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:15,366 INFO L471 AbstractCegarLoop]: Abstraction has 274105 states and 400958 transitions. [2024-11-07 00:20:15,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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:20:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 274105 states and 400958 transitions. [2024-11-07 00:20:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 00:20:15,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:15,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:15,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 00:20:15,581 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:15,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:15,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1072599028, now seen corresponding path program 1 times [2024-11-07 00:20:15,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:15,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579107543] [2024-11-07 00:20:15,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:15,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:15,737 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:20:15,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:15,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579107543] [2024-11-07 00:20:15,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579107543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:15,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:15,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:20:15,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298287083] [2024-11-07 00:20:15,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:15,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:20:15,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:15,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:20:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:20:15,740 INFO L87 Difference]: Start difference. First operand 274105 states and 400958 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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)