./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-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.ufo.BOUNDED-8.pals.c.v+cfa-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', '776b90327165ac118ff91f6400c534443904a40947197045cc27be476415edd1'] 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.ufo.BOUNDED-8.pals.c.v+cfa-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 776b90327165ac118ff91f6400c534443904a40947197045cc27be476415edd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:20:22,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:20:23,127 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:20:23,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:20:23,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:20:23,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:20:23,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:20:23,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:20:23,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:20:23,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:20:23,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:20:23,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:20:23,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:20:23,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:20:23,164 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:20:23,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:20:23,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:20:23,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:20:23,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:20:23,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:20:23,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:20:23,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:20:23,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:20:23,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:20:23,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:20:23,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:20:23,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:20:23,165 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:20:23,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:20:23,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:20:23,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:20:23,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:20:23,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:20:23,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:20:23,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:20:23,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:20:23,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:20:23,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:20:23,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:20:23,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:20:23,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:20:23,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:20:23,167 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 -> 776b90327165ac118ff91f6400c534443904a40947197045cc27be476415edd1 [2024-11-07 00:20:23,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:20:23,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:20:23,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:20:23,512 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:20:23,512 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:20:23,514 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.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-11-07 00:20:24,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:20:25,228 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:20:25,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-11-07 00:20:25,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0c14a212/cc90eac7853141c1816b639dd3e3c9d1/FLAG07d4281ea [2024-11-07 00:20:25,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0c14a212/cc90eac7853141c1816b639dd3e3c9d1 [2024-11-07 00:20:25,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:20:25,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:20:25,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:20:25,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:20:25,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:20:25,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:20:25" (1/1) ... [2024-11-07 00:20:25,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6db87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25, skipping insertion in model container [2024-11-07 00:20:25,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:20:25" (1/1) ... [2024-11-07 00:20:25,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:20:25,655 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.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[12832,12845] [2024-11-07 00:20:25,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:20:25,787 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:20:25,862 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.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c[12832,12845] [2024-11-07 00:20:25,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:20:25,942 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:20:25,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25 WrapperNode [2024-11-07 00:20:25,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:20:25,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:20:25,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:20:25,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:20:25,957 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:20:25" (1/1) ... [2024-11-07 00:20:25,975 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:20:25" (1/1) ... [2024-11-07 00:20:26,039 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1363 [2024-11-07 00:20:26,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:20:26,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:20:26,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:20:26,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:20:26,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25" (1/1) ... [2024-11-07 00:20:26,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25" (1/1) ... [2024-11-07 00:20:26,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25" (1/1) ... [2024-11-07 00:20:26,089 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:20:26,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25" (1/1) ... [2024-11-07 00:20:26,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25" (1/1) ... [2024-11-07 00:20:26,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25" (1/1) ... [2024-11-07 00:20:26,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25" (1/1) ... [2024-11-07 00:20:26,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25" (1/1) ... [2024-11-07 00:20:26,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25" (1/1) ... [2024-11-07 00:20:26,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:20:26,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:20:26,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:20:26,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:20:26,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25" (1/1) ... [2024-11-07 00:20:26,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:20:26,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:20:26,230 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:20:26,233 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:20:26,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:20:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:20:26,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:20:26,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:20:26,440 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:20:26,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:20:27,726 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-07 00:20:27,727 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:20:27,755 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:20:27,755 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 00:20:27,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:20:27 BoogieIcfgContainer [2024-11-07 00:20:27,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:20:27,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:20:27,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:20:27,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:20:27,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:20:25" (1/3) ... [2024-11-07 00:20:27,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c0c3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:20:27, skipping insertion in model container [2024-11-07 00:20:27,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:20:25" (2/3) ... [2024-11-07 00:20:27,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c0c3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:20:27, skipping insertion in model container [2024-11-07 00:20:27,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:20:27" (3/3) ... [2024-11-07 00:20:27,769 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2024-11-07 00:20:27,785 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:20:27,785 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:20:27,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:20:27,888 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;@25b4311a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:20:27,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:20:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 319 states, 317 states have (on average 1.804416403785489) internal successors, (572), 318 states have internal predecessors, (572), 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:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 00:20:27,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:27,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:27,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:27,925 INFO L85 PathProgramCache]: Analyzing trace with hash 304488522, now seen corresponding path program 1 times [2024-11-07 00:20:27,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:27,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327930342] [2024-11-07 00:20:27,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:27,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:28,856 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:28,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:28,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327930342] [2024-11-07 00:20:28,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327930342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:28,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:28,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:20:28,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214597188] [2024-11-07 00:20:28,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:28,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:20:28,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:28,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:20:28,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:20:28,901 INFO L87 Difference]: Start difference. First operand has 319 states, 317 states have (on average 1.804416403785489) internal successors, (572), 318 states have internal predecessors, (572), 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 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:29,030 INFO L93 Difference]: Finished difference Result 568 states and 991 transitions. [2024-11-07 00:20:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:20:29,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 111 [2024-11-07 00:20:29,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:29,047 INFO L225 Difference]: With dead ends: 568 [2024-11-07 00:20:29,047 INFO L226 Difference]: Without dead ends: 432 [2024-11-07 00:20:29,054 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:29,058 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 222 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:29,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1218 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:20:29,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-11-07 00:20:29,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2024-11-07 00:20:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 1.6643356643356644) internal successors, (714), 429 states have internal predecessors, (714), 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:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 714 transitions. [2024-11-07 00:20:29,131 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 714 transitions. Word has length 111 [2024-11-07 00:20:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:29,132 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 714 transitions. [2024-11-07 00:20:29,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 714 transitions. [2024-11-07 00:20:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 00:20:29,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:29,137 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] [2024-11-07 00:20:29,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:20:29,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:29,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1517208970, now seen corresponding path program 1 times [2024-11-07 00:20:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:29,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203525175] [2024-11-07 00:20:29,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:29,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:29,481 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:29,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203525175] [2024-11-07 00:20:29,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203525175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:29,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:29,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:20:29,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992328414] [2024-11-07 00:20:29,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:29,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:20:29,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:29,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:20:29,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:20:29,485 INFO L87 Difference]: Start difference. First operand 430 states and 714 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:29,540 INFO L93 Difference]: Finished difference Result 660 states and 1105 transitions. [2024-11-07 00:20:29,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:20:29,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 114 [2024-11-07 00:20:29,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:29,544 INFO L225 Difference]: With dead ends: 660 [2024-11-07 00:20:29,544 INFO L226 Difference]: Without dead ends: 533 [2024-11-07 00:20:29,545 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:29,546 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 196 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:29,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:20:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-07 00:20:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 531. [2024-11-07 00:20:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.6716981132075472) internal successors, (886), 530 states have internal predecessors, (886), 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:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 886 transitions. [2024-11-07 00:20:29,574 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 886 transitions. Word has length 114 [2024-11-07 00:20:29,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:29,574 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 886 transitions. [2024-11-07 00:20:29,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:29,575 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 886 transitions. [2024-11-07 00:20:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 00:20:29,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:29,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:20:29,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:29,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:29,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1179194652, now seen corresponding path program 1 times [2024-11-07 00:20:29,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:29,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234955506] [2024-11-07 00:20:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:29,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:29,884 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:29,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:29,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234955506] [2024-11-07 00:20:29,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234955506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:29,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:29,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:20:29,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358606960] [2024-11-07 00:20:29,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:29,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:20:29,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:29,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:20:29,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:20:29,889 INFO L87 Difference]: Start difference. First operand 531 states and 886 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:29,940 INFO L93 Difference]: Finished difference Result 1184 states and 1985 transitions. [2024-11-07 00:20:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:20:29,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 114 [2024-11-07 00:20:29,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:29,945 INFO L225 Difference]: With dead ends: 1184 [2024-11-07 00:20:29,946 INFO L226 Difference]: Without dead ends: 844 [2024-11-07 00:20:29,947 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:29,948 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 189 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:29,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1151 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:20:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-07 00:20:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 842. [2024-11-07 00:20:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.671819262782402) internal successors, (1406), 841 states have internal predecessors, (1406), 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:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1406 transitions. [2024-11-07 00:20:29,986 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1406 transitions. Word has length 114 [2024-11-07 00:20:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:29,987 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1406 transitions. [2024-11-07 00:20:29,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1406 transitions. [2024-11-07 00:20:29,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 00:20:29,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:29,991 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] [2024-11-07 00:20:29,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:20:29,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:29,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:29,992 INFO L85 PathProgramCache]: Analyzing trace with hash -236553538, now seen corresponding path program 1 times [2024-11-07 00:20:29,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:29,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430794298] [2024-11-07 00:20:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:30,225 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:30,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:30,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430794298] [2024-11-07 00:20:30,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430794298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:30,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:30,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:20:30,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227309439] [2024-11-07 00:20:30,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:30,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:20:30,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:30,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:20:30,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:20:30,228 INFO L87 Difference]: Start difference. First operand 842 states and 1406 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:30,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:30,321 INFO L93 Difference]: Finished difference Result 1462 states and 2452 transitions. [2024-11-07 00:20:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:20:30,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 117 [2024-11-07 00:20:30,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:30,329 INFO L225 Difference]: With dead ends: 1462 [2024-11-07 00:20:30,329 INFO L226 Difference]: Without dead ends: 1122 [2024-11-07 00:20:30,331 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:30,332 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 190 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:30,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:20:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-11-07 00:20:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1120. [2024-11-07 00:20:30,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 1.6729222520107239) internal successors, (1872), 1119 states have internal predecessors, (1872), 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:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1872 transitions. [2024-11-07 00:20:30,376 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1872 transitions. Word has length 117 [2024-11-07 00:20:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:30,376 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1872 transitions. [2024-11-07 00:20:30,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1872 transitions. [2024-11-07 00:20:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 00:20:30,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:30,380 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] [2024-11-07 00:20:30,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:20:30,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:30,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:30,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2147173936, now seen corresponding path program 1 times [2024-11-07 00:20:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:30,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462949653] [2024-11-07 00:20:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:30,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:30,591 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:30,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:30,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462949653] [2024-11-07 00:20:30,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462949653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:30,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:30,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:20:30,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013473474] [2024-11-07 00:20:30,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:30,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:20:30,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:30,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:20:30,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:20:30,593 INFO L87 Difference]: Start difference. First operand 1120 states and 1872 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:30,656 INFO L93 Difference]: Finished difference Result 2861 states and 4787 transitions. [2024-11-07 00:20:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:20:30,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 117 [2024-11-07 00:20:30,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:30,669 INFO L225 Difference]: With dead ends: 2861 [2024-11-07 00:20:30,669 INFO L226 Difference]: Without dead ends: 1950 [2024-11-07 00:20:30,671 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:30,674 INFO L432 NwaCegarLoop]: 638 mSDtfsCounter, 183 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:30,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:20:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2024-11-07 00:20:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1948. [2024-11-07 00:20:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1947 states have (on average 1.6656394453004622) internal successors, (3243), 1947 states have internal predecessors, (3243), 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:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 3243 transitions. [2024-11-07 00:20:30,740 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 3243 transitions. Word has length 117 [2024-11-07 00:20:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:30,741 INFO L471 AbstractCegarLoop]: Abstraction has 1948 states and 3243 transitions. [2024-11-07 00:20:30,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 3243 transitions. [2024-11-07 00:20:30,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 00:20:30,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:30,762 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] [2024-11-07 00:20:30,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:20:30,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:30,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash 866565200, now seen corresponding path program 1 times [2024-11-07 00:20:30,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:30,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150653522] [2024-11-07 00:20:30,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:30,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:30,964 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:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150653522] [2024-11-07 00:20:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150653522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:20:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172908598] [2024-11-07 00:20:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:30,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:20:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:30,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:20:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:20:30,968 INFO L87 Difference]: Start difference. First operand 1948 states and 3243 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:31,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:31,019 INFO L93 Difference]: Finished difference Result 3554 states and 5943 transitions. [2024-11-07 00:20:31,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:20:31,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 120 [2024-11-07 00:20:31,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:31,035 INFO L225 Difference]: With dead ends: 3554 [2024-11-07 00:20:31,036 INFO L226 Difference]: Without dead ends: 2643 [2024-11-07 00:20:31,042 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:31,043 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 184 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:31,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1119 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:20:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2024-11-07 00:20:31,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2641. [2024-11-07 00:20:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2641 states, 2640 states have (on average 1.665909090909091) internal successors, (4398), 2640 states have internal predecessors, (4398), 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:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 4398 transitions. [2024-11-07 00:20:31,126 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 4398 transitions. Word has length 120 [2024-11-07 00:20:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:31,126 INFO L471 AbstractCegarLoop]: Abstraction has 2641 states and 4398 transitions. [2024-11-07 00:20:31,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 4398 transitions. [2024-11-07 00:20:31,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 00:20:31,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:31,128 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] [2024-11-07 00:20:31,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:20:31,128 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:31,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash 83170558, now seen corresponding path program 1 times [2024-11-07 00:20:31,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:31,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551872852] [2024-11-07 00:20:31,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:31,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:31,358 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:31,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:31,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551872852] [2024-11-07 00:20:31,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551872852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:31,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:31,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:20:31,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096352857] [2024-11-07 00:20:31,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:31,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:20:31,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:31,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:20:31,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:20:31,360 INFO L87 Difference]: Start difference. First operand 2641 states and 4398 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:31,432 INFO L93 Difference]: Finished difference Result 7226 states and 12005 transitions. [2024-11-07 00:20:31,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:20:31,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 120 [2024-11-07 00:20:31,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:31,454 INFO L225 Difference]: With dead ends: 7226 [2024-11-07 00:20:31,454 INFO L226 Difference]: Without dead ends: 4812 [2024-11-07 00:20:31,460 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:31,461 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 177 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:31,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1022 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:20:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2024-11-07 00:20:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4810. [2024-11-07 00:20:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.651902682470368) internal successors, (7944), 4809 states have internal predecessors, (7944), 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:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 7944 transitions. [2024-11-07 00:20:31,594 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 7944 transitions. Word has length 120 [2024-11-07 00:20:31,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:31,595 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 7944 transitions. [2024-11-07 00:20:31,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 7944 transitions. [2024-11-07 00:20:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 00:20:31,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:31,599 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] [2024-11-07 00:20:31,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:20:31,599 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:31,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1139352598, now seen corresponding path program 1 times [2024-11-07 00:20:31,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:31,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276246798] [2024-11-07 00:20:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:31,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:31,877 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:31,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276246798] [2024-11-07 00:20:31,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276246798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:31,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:31,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:20:31,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531180636] [2024-11-07 00:20:31,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:31,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:20:31,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:31,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:20:31,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:20:31,880 INFO L87 Difference]: Start difference. First operand 4810 states and 7944 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:32,391 INFO L93 Difference]: Finished difference Result 29771 states and 49577 transitions. [2024-11-07 00:20:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 00:20:32,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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 123 [2024-11-07 00:20:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:32,535 INFO L225 Difference]: With dead ends: 29771 [2024-11-07 00:20:32,536 INFO L226 Difference]: Without dead ends: 25188 [2024-11-07 00:20:32,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 00:20:32,558 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 2298 mSDsluCounter, 3058 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 3572 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:32,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 3572 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:20:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25188 states. [2024-11-07 00:20:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25188 to 9236. [2024-11-07 00:20:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9236 states, 9235 states have (on average 1.6472116946399566) internal successors, (15212), 9235 states have internal predecessors, (15212), 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:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9236 states to 9236 states and 15212 transitions. [2024-11-07 00:20:33,070 INFO L78 Accepts]: Start accepts. Automaton has 9236 states and 15212 transitions. Word has length 123 [2024-11-07 00:20:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:33,070 INFO L471 AbstractCegarLoop]: Abstraction has 9236 states and 15212 transitions. [2024-11-07 00:20:33,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 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:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 9236 states and 15212 transitions. [2024-11-07 00:20:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:20:33,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:33,072 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] [2024-11-07 00:20:33,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:20:33,072 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:33,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash 893130139, now seen corresponding path program 1 times [2024-11-07 00:20:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:33,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199555997] [2024-11-07 00:20:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:33,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:33,256 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:33,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:33,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199555997] [2024-11-07 00:20:33,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199555997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:33,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:33,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:20:33,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146320271] [2024-11-07 00:20:33,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:33,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:20:33,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:33,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:20:33,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:20:33,258 INFO L87 Difference]: Start difference. First operand 9236 states and 15212 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:33,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:33,477 INFO L93 Difference]: Finished difference Result 30029 states and 49739 transitions. [2024-11-07 00:20:33,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:20:33,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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 124 [2024-11-07 00:20:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:33,613 INFO L225 Difference]: With dead ends: 30029 [2024-11-07 00:20:33,614 INFO L226 Difference]: Without dead ends: 21020 [2024-11-07 00:20:33,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:20:33,632 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 624 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:33,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 1716 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:20:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21020 states. [2024-11-07 00:20:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21020 to 15091. [2024-11-07 00:20:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15091 states, 15090 states have (on average 1.6485089463220677) internal successors, (24876), 15090 states have internal predecessors, (24876), 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:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15091 states to 15091 states and 24876 transitions. [2024-11-07 00:20:34,076 INFO L78 Accepts]: Start accepts. Automaton has 15091 states and 24876 transitions. Word has length 124 [2024-11-07 00:20:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:34,076 INFO L471 AbstractCegarLoop]: Abstraction has 15091 states and 24876 transitions. [2024-11-07 00:20:34,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 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:34,077 INFO L276 IsEmpty]: Start isEmpty. Operand 15091 states and 24876 transitions. [2024-11-07 00:20:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 00:20:34,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:34,079 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] [2024-11-07 00:20:34,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:20:34,079 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:34,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash -485089184, now seen corresponding path program 1 times [2024-11-07 00:20:34,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:34,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172125454] [2024-11-07 00:20:34,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:34,222 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:34,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:34,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172125454] [2024-11-07 00:20:34,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172125454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:34,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:34,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:20:34,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562395658] [2024-11-07 00:20:34,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:34,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:20:34,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:34,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:20:34,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:20:34,224 INFO L87 Difference]: Start difference. First operand 15091 states and 24876 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:34,493 INFO L93 Difference]: Finished difference Result 28697 states and 47478 transitions. [2024-11-07 00:20:34,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:20:34,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 124 [2024-11-07 00:20:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:34,596 INFO L225 Difference]: With dead ends: 28697 [2024-11-07 00:20:34,597 INFO L226 Difference]: Without dead ends: 20733 [2024-11-07 00:20:34,676 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:34,681 INFO L432 NwaCegarLoop]: 612 mSDtfsCounter, 178 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:34,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:20:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20733 states. [2024-11-07 00:20:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20733 to 20731. [2024-11-07 00:20:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20731 states, 20730 states have (on average 1.645875542691751) internal successors, (34119), 20730 states have internal predecessors, (34119), 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:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20731 states to 20731 states and 34119 transitions. [2024-11-07 00:20:35,347 INFO L78 Accepts]: Start accepts. Automaton has 20731 states and 34119 transitions. Word has length 124 [2024-11-07 00:20:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:35,348 INFO L471 AbstractCegarLoop]: Abstraction has 20731 states and 34119 transitions. [2024-11-07 00:20:35,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 20731 states and 34119 transitions. [2024-11-07 00:20:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 00:20:35,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:35,350 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] [2024-11-07 00:20:35,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:20:35,350 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:35,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:35,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1854726525, now seen corresponding path program 1 times [2024-11-07 00:20:35,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:35,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487206202] [2024-11-07 00:20:35,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:35,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:35,523 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:35,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:35,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487206202] [2024-11-07 00:20:35,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487206202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:35,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:35,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:20:35,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126193850] [2024-11-07 00:20:35,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:35,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:20:35,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:35,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:20:35,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:20:35,525 INFO L87 Difference]: Start difference. First operand 20731 states and 34119 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:20:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:35,948 INFO L93 Difference]: Finished difference Result 67429 states and 111258 transitions. [2024-11-07 00:20:35,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:20:35,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-11-07 00:20:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:36,100 INFO L225 Difference]: With dead ends: 67429 [2024-11-07 00:20:36,101 INFO L226 Difference]: Without dead ends: 46943 [2024-11-07 00:20:36,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:20:36,150 INFO L432 NwaCegarLoop]: 519 mSDtfsCounter, 622 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:36,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1617 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:20:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46943 states. [2024-11-07 00:20:36,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46943 to 33748. [2024-11-07 00:20:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33748 states, 33747 states have (on average 1.6413014490176905) internal successors, (55389), 33747 states have internal predecessors, (55389), 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:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33748 states to 33748 states and 55389 transitions. [2024-11-07 00:20:37,165 INFO L78 Accepts]: Start accepts. Automaton has 33748 states and 55389 transitions. Word has length 125 [2024-11-07 00:20:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:37,166 INFO L471 AbstractCegarLoop]: Abstraction has 33748 states and 55389 transitions. [2024-11-07 00:20:37,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:20:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 33748 states and 55389 transitions. [2024-11-07 00:20:37,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 00:20:37,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:37,172 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] [2024-11-07 00:20:37,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:20:37,172 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:37,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1604001442, now seen corresponding path program 1 times [2024-11-07 00:20:37,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:37,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930142715] [2024-11-07 00:20:37,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:37,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:37,588 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:37,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:37,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930142715] [2024-11-07 00:20:37,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930142715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:37,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:37,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:20:37,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352535345] [2024-11-07 00:20:37,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:37,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:20:37,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:37,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:20:37,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:20:37,590 INFO L87 Difference]: Start difference. First operand 33748 states and 55389 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:38,195 INFO L93 Difference]: Finished difference Result 109323 states and 179874 transitions. [2024-11-07 00:20:38,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:20:38,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 126 [2024-11-07 00:20:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:38,476 INFO L225 Difference]: With dead ends: 109323 [2024-11-07 00:20:38,476 INFO L226 Difference]: Without dead ends: 75820 [2024-11-07 00:20:38,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:20:38,557 INFO L432 NwaCegarLoop]: 513 mSDtfsCounter, 620 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:38,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1658 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:20:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75820 states. [2024-11-07 00:20:39,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75820 to 54641. [2024-11-07 00:20:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54641 states, 54640 states have (on average 1.6366581259150805) internal successors, (89427), 54640 states have internal predecessors, (89427), 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:40,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54641 states to 54641 states and 89427 transitions. [2024-11-07 00:20:40,012 INFO L78 Accepts]: Start accepts. Automaton has 54641 states and 89427 transitions. Word has length 126 [2024-11-07 00:20:40,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:40,013 INFO L471 AbstractCegarLoop]: Abstraction has 54641 states and 89427 transitions. [2024-11-07 00:20:40,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 54641 states and 89427 transitions. [2024-11-07 00:20:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 00:20:40,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:40,015 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] [2024-11-07 00:20:40,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:20:40,015 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:40,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:40,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1868950812, now seen corresponding path program 1 times [2024-11-07 00:20:40,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:40,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528872215] [2024-11-07 00:20:40,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:40,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:40,208 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:40,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:40,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528872215] [2024-11-07 00:20:40,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528872215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:40,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:40,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 00:20:40,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727056592] [2024-11-07 00:20:40,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:40,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 00:20:40,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:40,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 00:20:40,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 00:20:40,213 INFO L87 Difference]: Start difference. First operand 54641 states and 89427 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:41,297 INFO L93 Difference]: Finished difference Result 175049 states and 287186 transitions. [2024-11-07 00:20:41,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 00:20:41,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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 127 [2024-11-07 00:20:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:41,781 INFO L225 Difference]: With dead ends: 175049 [2024-11-07 00:20:41,781 INFO L226 Difference]: Without dead ends: 120653 [2024-11-07 00:20:41,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:20:41,853 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 618 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:41,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1722 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 00:20:41,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120653 states. [2024-11-07 00:20:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120653 to 87422. [2024-11-07 00:20:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87422 states, 87421 states have (on average 1.6320220541975041) internal successors, (142673), 87421 states have internal predecessors, (142673), 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:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87422 states to 87422 states and 142673 transitions. [2024-11-07 00:20:43,802 INFO L78 Accepts]: Start accepts. Automaton has 87422 states and 142673 transitions. Word has length 127 [2024-11-07 00:20:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:43,803 INFO L471 AbstractCegarLoop]: Abstraction has 87422 states and 142673 transitions. [2024-11-07 00:20:43,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 87422 states and 142673 transitions. [2024-11-07 00:20:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 00:20:43,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:43,805 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] [2024-11-07 00:20:43,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:20:43,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:43,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2012261173, now seen corresponding path program 1 times [2024-11-07 00:20:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174841283] [2024-11-07 00:20:43,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:43,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:44,358 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:44,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:44,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174841283] [2024-11-07 00:20:44,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174841283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:44,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:44,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:20:44,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785413317] [2024-11-07 00:20:44,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:44,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:20:44,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:44,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:20:44,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:20:44,360 INFO L87 Difference]: Start difference. First operand 87422 states and 142673 transitions. Second operand has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:45,450 INFO L93 Difference]: Finished difference Result 174601 states and 284955 transitions. [2024-11-07 00:20:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:20:45,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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 129 [2024-11-07 00:20:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:45,701 INFO L225 Difference]: With dead ends: 174601 [2024-11-07 00:20:45,701 INFO L226 Difference]: Without dead ends: 87424 [2024-11-07 00:20:45,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:20:45,803 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 711 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:45,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1993 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:20:45,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87424 states. [2024-11-07 00:20:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87424 to 87422. [2024-11-07 00:20:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87422 states, 87421 states have (on average 1.6248727422472862) internal successors, (142048), 87421 states have internal predecessors, (142048), 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:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87422 states to 87422 states and 142048 transitions. [2024-11-07 00:20:47,356 INFO L78 Accepts]: Start accepts. Automaton has 87422 states and 142048 transitions. Word has length 129 [2024-11-07 00:20:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:47,357 INFO L471 AbstractCegarLoop]: Abstraction has 87422 states and 142048 transitions. [2024-11-07 00:20:47,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 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:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 87422 states and 142048 transitions. [2024-11-07 00:20:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 00:20:47,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:47,359 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] [2024-11-07 00:20:47,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:20:47,359 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:47,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash 365685076, now seen corresponding path program 1 times [2024-11-07 00:20:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:47,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654071819] [2024-11-07 00:20:47,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:47,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:48,002 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:48,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:48,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654071819] [2024-11-07 00:20:48,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654071819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:48,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:48,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:20:48,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558388382] [2024-11-07 00:20:48,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:48,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:20:48,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:48,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:20:48,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:20:48,005 INFO L87 Difference]: Start difference. First operand 87422 states and 142048 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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:49,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:49,225 INFO L93 Difference]: Finished difference Result 255495 states and 415623 transitions. [2024-11-07 00:20:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:20:49,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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 132 [2024-11-07 00:20:49,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:49,649 INFO L225 Difference]: With dead ends: 255495 [2024-11-07 00:20:49,650 INFO L226 Difference]: Without dead ends: 168318 [2024-11-07 00:20:49,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:20:49,769 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 528 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:49,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 2008 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:20:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168318 states. [2024-11-07 00:20:51,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168318 to 168316. [2024-11-07 00:20:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168316 states, 168315 states have (on average 1.615714582776342) internal successors, (271949), 168315 states have internal predecessors, (271949), 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:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168316 states to 168316 states and 271949 transitions. [2024-11-07 00:20:52,437 INFO L78 Accepts]: Start accepts. Automaton has 168316 states and 271949 transitions. Word has length 132 [2024-11-07 00:20:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:52,437 INFO L471 AbstractCegarLoop]: Abstraction has 168316 states and 271949 transitions. [2024-11-07 00:20:52,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 168316 states and 271949 transitions. [2024-11-07 00:20:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 00:20:52,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:52,438 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] [2024-11-07 00:20:52,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 00:20:52,439 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:52,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:52,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1550573646, now seen corresponding path program 1 times [2024-11-07 00:20:52,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:52,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264716099] [2024-11-07 00:20:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:52,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:53,571 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:53,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:53,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264716099] [2024-11-07 00:20:53,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264716099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:53,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:53,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:20:53,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610995937] [2024-11-07 00:20:53,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:53,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:20:53,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:53,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:20:53,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:20:53,575 INFO L87 Difference]: Start difference. First operand 168316 states and 271949 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:20:54,370 INFO L93 Difference]: Finished difference Result 172190 states and 277758 transitions. [2024-11-07 00:20:54,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:20:54,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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 133 [2024-11-07 00:20:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:20:54,861 INFO L225 Difference]: With dead ends: 172190 [2024-11-07 00:20:54,861 INFO L226 Difference]: Without dead ends: 172188 [2024-11-07 00:20:54,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:20:54,961 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 0 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:20:54,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2070 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:20:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172188 states. [2024-11-07 00:20:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172188 to 172188. [2024-11-07 00:20:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172188 states, 172187 states have (on average 1.6017120920859298) internal successors, (275794), 172187 states have internal predecessors, (275794), 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:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172188 states to 172188 states and 275794 transitions. [2024-11-07 00:20:58,095 INFO L78 Accepts]: Start accepts. Automaton has 172188 states and 275794 transitions. Word has length 133 [2024-11-07 00:20:58,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:20:58,095 INFO L471 AbstractCegarLoop]: Abstraction has 172188 states and 275794 transitions. [2024-11-07 00:20:58,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 172188 states and 275794 transitions. [2024-11-07 00:20:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 00:20:58,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:20:58,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:20:58,105 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:20:58,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:20:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2098432369, now seen corresponding path program 1 times [2024-11-07 00:20:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:20:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367233395] [2024-11-07 00:20:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:20:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:20:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:20:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 00:20:58,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:20:58,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367233395] [2024-11-07 00:20:58,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367233395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:20:58,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:20:58,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:20:58,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124732215] [2024-11-07 00:20:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:20:58,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:20:58,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:20:58,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:20:58,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:20:58,496 INFO L87 Difference]: Start difference. First operand 172188 states and 275794 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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:21:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:00,947 INFO L93 Difference]: Finished difference Result 469214 states and 754047 transitions. [2024-11-07 00:21:00,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:21:00,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 163 [2024-11-07 00:21:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:01,818 INFO L225 Difference]: With dead ends: 469214 [2024-11-07 00:21:01,818 INFO L226 Difference]: Without dead ends: 393562 [2024-11-07 00:21:01,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:21:01,953 INFO L432 NwaCegarLoop]: 723 mSDtfsCounter, 1388 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 2948 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:01,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 2948 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:21:02,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393562 states. [2024-11-07 00:21:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393562 to 276620. [2024-11-07 00:21:07,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276620 states, 276619 states have (on average 1.6000925460651654) internal successors, (442616), 276619 states have internal predecessors, (442616), 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:21:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276620 states to 276620 states and 442616 transitions. [2024-11-07 00:21:07,884 INFO L78 Accepts]: Start accepts. Automaton has 276620 states and 442616 transitions. Word has length 163 [2024-11-07 00:21:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:07,884 INFO L471 AbstractCegarLoop]: Abstraction has 276620 states and 442616 transitions. [2024-11-07 00:21:07,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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:21:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 276620 states and 442616 transitions. [2024-11-07 00:21:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 00:21:07,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:07,894 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:07,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 00:21:07,894 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:07,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash -903642171, now seen corresponding path program 1 times [2024-11-07 00:21:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:07,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624942289] [2024-11-07 00:21:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 00:21:08,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:08,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624942289] [2024-11-07 00:21:08,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624942289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:08,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:08,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:21:08,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662980815] [2024-11-07 00:21:08,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:08,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:21:08,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:08,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:21:08,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:21:08,281 INFO L87 Difference]: Start difference. First operand 276620 states and 442616 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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:21:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:10,852 INFO L93 Difference]: Finished difference Result 517342 states and 831675 transitions. [2024-11-07 00:21:10,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:21:10,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 163 [2024-11-07 00:21:10,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:21:11,863 INFO L225 Difference]: With dead ends: 517342 [2024-11-07 00:21:11,864 INFO L226 Difference]: Without dead ends: 441690 [2024-11-07 00:21:12,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:21:12,058 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 1327 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:21:12,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 2649 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:21:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441690 states. [2024-11-07 00:21:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441690 to 373886. [2024-11-07 00:21:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373886 states, 373885 states have (on average 1.6012249755940997) internal successors, (598674), 373885 states have internal predecessors, (598674), 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:21:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373886 states to 373886 states and 598674 transitions. [2024-11-07 00:21:20,024 INFO L78 Accepts]: Start accepts. Automaton has 373886 states and 598674 transitions. Word has length 163 [2024-11-07 00:21:20,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:21:20,027 INFO L471 AbstractCegarLoop]: Abstraction has 373886 states and 598674 transitions. [2024-11-07 00:21:20,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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:21:20,027 INFO L276 IsEmpty]: Start isEmpty. Operand 373886 states and 598674 transitions. [2024-11-07 00:21:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 00:21:20,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:21:20,033 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:20,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 00:21:20,034 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:21:20,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:21:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash -220690461, now seen corresponding path program 1 times [2024-11-07 00:21:20,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:21:20,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613540157] [2024-11-07 00:21:20,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:21:20,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:21:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:21:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 00:21:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:21:20,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613540157] [2024-11-07 00:21:20,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613540157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:21:20,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:21:20,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:21:20,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088875076] [2024-11-07 00:21:20,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:21:20,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:21:20,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:21:20,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:21:20,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:21:20,335 INFO L87 Difference]: Start difference. First operand 373886 states and 598674 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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:21:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:21:22,990 INFO L93 Difference]: Finished difference Result 547362 states and 880015 transitions. [2024-11-07 00:21:22,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:21:22,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 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 163 [2024-11-07 00:21:22,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted.