./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.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/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.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', 'aba75d5c6112bb80051134ed7f98fd80207b53da5b894be601f1f010079e2e6e'] 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/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.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 aba75d5c6112bb80051134ed7f98fd80207b53da5b894be601f1f010079e2e6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:04:49,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:04:49,157 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:04:49,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:04:49,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:04:49,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:04:49,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:04:49,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:04:49,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:04:49,203 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:04:49,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:04:49,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:04:49,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:04:49,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:04:49,205 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:04:49,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:04:49,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:04:49,206 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:04:49,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:04:49,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:04:49,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:04:49,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:04:49,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:04:49,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:04:49,206 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:04:49,206 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:04:49,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:04:49,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:04:49,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:04:49,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:04:49,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:04:49,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:04:49,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:04:49,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:04:49,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:04:49,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:04:49,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:04:49,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:04:49,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:04:49,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:04:49,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:04:49,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:04:49,209 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 -> aba75d5c6112bb80051134ed7f98fd80207b53da5b894be601f1f010079e2e6e [2024-11-07 00:04:49,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:04:49,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:04:49,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:04:49,502 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:04:49,502 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:04:49,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c [2024-11-07 00:04:50,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:04:51,103 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:04:51,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c [2024-11-07 00:04:51,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52d95058b/ba9798d9f646450685d4de1c75f7639d/FLAG759de7034 [2024-11-07 00:04:51,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52d95058b/ba9798d9f646450685d4de1c75f7639d [2024-11-07 00:04:51,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:04:51,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:04:51,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:04:51,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:04:51,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:04:51,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:04:51" (1/1) ... [2024-11-07 00:04:51,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c5560d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51, skipping insertion in model container [2024-11-07 00:04:51,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:04:51" (1/1) ... [2024-11-07 00:04:51,424 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:04:51,664 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/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c[9488,9501] [2024-11-07 00:04:51,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:04:51,683 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:04:51,750 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/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c[9488,9501] [2024-11-07 00:04:51,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:04:51,767 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:04:51,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51 WrapperNode [2024-11-07 00:04:51,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:04:51,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:04:51,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:04:51,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:04:51,776 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:04:51" (1/1) ... [2024-11-07 00:04:51,788 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:04:51" (1/1) ... [2024-11-07 00:04:51,829 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 315 [2024-11-07 00:04:51,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:04:51,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:04:51,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:04:51,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:04:51,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51" (1/1) ... [2024-11-07 00:04:51,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51" (1/1) ... [2024-11-07 00:04:51,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51" (1/1) ... [2024-11-07 00:04:51,860 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:04:51,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51" (1/1) ... [2024-11-07 00:04:51,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51" (1/1) ... [2024-11-07 00:04:51,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51" (1/1) ... [2024-11-07 00:04:51,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51" (1/1) ... [2024-11-07 00:04:51,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51" (1/1) ... [2024-11-07 00:04:51,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51" (1/1) ... [2024-11-07 00:04:51,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:04:51,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:04:51,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:04:51,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:04:51,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51" (1/1) ... [2024-11-07 00:04:51,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:04:51,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:04:51,928 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:04:51,932 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:04:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:04:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:04:51,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:04:51,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:04:52,041 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:04:52,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:04:52,577 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-07 00:04:52,577 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:04:52,592 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:04:52,594 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:04:52,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:04:52 BoogieIcfgContainer [2024-11-07 00:04:52,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:04:52,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:04:52,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:04:52,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:04:52,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:04:51" (1/3) ... [2024-11-07 00:04:52,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6ebeb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:04:52, skipping insertion in model container [2024-11-07 00:04:52,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:51" (2/3) ... [2024-11-07 00:04:52,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6ebeb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:04:52, skipping insertion in model container [2024-11-07 00:04:52,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:04:52" (3/3) ... [2024-11-07 00:04:52,607 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c [2024-11-07 00:04:52,622 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:04:52,623 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:04:52,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:04:52,692 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;@5e4549bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:04:52,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:04:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 84 states have (on average 1.7261904761904763) internal successors, (145), 85 states have internal predecessors, (145), 0 states have call successors, (0), 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:04:52,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 00:04:52,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:52,709 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] [2024-11-07 00:04:52,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:52,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:52,716 INFO L85 PathProgramCache]: Analyzing trace with hash -182548282, now seen corresponding path program 1 times [2024-11-07 00:04:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:52,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887682727] [2024-11-07 00:04:52,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:52,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:52,959 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:04:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:52,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887682727] [2024-11-07 00:04:52,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887682727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:52,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:52,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:04:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371193886] [2024-11-07 00:04:52,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:52,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:04:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:52,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:04:52,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:04:52,993 INFO L87 Difference]: Start difference. First operand has 86 states, 84 states have (on average 1.7261904761904763) internal successors, (145), 85 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:04:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:53,013 INFO L93 Difference]: Finished difference Result 139 states and 233 transitions. [2024-11-07 00:04:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:04:53,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-07 00:04:53,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:53,024 INFO L225 Difference]: With dead ends: 139 [2024-11-07 00:04:53,025 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 00:04:53,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:04:53,029 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:53,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:53,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 00:04:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 00:04:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 81 states have internal predecessors, (138), 0 states have call successors, (0), 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:04:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 138 transitions. [2024-11-07 00:04:53,058 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 138 transitions. Word has length 29 [2024-11-07 00:04:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:53,058 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 138 transitions. [2024-11-07 00:04:53,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:04:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 138 transitions. [2024-11-07 00:04:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 00:04:53,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:53,060 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] [2024-11-07 00:04:53,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:04:53,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:53,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash -316561788, now seen corresponding path program 1 times [2024-11-07 00:04:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:53,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214741697] [2024-11-07 00:04:53,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:53,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:53,384 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:04:53,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:53,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214741697] [2024-11-07 00:04:53,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214741697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:53,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:53,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:04:53,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510568863] [2024-11-07 00:04:53,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:53,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:04:53,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:53,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:04:53,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:04:53,388 INFO L87 Difference]: Start difference. First operand 82 states and 138 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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:04:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:53,468 INFO L93 Difference]: Finished difference Result 138 states and 226 transitions. [2024-11-07 00:04:53,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:04:53,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-07 00:04:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:53,470 INFO L225 Difference]: With dead ends: 138 [2024-11-07 00:04:53,471 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 00:04:53,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:04:53,472 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:53,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 515 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:04:53,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 00:04:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 00:04:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 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:04:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-11-07 00:04:53,479 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 29 [2024-11-07 00:04:53,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:53,479 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-11-07 00:04:53,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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:04:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-11-07 00:04:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:04:53,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:53,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:04:53,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:04:53,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:53,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:53,482 INFO L85 PathProgramCache]: Analyzing trace with hash 672474749, now seen corresponding path program 1 times [2024-11-07 00:04:53,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:53,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006995545] [2024-11-07 00:04:53,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:53,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:53,642 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:04:53,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:53,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006995545] [2024-11-07 00:04:53,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006995545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:53,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:53,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:53,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348775587] [2024-11-07 00:04:53,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:53,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:53,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:53,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:53,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:53,644 INFO L87 Difference]: Start difference. First operand 82 states and 114 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:53,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:53,672 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2024-11-07 00:04:53,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:53,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-07 00:04:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:53,674 INFO L225 Difference]: With dead ends: 178 [2024-11-07 00:04:53,674 INFO L226 Difference]: Without dead ends: 126 [2024-11-07 00:04:53,675 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:04:53,675 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 60 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 219 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:04:53,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:53,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-07 00:04:53,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-07 00:04:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 123 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2024-11-07 00:04:53,686 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 52 [2024-11-07 00:04:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:53,686 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2024-11-07 00:04:53,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2024-11-07 00:04:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:04:53,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:53,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:04:53,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:04:53,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:53,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash -221780930, now seen corresponding path program 1 times [2024-11-07 00:04:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:53,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100234543] [2024-11-07 00:04:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:53,908 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:04:53,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:53,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100234543] [2024-11-07 00:04:53,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100234543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:53,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:53,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:53,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209630201] [2024-11-07 00:04:53,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:53,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:53,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:53,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:53,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:53,912 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:54,056 INFO L93 Difference]: Finished difference Result 594 states and 942 transitions. [2024-11-07 00:04:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:54,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-07 00:04:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:54,061 INFO L225 Difference]: With dead ends: 594 [2024-11-07 00:04:54,061 INFO L226 Difference]: Without dead ends: 500 [2024-11-07 00:04:54,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:04:54,063 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 664 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:54,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 606 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:04:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-07 00:04:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 216. [2024-11-07 00:04:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.5302325581395348) internal successors, (329), 215 states have internal predecessors, (329), 0 states have call successors, (0), 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:04:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 329 transitions. [2024-11-07 00:04:54,102 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 329 transitions. Word has length 52 [2024-11-07 00:04:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:54,103 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 329 transitions. [2024-11-07 00:04:54,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 329 transitions. [2024-11-07 00:04:54,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:04:54,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:54,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:04:54,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:04:54,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:54,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1331402393, now seen corresponding path program 1 times [2024-11-07 00:04:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:54,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106031677] [2024-11-07 00:04:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:54,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:54,520 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:04:54,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:54,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106031677] [2024-11-07 00:04:54,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106031677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:54,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:54,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:04:54,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113815237] [2024-11-07 00:04:54,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:54,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:04:54,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:54,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:04:54,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:04:54,524 INFO L87 Difference]: Start difference. First operand 216 states and 329 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:54,583 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2024-11-07 00:04:54,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:04:54,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-07 00:04:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:54,585 INFO L225 Difference]: With dead ends: 230 [2024-11-07 00:04:54,586 INFO L226 Difference]: Without dead ends: 228 [2024-11-07 00:04:54,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:04:54,586 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:54,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 744 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-07 00:04:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-07 00:04:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.502202643171806) internal successors, (341), 227 states have internal predecessors, (341), 0 states have call successors, (0), 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:04:54,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 341 transitions. [2024-11-07 00:04:54,607 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 341 transitions. Word has length 53 [2024-11-07 00:04:54,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:54,607 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 341 transitions. [2024-11-07 00:04:54,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 341 transitions. [2024-11-07 00:04:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:04:54,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:54,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:04:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:04:54,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:54,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:54,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1623620234, now seen corresponding path program 1 times [2024-11-07 00:04:54,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:54,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230228165] [2024-11-07 00:04:54,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:54,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:54,732 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:04:54,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:54,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230228165] [2024-11-07 00:04:54,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230228165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:54,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:54,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827309126] [2024-11-07 00:04:54,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:54,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:54,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:54,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:54,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:54,736 INFO L87 Difference]: Start difference. First operand 228 states and 341 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:54,766 INFO L93 Difference]: Finished difference Result 594 states and 913 transitions. [2024-11-07 00:04:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:54,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-07 00:04:54,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:54,772 INFO L225 Difference]: With dead ends: 594 [2024-11-07 00:04:54,773 INFO L226 Difference]: Without dead ends: 396 [2024-11-07 00:04:54,773 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:04:54,774 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 52 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:54,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 190 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-07 00:04:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 390. [2024-11-07 00:04:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.5141388174807198) internal successors, (589), 389 states have internal predecessors, (589), 0 states have call successors, (0), 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:04:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 589 transitions. [2024-11-07 00:04:54,799 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 589 transitions. Word has length 54 [2024-11-07 00:04:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:54,799 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 589 transitions. [2024-11-07 00:04:54,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 589 transitions. [2024-11-07 00:04:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:04:54,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:54,800 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] [2024-11-07 00:04:54,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:04:54,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:54,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:54,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1627419246, now seen corresponding path program 1 times [2024-11-07 00:04:54,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:54,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582084990] [2024-11-07 00:04:54,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:54,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:54,905 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:04:54,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:54,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582084990] [2024-11-07 00:04:54,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582084990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:54,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:54,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:54,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879671717] [2024-11-07 00:04:54,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:54,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:54,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:54,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:54,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:54,909 INFO L87 Difference]: Start difference. First operand 390 states and 589 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:54,952 INFO L93 Difference]: Finished difference Result 1046 states and 1595 transitions. [2024-11-07 00:04:54,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:54,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-07 00:04:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:54,958 INFO L225 Difference]: With dead ends: 1046 [2024-11-07 00:04:54,958 INFO L226 Difference]: Without dead ends: 686 [2024-11-07 00:04:54,960 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:04:54,963 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 64 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 233 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:04:54,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 233 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-07 00:04:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 684. [2024-11-07 00:04:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.5036603221083455) internal successors, (1027), 683 states have internal predecessors, (1027), 0 states have call successors, (0), 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:04:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1027 transitions. [2024-11-07 00:04:54,992 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1027 transitions. Word has length 55 [2024-11-07 00:04:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:54,992 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1027 transitions. [2024-11-07 00:04:54,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1027 transitions. [2024-11-07 00:04:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:04:54,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:54,995 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] [2024-11-07 00:04:54,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:04:54,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:54,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:54,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1310378098, now seen corresponding path program 1 times [2024-11-07 00:04:54,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:54,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330558920] [2024-11-07 00:04:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:54,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:55,067 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:04:55,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330558920] [2024-11-07 00:04:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330558920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:55,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515186774] [2024-11-07 00:04:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:55,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:55,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:55,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:55,070 INFO L87 Difference]: Start difference. First operand 684 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:55,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:55,113 INFO L93 Difference]: Finished difference Result 1864 states and 2797 transitions. [2024-11-07 00:04:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:55,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-07 00:04:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:55,121 INFO L225 Difference]: With dead ends: 1864 [2024-11-07 00:04:55,121 INFO L226 Difference]: Without dead ends: 1210 [2024-11-07 00:04:55,123 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:04:55,123 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 68 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 246 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:04:55,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 246 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2024-11-07 00:04:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1208. [2024-11-07 00:04:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 1207 states have (on average 1.4772162386081193) internal successors, (1783), 1207 states have internal predecessors, (1783), 0 states have call successors, (0), 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:04:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1783 transitions. [2024-11-07 00:04:55,196 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1783 transitions. Word has length 55 [2024-11-07 00:04:55,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:55,197 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1783 transitions. [2024-11-07 00:04:55,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1783 transitions. [2024-11-07 00:04:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:04:55,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:55,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:04:55,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:04:55,198 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:55,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:55,199 INFO L85 PathProgramCache]: Analyzing trace with hash -223123120, now seen corresponding path program 1 times [2024-11-07 00:04:55,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:55,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687224306] [2024-11-07 00:04:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:55,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:55,268 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:04:55,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:55,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687224306] [2024-11-07 00:04:55,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687224306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:55,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:55,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:55,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811500653] [2024-11-07 00:04:55,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:55,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:55,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:55,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:55,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:55,270 INFO L87 Difference]: Start difference. First operand 1208 states and 1783 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:55,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:55,328 INFO L93 Difference]: Finished difference Result 2367 states and 3517 transitions. [2024-11-07 00:04:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:55,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-07 00:04:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:55,340 INFO L225 Difference]: With dead ends: 2367 [2024-11-07 00:04:55,340 INFO L226 Difference]: Without dead ends: 1708 [2024-11-07 00:04:55,342 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:04:55,343 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 69 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 255 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:04:55,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 255 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2024-11-07 00:04:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1706. [2024-11-07 00:04:55,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.4645161290322581) internal successors, (2497), 1705 states have internal predecessors, (2497), 0 states have call successors, (0), 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:04:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2497 transitions. [2024-11-07 00:04:55,411 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2497 transitions. Word has length 56 [2024-11-07 00:04:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:55,411 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2497 transitions. [2024-11-07 00:04:55,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2497 transitions. [2024-11-07 00:04:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:04:55,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:55,413 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 00:04:55,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:04:55,414 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:55,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:55,414 INFO L85 PathProgramCache]: Analyzing trace with hash 53976900, now seen corresponding path program 1 times [2024-11-07 00:04:55,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:55,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395453535] [2024-11-07 00:04:55,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:55,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-07 00:04:55,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:55,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395453535] [2024-11-07 00:04:55,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395453535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:55,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:55,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:55,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594418595] [2024-11-07 00:04:55,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:55,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:55,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:55,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:55,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:55,613 INFO L87 Difference]: Start difference. First operand 1706 states and 2497 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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:04:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:55,759 INFO L93 Difference]: Finished difference Result 4812 states and 7146 transitions. [2024-11-07 00:04:55,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:55,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-07 00:04:55,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:55,778 INFO L225 Difference]: With dead ends: 4812 [2024-11-07 00:04:55,778 INFO L226 Difference]: Without dead ends: 3962 [2024-11-07 00:04:55,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:04:55,783 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 556 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:55,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 599 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:04:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2024-11-07 00:04:55,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 2530. [2024-11-07 00:04:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2530 states, 2529 states have (on average 1.4665875840253064) internal successors, (3709), 2529 states have internal predecessors, (3709), 0 states have call successors, (0), 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:04:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 3709 transitions. [2024-11-07 00:04:55,915 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 3709 transitions. Word has length 78 [2024-11-07 00:04:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:55,915 INFO L471 AbstractCegarLoop]: Abstraction has 2530 states and 3709 transitions. [2024-11-07 00:04:55,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 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:04:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3709 transitions. [2024-11-07 00:04:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:04:55,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:55,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2024-11-07 00:04:55,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:04:55,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:55,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash -852456349, now seen corresponding path program 1 times [2024-11-07 00:04:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:55,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798384153] [2024-11-07 00:04:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 00:04:56,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:56,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798384153] [2024-11-07 00:04:56,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798384153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:56,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:56,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805432] [2024-11-07 00:04:56,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:56,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:56,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:56,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:56,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:56,095 INFO L87 Difference]: Start difference. First operand 2530 states and 3709 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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:04:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:56,262 INFO L93 Difference]: Finished difference Result 5636 states and 8358 transitions. [2024-11-07 00:04:56,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:56,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-07 00:04:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:56,285 INFO L225 Difference]: With dead ends: 5636 [2024-11-07 00:04:56,286 INFO L226 Difference]: Without dead ends: 4786 [2024-11-07 00:04:56,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:04:56,291 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 498 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:56,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 652 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:04:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2024-11-07 00:04:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 3354. [2024-11-07 00:04:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3354 states, 3353 states have (on average 1.4676409185803758) internal successors, (4921), 3353 states have internal predecessors, (4921), 0 states have call successors, (0), 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:04:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 4921 transitions. [2024-11-07 00:04:56,446 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 4921 transitions. Word has length 78 [2024-11-07 00:04:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:56,446 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 4921 transitions. [2024-11-07 00:04:56,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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:04:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 4921 transitions. [2024-11-07 00:04:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:04:56,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:56,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2024-11-07 00:04:56,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:04:56,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:56,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:56,453 INFO L85 PathProgramCache]: Analyzing trace with hash 2085340995, now seen corresponding path program 1 times [2024-11-07 00:04:56,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:56,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917811749] [2024-11-07 00:04:56,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:56,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-07 00:04:56,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:56,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917811749] [2024-11-07 00:04:56,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917811749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:56,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:56,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:56,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422126284] [2024-11-07 00:04:56,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:56,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:56,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:56,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:56,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:56,616 INFO L87 Difference]: Start difference. First operand 3354 states and 4921 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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:04:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:56,795 INFO L93 Difference]: Finished difference Result 6460 states and 9570 transitions. [2024-11-07 00:04:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:56,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-07 00:04:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:56,839 INFO L225 Difference]: With dead ends: 6460 [2024-11-07 00:04:56,839 INFO L226 Difference]: Without dead ends: 5610 [2024-11-07 00:04:56,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:04:56,843 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 540 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:56,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 632 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 00:04:56,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2024-11-07 00:04:56,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 4178. [2024-11-07 00:04:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4178 states, 4177 states have (on average 1.4682786689011251) internal successors, (6133), 4177 states have internal predecessors, (6133), 0 states have call successors, (0), 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:04:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 6133 transitions. [2024-11-07 00:04:57,008 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 6133 transitions. Word has length 78 [2024-11-07 00:04:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:57,008 INFO L471 AbstractCegarLoop]: Abstraction has 4178 states and 6133 transitions. [2024-11-07 00:04:57,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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:04:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 6133 transitions. [2024-11-07 00:04:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:04:57,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:57,011 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2024-11-07 00:04:57,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:04:57,012 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:57,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash 760016253, now seen corresponding path program 1 times [2024-11-07 00:04:57,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:57,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27644633] [2024-11-07 00:04:57,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:57,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:57,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:57,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:57,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27644633] [2024-11-07 00:04:57,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27644633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:57,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:57,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:57,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553904061] [2024-11-07 00:04:57,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:57,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:57,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:57,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:57,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:57,133 INFO L87 Difference]: Start difference. First operand 4178 states and 6133 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:57,224 INFO L93 Difference]: Finished difference Result 8326 states and 12235 transitions. [2024-11-07 00:04:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:57,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:04:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:57,241 INFO L225 Difference]: With dead ends: 8326 [2024-11-07 00:04:57,241 INFO L226 Difference]: Without dead ends: 4180 [2024-11-07 00:04:57,248 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:04:57,249 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 55 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:57,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 246 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4180 states. [2024-11-07 00:04:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4180 to 4178. [2024-11-07 00:04:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4178 states, 4177 states have (on average 1.453914292554465) internal successors, (6073), 4177 states have internal predecessors, (6073), 0 states have call successors, (0), 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:04:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 6073 transitions. [2024-11-07 00:04:57,378 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 6073 transitions. Word has length 79 [2024-11-07 00:04:57,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:57,378 INFO L471 AbstractCegarLoop]: Abstraction has 4178 states and 6073 transitions. [2024-11-07 00:04:57,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 6073 transitions. [2024-11-07 00:04:57,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:04:57,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:57,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-11-07 00:04:57,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:04:57,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:57,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:57,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2135446276, now seen corresponding path program 1 times [2024-11-07 00:04:57,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:57,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664251980] [2024-11-07 00:04:57,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:57,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:57,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:57,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664251980] [2024-11-07 00:04:57,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664251980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:57,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:57,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:57,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583861385] [2024-11-07 00:04:57,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:57,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:57,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:57,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:57,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:57,504 INFO L87 Difference]: Start difference. First operand 4178 states and 6073 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:57,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:57,570 INFO L93 Difference]: Finished difference Result 6254 states and 9095 transitions. [2024-11-07 00:04:57,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:57,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:04:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:57,586 INFO L225 Difference]: With dead ends: 6254 [2024-11-07 00:04:57,586 INFO L226 Difference]: Without dead ends: 2108 [2024-11-07 00:04:57,593 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:04:57,594 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 49 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:57,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 227 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:04:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2024-11-07 00:04:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2106. [2024-11-07 00:04:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2106 states, 2105 states have (on average 1.436104513064133) internal successors, (3023), 2105 states have internal predecessors, (3023), 0 states have call successors, (0), 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:04:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3023 transitions. [2024-11-07 00:04:57,667 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 3023 transitions. Word has length 79 [2024-11-07 00:04:57,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:57,667 INFO L471 AbstractCegarLoop]: Abstraction has 2106 states and 3023 transitions. [2024-11-07 00:04:57,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:04:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 3023 transitions. [2024-11-07 00:04:57,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:04:57,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:57,669 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 00:04:57,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:04:57,669 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:57,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash 674497531, now seen corresponding path program 1 times [2024-11-07 00:04:57,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:57,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366788376] [2024-11-07 00:04:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:57,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:59,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:59,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366788376] [2024-11-07 00:04:59,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366788376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:04:59,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357997996] [2024-11-07 00:04:59,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:59,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:04:59,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:04:59,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:04:59,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 00:04:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:59,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 00:04:59,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:05:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:05:00,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:05:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:05:01,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357997996] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:05:01,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:05:01,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 28 [2024-11-07 00:05:01,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595093738] [2024-11-07 00:05:01,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:05:01,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 00:05:01,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:05:01,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 00:05:01,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:05:01,515 INFO L87 Difference]: Start difference. First operand 2106 states and 3023 transitions. Second operand has 28 states, 28 states have (on average 8.071428571428571) internal successors, (226), 28 states have internal predecessors, (226), 0 states have call successors, (0), 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:05:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:05:15,721 INFO L93 Difference]: Finished difference Result 30562 states and 43692 transitions. [2024-11-07 00:05:15,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2024-11-07 00:05:15,722 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.071428571428571) internal successors, (226), 28 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-07 00:05:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:05:15,808 INFO L225 Difference]: With dead ends: 30562 [2024-11-07 00:05:15,808 INFO L226 Difference]: Without dead ends: 28488 [2024-11-07 00:05:15,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19992 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=7100, Invalid=41520, Unknown=0, NotChecked=0, Total=48620 [2024-11-07 00:05:15,835 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 8542 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8542 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:05:15,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8542 Valid, 1581 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 00:05:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28488 states. [2024-11-07 00:05:16,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28488 to 21676. [2024-11-07 00:05:16,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21676 states, 21675 states have (on average 1.4050288350634372) internal successors, (30454), 21675 states have internal predecessors, (30454), 0 states have call successors, (0), 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:05:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21676 states to 21676 states and 30454 transitions. [2024-11-07 00:05:16,788 INFO L78 Accepts]: Start accepts. Automaton has 21676 states and 30454 transitions. Word has length 79 [2024-11-07 00:05:16,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:05:16,788 INFO L471 AbstractCegarLoop]: Abstraction has 21676 states and 30454 transitions. [2024-11-07 00:05:16,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.071428571428571) internal successors, (226), 28 states have internal predecessors, (226), 0 states have call successors, (0), 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:05:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 21676 states and 30454 transitions. [2024-11-07 00:05:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:05:16,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:05:16,791 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:05:16,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 00:05:16,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 00:05:16,992 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:05:16,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:05:16,992 INFO L85 PathProgramCache]: Analyzing trace with hash -163654874, now seen corresponding path program 1 times [2024-11-07 00:05:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:05:16,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461945428] [2024-11-07 00:05:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:16,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:05:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 00:05:17,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:05:17,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461945428] [2024-11-07 00:05:17,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461945428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:05:17,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:05:17,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:05:17,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983647007] [2024-11-07 00:05:17,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:05:17,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:05:17,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:05:17,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:05:17,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:05:17,131 INFO L87 Difference]: Start difference. First operand 21676 states and 30454 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:05:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:05:17,741 INFO L93 Difference]: Finished difference Result 39509 states and 55914 transitions. [2024-11-07 00:05:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:05:17,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-07 00:05:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:05:17,829 INFO L225 Difference]: With dead ends: 39509 [2024-11-07 00:05:17,830 INFO L226 Difference]: Without dead ends: 35007 [2024-11-07 00:05:17,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 00:05:17,848 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 462 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:05:17,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 646 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 00:05:17,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35007 states. [2024-11-07 00:05:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35007 to 25986. [2024-11-07 00:05:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25986 states, 25985 states have (on average 1.4040792765056764) internal successors, (36485), 25985 states have internal predecessors, (36485), 0 states have call successors, (0), 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:05:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25986 states to 25986 states and 36485 transitions. [2024-11-07 00:05:18,844 INFO L78 Accepts]: Start accepts. Automaton has 25986 states and 36485 transitions. Word has length 80 [2024-11-07 00:05:18,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:05:18,844 INFO L471 AbstractCegarLoop]: Abstraction has 25986 states and 36485 transitions. [2024-11-07 00:05:18,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:05:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 25986 states and 36485 transitions. [2024-11-07 00:05:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:05:18,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:05:18,848 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:05:18,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:05:18,848 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:05:18,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:05:18,849 INFO L85 PathProgramCache]: Analyzing trace with hash -269357657, now seen corresponding path program 1 times [2024-11-07 00:05:18,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:05:18,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185144710] [2024-11-07 00:05:18,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:18,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:05:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:05:19,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:05:19,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185144710] [2024-11-07 00:05:19,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185144710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:05:19,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707570070] [2024-11-07 00:05:19,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:19,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:05:19,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:05:19,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:05:19,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 00:05:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:20,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 00:05:20,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:05:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:05:21,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:05:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:05:22,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707570070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:05:22,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:05:22,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 35 [2024-11-07 00:05:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660017735] [2024-11-07 00:05:22,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:05:22,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-07 00:05:22,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:05:22,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-07 00:05:22,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 00:05:22,711 INFO L87 Difference]: Start difference. First operand 25986 states and 36485 transitions. Second operand has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:05:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:05:45,296 INFO L93 Difference]: Finished difference Result 271505 states and 379733 transitions. [2024-11-07 00:05:45,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 396 states. [2024-11-07 00:05:45,296 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2024-11-07 00:05:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:05:45,986 INFO L225 Difference]: With dead ends: 271505 [2024-11-07 00:05:45,986 INFO L226 Difference]: Without dead ends: 245553 [2024-11-07 00:05:46,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82230 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=20054, Invalid=163558, Unknown=0, NotChecked=0, Total=183612 [2024-11-07 00:05:46,070 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 10499 mSDsluCounter, 3751 mSDsCounter, 0 mSdLazyCounter, 4871 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10499 SdHoareTripleChecker+Valid, 3983 SdHoareTripleChecker+Invalid, 5125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 4871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 00:05:46,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10499 Valid, 3983 Invalid, 5125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 4871 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 00:05:46,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245553 states. [2024-11-07 00:05:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245553 to 97606. [2024-11-07 00:05:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97606 states, 97605 states have (on average 1.382295988934993) internal successors, (134919), 97605 states have internal predecessors, (134919), 0 states have call successors, (0), 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:05:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97606 states to 97606 states and 134919 transitions. [2024-11-07 00:05:50,274 INFO L78 Accepts]: Start accepts. Automaton has 97606 states and 134919 transitions. Word has length 83 [2024-11-07 00:05:50,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:05:50,274 INFO L471 AbstractCegarLoop]: Abstraction has 97606 states and 134919 transitions. [2024-11-07 00:05:50,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.371428571428571) internal successors, (223), 35 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 00:05:50,275 INFO L276 IsEmpty]: Start isEmpty. Operand 97606 states and 134919 transitions. [2024-11-07 00:05:50,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:05:50,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:05:50,279 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-07 00:05:50,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 00:05:50,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 00:05:50,480 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:05:50,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:05:50,481 INFO L85 PathProgramCache]: Analyzing trace with hash -244055323, now seen corresponding path program 1 times [2024-11-07 00:05:50,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:05:50,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261724901] [2024-11-07 00:05:50,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:50,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:05:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:05:50,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:05:50,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261724901] [2024-11-07 00:05:50,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261724901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:05:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268837291] [2024-11-07 00:05:50,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:50,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:05:50,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:05:50,895 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 00:05:50,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 00:05:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:51,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-07 00:05:51,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:05:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:05:54,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:06:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:06:00,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268837291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:06:00,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:06:00,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 26] total 54 [2024-11-07 00:06:00,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88514553] [2024-11-07 00:06:00,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:06:00,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-07 00:06:00,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:06:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-07 00:06:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=2458, Unknown=0, NotChecked=0, Total=2862 [2024-11-07 00:06:00,310 INFO L87 Difference]: Start difference. First operand 97606 states and 134919 transitions. Second operand has 54 states, 54 states have (on average 4.2592592592592595) internal successors, (230), 54 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)