./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.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.1.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', '9db88713350d7306821dd75614e70e6b858505d66168ef8348e173e7f0890ab2'] 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.1.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 9db88713350d7306821dd75614e70e6b858505d66168ef8348e173e7f0890ab2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 00:04:39,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 00:04:39,343 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:39,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 00:04:39,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 00:04:39,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 00:04:39,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 00:04:39,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 00:04:39,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 00:04:39,384 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 00:04:39,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 00:04:39,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 00:04:39,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 00:04:39,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 00:04:39,386 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 00:04:39,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 00:04:39,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 00:04:39,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 00:04:39,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 00:04:39,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 00:04:39,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 00:04:39,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 00:04:39,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 00:04:39,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 00:04:39,387 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 00:04:39,387 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 00:04:39,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 00:04:39,387 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 00:04:39,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 00:04:39,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 00:04:39,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 00:04:39,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 00:04:39,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:04:39,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 00:04:39,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 00:04:39,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 00:04:39,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 00:04:39,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 00:04:39,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 00:04:39,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 00:04:39,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 00:04:39,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 00:04:39,390 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 -> 9db88713350d7306821dd75614e70e6b858505d66168ef8348e173e7f0890ab2 [2024-11-07 00:04:39,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 00:04:39,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 00:04:39,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 00:04:39,730 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 00:04:39,731 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 00:04:39,732 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.1.ufo.UNBOUNDED.pals.c [2024-11-07 00:04:41,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 00:04:41,312 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 00:04:41,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2024-11-07 00:04:41,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cee31b364/41932810252c4be682e4ffc5ddc0db99/FLAGdbd2ba8d2 [2024-11-07 00:04:41,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cee31b364/41932810252c4be682e4ffc5ddc0db99 [2024-11-07 00:04:41,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 00:04:41,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 00:04:41,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 00:04:41,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 00:04:41,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 00:04:41,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:04:41" (1/1) ... [2024-11-07 00:04:41,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b203d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:41, skipping insertion in model container [2024-11-07 00:04:41,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:04:41" (1/1) ... [2024-11-07 00:04:41,385 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 00:04:41,572 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.1.ufo.UNBOUNDED.pals.c[9529,9542] [2024-11-07 00:04:41,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:04:41,589 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 00:04:41,626 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.1.ufo.UNBOUNDED.pals.c[9529,9542] [2024-11-07 00:04:41,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 00:04:41,641 INFO L204 MainTranslator]: Completed translation [2024-11-07 00:04:41,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:41 WrapperNode [2024-11-07 00:04:41,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 00:04:41,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 00:04:41,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 00:04:41,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 00:04:41,649 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:41" (1/1) ... [2024-11-07 00:04:41,657 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:41" (1/1) ... [2024-11-07 00:04:41,691 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 316 [2024-11-07 00:04:41,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 00:04:41,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 00:04:41,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 00:04:41,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 00:04:41,701 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:41" (1/1) ... [2024-11-07 00:04:41,701 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:41" (1/1) ... [2024-11-07 00:04:41,704 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:41" (1/1) ... [2024-11-07 00:04:41,724 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:41,724 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:41" (1/1) ... [2024-11-07 00:04:41,724 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:41" (1/1) ... [2024-11-07 00:04:41,731 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:41" (1/1) ... [2024-11-07 00:04:41,736 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:41" (1/1) ... [2024-11-07 00:04:41,738 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:41" (1/1) ... [2024-11-07 00:04:41,740 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:41" (1/1) ... [2024-11-07 00:04:41,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 00:04:41,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 00:04:41,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 00:04:41,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 00:04:41,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:41" (1/1) ... [2024-11-07 00:04:41,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 00:04:41,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:04:41,793 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:41,798 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:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 00:04:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 00:04:41,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 00:04:41,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 00:04:41,932 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 00:04:41,934 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 00:04:42,535 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-07 00:04:42,536 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 00:04:42,546 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 00:04:42,546 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 00:04:42,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:04:42 BoogieIcfgContainer [2024-11-07 00:04:42,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 00:04:42,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 00:04:42,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 00:04:42,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 00:04:42,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:04:41" (1/3) ... [2024-11-07 00:04:42,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2082effd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:04:42, skipping insertion in model container [2024-11-07 00:04:42,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:04:41" (2/3) ... [2024-11-07 00:04:42,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2082effd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:04:42, skipping insertion in model container [2024-11-07 00:04:42,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:04:42" (3/3) ... [2024-11-07 00:04:42,558 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.UNBOUNDED.pals.c [2024-11-07 00:04:42,573 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 00:04:42,574 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 00:04:42,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 00:04:42,638 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;@5d267e9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 00:04:42,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 00:04:42,646 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:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 00:04:42,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:42,655 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:42,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:42,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:42,661 INFO L85 PathProgramCache]: Analyzing trace with hash -182548282, now seen corresponding path program 1 times [2024-11-07 00:04:42,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:42,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795782508] [2024-11-07 00:04:42,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:42,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:42,892 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:42,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:42,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795782508] [2024-11-07 00:04:42,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795782508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:42,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:42,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 00:04:42,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004234262] [2024-11-07 00:04:42,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:42,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 00:04:42,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:42,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 00:04:42,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 00:04:42,917 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:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:42,933 INFO L93 Difference]: Finished difference Result 139 states and 233 transitions. [2024-11-07 00:04:42,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 00:04:42,936 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:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:42,947 INFO L225 Difference]: With dead ends: 139 [2024-11-07 00:04:42,948 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 00:04:42,954 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:42,957 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:42,958 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:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 00:04:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 00:04:42,985 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:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 138 transitions. [2024-11-07 00:04:42,992 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 138 transitions. Word has length 29 [2024-11-07 00:04:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:42,992 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 138 transitions. [2024-11-07 00:04:42,992 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:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 138 transitions. [2024-11-07 00:04:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 00:04:42,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:42,994 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:42,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 00:04:42,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:42,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:42,995 INFO L85 PathProgramCache]: Analyzing trace with hash -316561788, now seen corresponding path program 1 times [2024-11-07 00:04:42,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:42,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148992165] [2024-11-07 00:04:42,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:42,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:43,319 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:43,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:43,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148992165] [2024-11-07 00:04:43,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148992165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:43,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:43,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 00:04:43,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763004585] [2024-11-07 00:04:43,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:43,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 00:04:43,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:43,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 00:04:43,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 00:04:43,323 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:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:43,424 INFO L93 Difference]: Finished difference Result 138 states and 226 transitions. [2024-11-07 00:04:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 00:04:43,425 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:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:43,426 INFO L225 Difference]: With dead ends: 138 [2024-11-07 00:04:43,428 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 00:04:43,428 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:43,429 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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:43,429 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:43,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 00:04:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 00:04:43,439 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:43,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 114 transitions. [2024-11-07 00:04:43,445 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 114 transitions. Word has length 29 [2024-11-07 00:04:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:43,446 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 114 transitions. [2024-11-07 00:04:43,446 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:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 114 transitions. [2024-11-07 00:04:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:04:43,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:43,447 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:43,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 00:04:43,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:43,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash 672474749, now seen corresponding path program 1 times [2024-11-07 00:04:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:43,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471839774] [2024-11-07 00:04:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:43,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:43,611 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:43,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:43,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471839774] [2024-11-07 00:04:43,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471839774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:43,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:43,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:43,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402620091] [2024-11-07 00:04:43,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:43,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:43,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:43,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:43,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:43,616 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:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:43,655 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2024-11-07 00:04:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:43,656 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:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:43,657 INFO L225 Difference]: With dead ends: 178 [2024-11-07 00:04:43,657 INFO L226 Difference]: Without dead ends: 126 [2024-11-07 00:04:43,658 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:43,659 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:43,659 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:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-07 00:04:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-07 00:04:43,666 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:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2024-11-07 00:04:43,668 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 52 [2024-11-07 00:04:43,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:43,668 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2024-11-07 00:04:43,668 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:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2024-11-07 00:04:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-07 00:04:43,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:43,670 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:43,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 00:04:43,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:43,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:43,671 INFO L85 PathProgramCache]: Analyzing trace with hash -221780930, now seen corresponding path program 1 times [2024-11-07 00:04:43,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:43,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861180429] [2024-11-07 00:04:43,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:43,920 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:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:43,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861180429] [2024-11-07 00:04:43,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861180429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:43,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:43,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521986068] [2024-11-07 00:04:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:43,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:43,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:43,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:43,924 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:44,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:44,100 INFO L93 Difference]: Finished difference Result 594 states and 942 transitions. [2024-11-07 00:04:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:44,101 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:44,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:44,108 INFO L225 Difference]: With dead ends: 594 [2024-11-07 00:04:44,108 INFO L226 Difference]: Without dead ends: 500 [2024-11-07 00:04:44,109 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:44,110 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:44,113 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:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-11-07 00:04:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 216. [2024-11-07 00:04:44,149 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:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 329 transitions. [2024-11-07 00:04:44,154 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 329 transitions. Word has length 52 [2024-11-07 00:04:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:44,154 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 329 transitions. [2024-11-07 00:04:44,154 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:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 329 transitions. [2024-11-07 00:04:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 00:04:44,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:44,155 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:44,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 00:04:44,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:44,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1331402393, now seen corresponding path program 1 times [2024-11-07 00:04:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:44,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235470743] [2024-11-07 00:04:44,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:44,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:44,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:44,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235470743] [2024-11-07 00:04:44,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235470743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:44,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:44,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 00:04:44,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726740734] [2024-11-07 00:04:44,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:44,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 00:04:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:44,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 00:04:44,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 00:04:44,622 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:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:44,682 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2024-11-07 00:04:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 00:04:44,683 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:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:44,684 INFO L225 Difference]: With dead ends: 230 [2024-11-07 00:04:44,684 INFO L226 Difference]: Without dead ends: 228 [2024-11-07 00:04:44,684 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:44,686 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:44,688 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:44,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-07 00:04:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-07 00:04:44,709 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:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 341 transitions. [2024-11-07 00:04:44,710 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 341 transitions. Word has length 53 [2024-11-07 00:04:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:44,711 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 341 transitions. [2024-11-07 00:04:44,711 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:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 341 transitions. [2024-11-07 00:04:44,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-07 00:04:44,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:44,712 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:44,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 00:04:44,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:44,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:44,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1623620234, now seen corresponding path program 1 times [2024-11-07 00:04:44,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:44,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377896542] [2024-11-07 00:04:44,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:44,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:44,832 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:44,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:44,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377896542] [2024-11-07 00:04:44,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377896542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:44,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:44,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:44,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696029682] [2024-11-07 00:04:44,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:44,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:44,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:44,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:44,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:44,837 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:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:44,871 INFO L93 Difference]: Finished difference Result 594 states and 913 transitions. [2024-11-07 00:04:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:44,872 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:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:44,875 INFO L225 Difference]: With dead ends: 594 [2024-11-07 00:04:44,875 INFO L226 Difference]: Without dead ends: 396 [2024-11-07 00:04:44,876 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:44,880 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:44,881 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:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-07 00:04:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 390. [2024-11-07 00:04:44,912 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:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 589 transitions. [2024-11-07 00:04:44,916 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 589 transitions. Word has length 54 [2024-11-07 00:04:44,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:44,917 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 589 transitions. [2024-11-07 00:04:44,917 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:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 589 transitions. [2024-11-07 00:04:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:04:44,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:44,919 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:44,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 00:04:44,919 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:44,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:44,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1627419246, now seen corresponding path program 1 times [2024-11-07 00:04:44,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:44,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222263212] [2024-11-07 00:04:44,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:44,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:45,021 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:45,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:45,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222263212] [2024-11-07 00:04:45,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222263212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:45,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:45,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:45,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650067847] [2024-11-07 00:04:45,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:45,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:45,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:45,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:45,023 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:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:45,065 INFO L93 Difference]: Finished difference Result 1046 states and 1595 transitions. [2024-11-07 00:04:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:45,066 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:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:45,071 INFO L225 Difference]: With dead ends: 1046 [2024-11-07 00:04:45,073 INFO L226 Difference]: Without dead ends: 686 [2024-11-07 00:04:45,075 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:45,076 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:45,076 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:45,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-07 00:04:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 684. [2024-11-07 00:04:45,106 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:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1027 transitions. [2024-11-07 00:04:45,111 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1027 transitions. Word has length 55 [2024-11-07 00:04:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:45,111 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1027 transitions. [2024-11-07 00:04:45,111 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:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1027 transitions. [2024-11-07 00:04:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-07 00:04:45,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:45,113 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:45,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 00:04:45,114 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:45,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1310378098, now seen corresponding path program 1 times [2024-11-07 00:04:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:45,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286163328] [2024-11-07 00:04:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:45,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 00:04:45,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:45,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286163328] [2024-11-07 00:04:45,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286163328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:45,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:45,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:45,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910795996] [2024-11-07 00:04:45,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:45,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:45,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:45,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:45,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:45,183 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:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:45,236 INFO L93 Difference]: Finished difference Result 1864 states and 2797 transitions. [2024-11-07 00:04:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:45,237 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:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:45,244 INFO L225 Difference]: With dead ends: 1864 [2024-11-07 00:04:45,244 INFO L226 Difference]: Without dead ends: 1210 [2024-11-07 00:04:45,245 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:45,246 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:45,247 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:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2024-11-07 00:04:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1208. [2024-11-07 00:04:45,301 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:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1783 transitions. [2024-11-07 00:04:45,311 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1783 transitions. Word has length 55 [2024-11-07 00:04:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:45,312 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1783 transitions. [2024-11-07 00:04:45,312 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:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1783 transitions. [2024-11-07 00:04:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-07 00:04:45,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:45,313 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:45,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 00:04:45,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:45,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash -223123120, now seen corresponding path program 1 times [2024-11-07 00:04:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:45,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641169077] [2024-11-07 00:04:45,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:45,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:45,381 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:45,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:45,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641169077] [2024-11-07 00:04:45,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641169077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:45,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:45,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:45,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834510598] [2024-11-07 00:04:45,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:45,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:45,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:45,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:45,383 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:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:45,434 INFO L93 Difference]: Finished difference Result 2367 states and 3517 transitions. [2024-11-07 00:04:45,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:45,436 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:45,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:45,443 INFO L225 Difference]: With dead ends: 2367 [2024-11-07 00:04:45,444 INFO L226 Difference]: Without dead ends: 1708 [2024-11-07 00:04:45,445 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:45,446 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:45,446 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:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2024-11-07 00:04:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1706. [2024-11-07 00:04:45,499 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:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2497 transitions. [2024-11-07 00:04:45,508 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2497 transitions. Word has length 56 [2024-11-07 00:04:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:45,509 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2497 transitions. [2024-11-07 00:04:45,509 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:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2497 transitions. [2024-11-07 00:04:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:04:45,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:45,511 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:45,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 00:04:45,511 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:45,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash 53976900, now seen corresponding path program 1 times [2024-11-07 00:04:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:45,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707953031] [2024-11-07 00:04:45,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:45,701 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:45,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707953031] [2024-11-07 00:04:45,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707953031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:45,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:45,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:45,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675379687] [2024-11-07 00:04:45,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:45,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:45,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:45,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:45,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:45,703 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:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:45,860 INFO L93 Difference]: Finished difference Result 4812 states and 7146 transitions. [2024-11-07 00:04:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:45,861 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:45,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:45,878 INFO L225 Difference]: With dead ends: 4812 [2024-11-07 00:04:45,879 INFO L226 Difference]: Without dead ends: 3962 [2024-11-07 00:04:45,882 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:45,883 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:45,883 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:45,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2024-11-07 00:04:45,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 2530. [2024-11-07 00:04:45,983 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:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2530 states and 3709 transitions. [2024-11-07 00:04:45,997 INFO L78 Accepts]: Start accepts. Automaton has 2530 states and 3709 transitions. Word has length 78 [2024-11-07 00:04:45,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:45,997 INFO L471 AbstractCegarLoop]: Abstraction has 2530 states and 3709 transitions. [2024-11-07 00:04:45,997 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:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2530 states and 3709 transitions. [2024-11-07 00:04:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:04:46,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:46,000 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:46,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 00:04:46,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:46,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:46,001 INFO L85 PathProgramCache]: Analyzing trace with hash -852456349, now seen corresponding path program 1 times [2024-11-07 00:04:46,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:46,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828455296] [2024-11-07 00:04:46,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:46,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:46,171 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:46,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:46,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828455296] [2024-11-07 00:04:46,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828455296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:46,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:46,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:46,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497034453] [2024-11-07 00:04:46,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:46,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:46,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:46,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:46,174 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:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:46,359 INFO L93 Difference]: Finished difference Result 5636 states and 8358 transitions. [2024-11-07 00:04:46,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:46,360 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:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:46,380 INFO L225 Difference]: With dead ends: 5636 [2024-11-07 00:04:46,381 INFO L226 Difference]: Without dead ends: 4786 [2024-11-07 00:04:46,385 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:46,386 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:46,387 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:46,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4786 states. [2024-11-07 00:04:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4786 to 3354. [2024-11-07 00:04:46,539 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:46,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 4921 transitions. [2024-11-07 00:04:46,557 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 4921 transitions. Word has length 78 [2024-11-07 00:04:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:46,557 INFO L471 AbstractCegarLoop]: Abstraction has 3354 states and 4921 transitions. [2024-11-07 00:04:46,558 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:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 4921 transitions. [2024-11-07 00:04:46,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 00:04:46,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:46,563 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:46,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 00:04:46,564 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:46,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:46,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2085340995, now seen corresponding path program 1 times [2024-11-07 00:04:46,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:46,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546163302] [2024-11-07 00:04:46,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:46,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:46,703 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:46,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:46,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546163302] [2024-11-07 00:04:46,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546163302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:46,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:46,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:04:46,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842985767] [2024-11-07 00:04:46,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:46,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:04:46,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:46,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:04:46,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:04:46,706 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:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:46,896 INFO L93 Difference]: Finished difference Result 6460 states and 9570 transitions. [2024-11-07 00:04:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:04:46,897 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:46,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:46,920 INFO L225 Difference]: With dead ends: 6460 [2024-11-07 00:04:46,921 INFO L226 Difference]: Without dead ends: 5610 [2024-11-07 00:04:46,924 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:46,925 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.0s IncrementalHoareTripleChecker+Time [2024-11-07 00:04:46,925 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.0s Time] [2024-11-07 00:04:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5610 states. [2024-11-07 00:04:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5610 to 4178. [2024-11-07 00:04:47,060 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:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 6133 transitions. [2024-11-07 00:04:47,081 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 6133 transitions. Word has length 78 [2024-11-07 00:04:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:47,082 INFO L471 AbstractCegarLoop]: Abstraction has 4178 states and 6133 transitions. [2024-11-07 00:04:47,082 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:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 6133 transitions. [2024-11-07 00:04:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:04:47,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:47,085 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:47,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 00:04:47,085 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:47,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash 760016253, now seen corresponding path program 1 times [2024-11-07 00:04:47,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:47,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568032985] [2024-11-07 00:04:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:47,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:47,231 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:47,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:47,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568032985] [2024-11-07 00:04:47,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568032985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:47,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:47,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:47,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283308408] [2024-11-07 00:04:47,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:47,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:47,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:47,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:47,233 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:47,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:47,335 INFO L93 Difference]: Finished difference Result 8326 states and 12235 transitions. [2024-11-07 00:04:47,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:47,336 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:47,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:47,353 INFO L225 Difference]: With dead ends: 8326 [2024-11-07 00:04:47,353 INFO L226 Difference]: Without dead ends: 4180 [2024-11-07 00:04:47,360 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:47,361 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:47,361 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:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4180 states. [2024-11-07 00:04:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4180 to 4178. [2024-11-07 00:04:47,480 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:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 6073 transitions. [2024-11-07 00:04:47,501 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 6073 transitions. Word has length 79 [2024-11-07 00:04:47,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:47,501 INFO L471 AbstractCegarLoop]: Abstraction has 4178 states and 6073 transitions. [2024-11-07 00:04:47,502 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:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 6073 transitions. [2024-11-07 00:04:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:04:47,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:47,504 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:47,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 00:04:47,505 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:47,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:47,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2135446276, now seen corresponding path program 1 times [2024-11-07 00:04:47,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:47,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106887538] [2024-11-07 00:04:47,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:47,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:47,626 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:47,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:47,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106887538] [2024-11-07 00:04:47,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106887538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:04:47,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:04:47,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 00:04:47,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724945966] [2024-11-07 00:04:47,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:04:47,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 00:04:47,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:47,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 00:04:47,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 00:04:47,628 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:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:04:47,689 INFO L93 Difference]: Finished difference Result 6254 states and 9095 transitions. [2024-11-07 00:04:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 00:04:47,690 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:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:04:47,708 INFO L225 Difference]: With dead ends: 6254 [2024-11-07 00:04:47,708 INFO L226 Difference]: Without dead ends: 2108 [2024-11-07 00:04:47,716 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:47,718 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:47,718 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:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2024-11-07 00:04:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2106. [2024-11-07 00:04:47,785 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:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 3023 transitions. [2024-11-07 00:04:47,797 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 3023 transitions. Word has length 79 [2024-11-07 00:04:47,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:04:47,798 INFO L471 AbstractCegarLoop]: Abstraction has 2106 states and 3023 transitions. [2024-11-07 00:04:47,798 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:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 3023 transitions. [2024-11-07 00:04:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-07 00:04:47,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:04:47,800 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:47,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 00:04:47,801 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:04:47,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:04:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash 674497531, now seen corresponding path program 1 times [2024-11-07 00:04:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:04:47,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822768416] [2024-11-07 00:04:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:04:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:49,833 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:49,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:04:49,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822768416] [2024-11-07 00:04:49,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822768416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:04:49,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474187975] [2024-11-07 00:04:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:04:49,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:04:49,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:04:49,837 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:49,838 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:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:04:49,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 00:04:49,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:04:50,934 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:04:50,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:04:51,712 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:04:51,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474187975] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:04:51,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:04:51,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 28 [2024-11-07 00:04:51,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951706075] [2024-11-07 00:04:51,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:04:51,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 00:04:51,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:04:51,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 00:04:51,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2024-11-07 00:04:51,716 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:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:05:06,657 INFO L93 Difference]: Finished difference Result 28942 states and 41152 transitions. [2024-11-07 00:05:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2024-11-07 00:05:06,658 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:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:05:06,726 INFO L225 Difference]: With dead ends: 28942 [2024-11-07 00:05:06,727 INFO L226 Difference]: Without dead ends: 26868 [2024-11-07 00:05:06,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18355 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=6567, Invalid=38589, Unknown=0, NotChecked=0, Total=45156 [2024-11-07 00:05:06,751 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 8396 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1987 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8396 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 00:05:06,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8396 Valid, 1569 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1987 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-07 00:05:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26868 states. [2024-11-07 00:05:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26868 to 20546. [2024-11-07 00:05:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20546 states, 20545 states have (on average 1.3981017279143344) internal successors, (28724), 20545 states have internal predecessors, (28724), 0 states have call successors, (0), 0 states have call 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:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20546 states to 20546 states and 28724 transitions. [2024-11-07 00:05:07,584 INFO L78 Accepts]: Start accepts. Automaton has 20546 states and 28724 transitions. Word has length 79 [2024-11-07 00:05:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:05:07,584 INFO L471 AbstractCegarLoop]: Abstraction has 20546 states and 28724 transitions. [2024-11-07 00:05:07,585 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:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 20546 states and 28724 transitions. [2024-11-07 00:05:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-07 00:05:07,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:05:07,586 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:07,608 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:07,790 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:07,791 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:05:07,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:05:07,792 INFO L85 PathProgramCache]: Analyzing trace with hash -163654874, now seen corresponding path program 1 times [2024-11-07 00:05:07,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:05:07,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361166925] [2024-11-07 00:05:07,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:07,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:05:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:07,938 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:07,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:05:07,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361166925] [2024-11-07 00:05:07,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361166925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 00:05:07,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 00:05:07,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 00:05:07,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534583053] [2024-11-07 00:05:07,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 00:05:07,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 00:05:07,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:05:07,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 00:05:07,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 00:05:07,940 INFO L87 Difference]: Start difference. First operand 20546 states and 28724 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:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:05:08,664 INFO L93 Difference]: Finished difference Result 37475 states and 52800 transitions. [2024-11-07 00:05:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 00:05:08,665 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:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:05:08,759 INFO L225 Difference]: With dead ends: 37475 [2024-11-07 00:05:08,760 INFO L226 Difference]: Without dead ends: 33199 [2024-11-07 00:05:08,774 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:08,775 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:08,776 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:08,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33199 states. [2024-11-07 00:05:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33199 to 24630. [2024-11-07 00:05:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24630 states, 24629 states have (on average 1.3970928580129116) internal successors, (34409), 24629 states have internal predecessors, (34409), 0 states have call successors, (0), 0 states have call 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:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24630 states to 24630 states and 34409 transitions. [2024-11-07 00:05:09,859 INFO L78 Accepts]: Start accepts. Automaton has 24630 states and 34409 transitions. Word has length 80 [2024-11-07 00:05:09,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:05:09,859 INFO L471 AbstractCegarLoop]: Abstraction has 24630 states and 34409 transitions. [2024-11-07 00:05:09,860 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:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 24630 states and 34409 transitions. [2024-11-07 00:05:09,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:05:09,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:05:09,862 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:09,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 00:05:09,862 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:05:09,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:05:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash -269357657, now seen corresponding path program 1 times [2024-11-07 00:05:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:05:09,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590940558] [2024-11-07 00:05:09,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:05:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:10,995 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:10,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:05:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590940558] [2024-11-07 00:05:10,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590940558] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:05:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419211095] [2024-11-07 00:05:10,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:10,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:05:10,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:05:10,998 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:11,000 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:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:11,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 00:05:11,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:05:12,133 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:12,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:05:13,684 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:13,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419211095] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:05:13,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:05:13,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 35 [2024-11-07 00:05:13,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653342766] [2024-11-07 00:05:13,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:05:13,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-07 00:05:13,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:05:13,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-07 00:05:13,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2024-11-07 00:05:13,686 INFO L87 Difference]: Start difference. First operand 24630 states and 34409 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:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:05:36,927 INFO L93 Difference]: Finished difference Result 237968 states and 331786 transitions. [2024-11-07 00:05:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 396 states. [2024-11-07 00:05:36,928 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:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:05:37,367 INFO L225 Difference]: With dead ends: 237968 [2024-11-07 00:05:37,367 INFO L226 Difference]: Without dead ends: 213372 [2024-11-07 00:05:37,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82230 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=20054, Invalid=163558, Unknown=0, NotChecked=0, Total=183612 [2024-11-07 00:05:37,441 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 10965 mSDsluCounter, 3450 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10965 SdHoareTripleChecker+Valid, 3682 SdHoareTripleChecker+Invalid, 4862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-07 00:05:37,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10965 Valid, 3682 Invalid, 4862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-07 00:05:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213372 states. [2024-11-07 00:05:40,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213372 to 92039. [2024-11-07 00:05:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92039 states, 92038 states have (on average 1.3789630370064538) internal successors, (126917), 92038 states have internal predecessors, (126917), 0 states have call successors, (0), 0 states have call 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:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92039 states to 92039 states and 126917 transitions. [2024-11-07 00:05:40,787 INFO L78 Accepts]: Start accepts. Automaton has 92039 states and 126917 transitions. Word has length 83 [2024-11-07 00:05:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 00:05:40,788 INFO L471 AbstractCegarLoop]: Abstraction has 92039 states and 126917 transitions. [2024-11-07 00:05:40,788 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:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 92039 states and 126917 transitions. [2024-11-07 00:05:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-07 00:05:40,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 00:05:40,792 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:40,811 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:40,996 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:40,997 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 00:05:40,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 00:05:40,997 INFO L85 PathProgramCache]: Analyzing trace with hash -244055323, now seen corresponding path program 1 times [2024-11-07 00:05:40,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 00:05:40,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706692581] [2024-11-07 00:05:40,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:40,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 00:05:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:41,383 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:41,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 00:05:41,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706692581] [2024-11-07 00:05:41,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706692581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 00:05:41,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965933605] [2024-11-07 00:05:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 00:05:41,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 00:05:41,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 00:05:41,386 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:41,389 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:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 00:05:41,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-07 00:05:41,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 00:05:41,954 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:41,954 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 00:05:42,918 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:42,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965933605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 00:05:42,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 00:05:42,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-07 00:05:42,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579050433] [2024-11-07 00:05:42,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 00:05:42,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 00:05:42,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 00:05:42,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 00:05:42,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-11-07 00:05:42,921 INFO L87 Difference]: Start difference. First operand 92039 states and 126917 transitions. Second operand has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call 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:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 00:05:48,849 INFO L93 Difference]: Finished difference Result 344585 states and 477843 transitions. [2024-11-07 00:05:48,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 00:05:48,850 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.761904761904763) internal successors, (184), 20 states have internal predecessors, (184), 0 states have call successors, (0), 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:48,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 00:05:49,508 INFO L225 Difference]: With dead ends: 344585 [2024-11-07 00:05:49,509 INFO L226 Difference]: Without dead ends: 253370 [2024-11-07 00:05:49,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2024-11-07 00:05:49,607 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 908 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 00:05:49,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 892 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 00:05:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253370 states.