./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label06.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/eca-rers2012/Problem17_label06.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', 'e9764aa77a297d88a5c4424b1d4363c7dc0ea34b016b7ff505243e4a2273d457'] 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/eca-rers2012/Problem17_label06.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 e9764aa77a297d88a5c4424b1d4363c7dc0ea34b016b7ff505243e4a2273d457 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:04:13,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:04:13,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 20:04:13,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:04:13,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:04:13,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:04:13,281 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:04:13,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:04:13,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:04:13,282 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:04:13,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:04:13,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:04:13,282 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:04:13,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:04:13,283 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:04:13,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:04:13,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:04:13,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:04:13,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:04:13,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:04:13,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:04:13,284 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:04:13,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:04:13,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:04:13,284 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:04:13,284 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:04:13,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:04:13,285 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:04:13,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:04:13,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:04:13,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:04:13,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:04:13,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:04:13,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:04:13,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:04:13,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:04:13,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:04:13,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:04:13,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:04:13,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:04:13,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:04:13,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:04:13,286 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 -> e9764aa77a297d88a5c4424b1d4363c7dc0ea34b016b7ff505243e4a2273d457 [2024-11-06 20:04:13,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:04:13,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:04:13,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:04:13,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:04:13,522 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:04:13,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label06.c [2024-11-06 20:04:14,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:04:15,041 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:04:15,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label06.c [2024-11-06 20:04:15,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/005c7ed52/3de6fb9ffcaf444582d8b18b0ccf4d2e/FLAG7548267d7 [2024-11-06 20:04:15,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/005c7ed52/3de6fb9ffcaf444582d8b18b0ccf4d2e [2024-11-06 20:04:15,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:04:15,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:04:15,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:04:15,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:04:15,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:04:15,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:04:15" (1/1) ... [2024-11-06 20:04:15,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e8b6ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:15, skipping insertion in model container [2024-11-06 20:04:15,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:04:15" (1/1) ... [2024-11-06 20:04:15,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:04:15,494 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/eca-rers2012/Problem17_label06.c[4782,4795] [2024-11-06 20:04:15,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:04:15,864 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:04:15,876 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/eca-rers2012/Problem17_label06.c[4782,4795] [2024-11-06 20:04:16,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:04:16,149 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:04:16,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16 WrapperNode [2024-11-06 20:04:16,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:04:16,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:04:16,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:04:16,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:04:16,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (1/1) ... [2024-11-06 20:04:16,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (1/1) ... [2024-11-06 20:04:16,432 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-11-06 20:04:16,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:04:16,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:04:16,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:04:16,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:04:16,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (1/1) ... [2024-11-06 20:04:16,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (1/1) ... [2024-11-06 20:04:16,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (1/1) ... [2024-11-06 20:04:16,621 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-06 20:04:16,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (1/1) ... [2024-11-06 20:04:16,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (1/1) ... [2024-11-06 20:04:16,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (1/1) ... [2024-11-06 20:04:16,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (1/1) ... [2024-11-06 20:04:16,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (1/1) ... [2024-11-06 20:04:16,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (1/1) ... [2024-11-06 20:04:16,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:04:16,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:04:16,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:04:16,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:04:16,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (1/1) ... [2024-11-06 20:04:16,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:04:16,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:04:16,898 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-06 20:04:16,902 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-06 20:04:16,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:04:16,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:04:16,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:04:16,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:04:16,975 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:04:16,976 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:04:19,478 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-11-06 20:04:19,478 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:04:19,511 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:04:19,511 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:04:19,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:04:19 BoogieIcfgContainer [2024-11-06 20:04:19,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:04:19,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:04:19,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:04:19,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:04:19,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:04:15" (1/3) ... [2024-11-06 20:04:19,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce3b29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:04:19, skipping insertion in model container [2024-11-06 20:04:19,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:16" (2/3) ... [2024-11-06 20:04:19,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce3b29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:04:19, skipping insertion in model container [2024-11-06 20:04:19,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:04:19" (3/3) ... [2024-11-06 20:04:19,524 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label06.c [2024-11-06 20:04:19,544 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:04:19,549 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:04:19,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:04:19,689 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;@78120d3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:04:19,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:04:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-06 20:04:19,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:19,707 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] [2024-11-06 20:04:19,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:19,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1843609039, now seen corresponding path program 1 times [2024-11-06 20:04:19,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:19,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381725208] [2024-11-06 20:04:19,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:19,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:19,949 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-06 20:04:19,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:19,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381725208] [2024-11-06 20:04:19,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381725208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:19,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:19,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:04:19,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123000924] [2024-11-06 20:04:19,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:19,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:19,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:19,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:19,981 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:22,020 INFO L93 Difference]: Finished difference Result 1667 states and 3061 transitions. [2024-11-06 20:04:22,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:22,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-06 20:04:22,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:22,031 INFO L225 Difference]: With dead ends: 1667 [2024-11-06 20:04:22,031 INFO L226 Difference]: Without dead ends: 998 [2024-11-06 20:04:22,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:04:22,036 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 514 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:22,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 20:04:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-11-06 20:04:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2024-11-06 20:04:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2024-11-06 20:04:22,088 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 31 [2024-11-06 20:04:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:22,088 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2024-11-06 20:04:22,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2024-11-06 20:04:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-06 20:04:22,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:22,090 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:04:22,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:04:22,090 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:22,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:22,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1080324021, now seen corresponding path program 1 times [2024-11-06 20:04:22,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:22,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125684976] [2024-11-06 20:04:22,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:22,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:22,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:22,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125684976] [2024-11-06 20:04:22,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125684976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:22,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:22,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:04:22,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635239093] [2024-11-06 20:04:22,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:22,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:22,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:22,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:22,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:22,245 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:24,317 INFO L93 Difference]: Finished difference Result 2841 states and 4881 transitions. [2024-11-06 20:04:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:24,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-11-06 20:04:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:24,324 INFO L225 Difference]: With dead ends: 2841 [2024-11-06 20:04:24,324 INFO L226 Difference]: Without dead ends: 1861 [2024-11-06 20:04:24,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:04:24,327 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:24,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 496 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 20:04:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2024-11-06 20:04:24,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1857. [2024-11-06 20:04:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1856 states have (on average 1.4547413793103448) internal successors, (2700), 1856 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2700 transitions. [2024-11-06 20:04:24,357 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2700 transitions. Word has length 96 [2024-11-06 20:04:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:24,357 INFO L471 AbstractCegarLoop]: Abstraction has 1857 states and 2700 transitions. [2024-11-06 20:04:24,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2700 transitions. [2024-11-06 20:04:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-06 20:04:24,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:24,360 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:04:24,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:04:24,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:24,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:24,361 INFO L85 PathProgramCache]: Analyzing trace with hash 446171936, now seen corresponding path program 1 times [2024-11-06 20:04:24,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:24,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653720616] [2024-11-06 20:04:24,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:24,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:24,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653720616] [2024-11-06 20:04:24,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653720616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:24,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:24,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:04:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654282023] [2024-11-06 20:04:24,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:24,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:24,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:24,641 INFO L87 Difference]: Start difference. First operand 1857 states and 2700 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:26,800 INFO L93 Difference]: Finished difference Result 4591 states and 6640 transitions. [2024-11-06 20:04:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:26,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-06 20:04:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:26,808 INFO L225 Difference]: With dead ends: 4591 [2024-11-06 20:04:26,808 INFO L226 Difference]: Without dead ends: 2736 [2024-11-06 20:04:26,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:04:26,810 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 352 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:26,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 537 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 20:04:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2024-11-06 20:04:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2716. [2024-11-06 20:04:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2715 states have (on average 1.390791896869245) internal successors, (3776), 2715 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3776 transitions. [2024-11-06 20:04:26,847 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3776 transitions. Word has length 136 [2024-11-06 20:04:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:26,848 INFO L471 AbstractCegarLoop]: Abstraction has 2716 states and 3776 transitions. [2024-11-06 20:04:26,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3776 transitions. [2024-11-06 20:04:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-06 20:04:26,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:26,854 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:04:26,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:04:26,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:26,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1180835985, now seen corresponding path program 1 times [2024-11-06 20:04:26,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:26,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505336628] [2024-11-06 20:04:26,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:26,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:27,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505336628] [2024-11-06 20:04:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505336628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:27,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:27,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:04:27,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206338977] [2024-11-06 20:04:27,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:27,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:27,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:27,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:27,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:27,019 INFO L87 Difference]: Start difference. First operand 2716 states and 3776 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:28,505 INFO L93 Difference]: Finished difference Result 6709 states and 9429 transitions. [2024-11-06 20:04:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:28,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2024-11-06 20:04:28,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:28,516 INFO L225 Difference]: With dead ends: 6709 [2024-11-06 20:04:28,516 INFO L226 Difference]: Without dead ends: 3995 [2024-11-06 20:04:28,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:04:28,519 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:28,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:04:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2024-11-06 20:04:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 3142. [2024-11-06 20:04:28,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 3141 states have (on average 1.274434893346068) internal successors, (4003), 3141 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:28,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 4003 transitions. [2024-11-06 20:04:28,555 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 4003 transitions. Word has length 142 [2024-11-06 20:04:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:28,555 INFO L471 AbstractCegarLoop]: Abstraction has 3142 states and 4003 transitions. [2024-11-06 20:04:28,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 4003 transitions. [2024-11-06 20:04:28,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-06 20:04:28,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:28,557 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:04:28,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 20:04:28,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:28,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2071979068, now seen corresponding path program 1 times [2024-11-06 20:04:28,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:28,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222196741] [2024-11-06 20:04:28,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:28,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:28,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:28,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222196741] [2024-11-06 20:04:28,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222196741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:28,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:28,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 20:04:28,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947000105] [2024-11-06 20:04:28,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:28,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 20:04:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:28,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 20:04:28,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:04:28,907 INFO L87 Difference]: Start difference. First operand 3142 states and 4003 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:31,655 INFO L93 Difference]: Finished difference Result 8005 states and 10508 transitions. [2024-11-06 20:04:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:04:31,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2024-11-06 20:04:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:31,667 INFO L225 Difference]: With dead ends: 8005 [2024-11-06 20:04:31,668 INFO L226 Difference]: Without dead ends: 4865 [2024-11-06 20:04:31,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:04:31,671 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 1089 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:31,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 894 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 20:04:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4865 states. [2024-11-06 20:04:31,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4865 to 4852. [2024-11-06 20:04:31,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4851 states have (on average 1.2665429808286952) internal successors, (6144), 4851 states have internal predecessors, (6144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 6144 transitions. [2024-11-06 20:04:31,723 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 6144 transitions. Word has length 179 [2024-11-06 20:04:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:31,723 INFO L471 AbstractCegarLoop]: Abstraction has 4852 states and 6144 transitions. [2024-11-06 20:04:31,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 6144 transitions. [2024-11-06 20:04:31,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-06 20:04:31,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:31,727 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:04:31,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:04:31,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:31,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:31,728 INFO L85 PathProgramCache]: Analyzing trace with hash 851513907, now seen corresponding path program 1 times [2024-11-06 20:04:31,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:31,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863555707] [2024-11-06 20:04:31,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:31,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 20:04:31,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:31,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863555707] [2024-11-06 20:04:31,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863555707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:31,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:31,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:31,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869461494] [2024-11-06 20:04:31,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:31,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:31,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:31,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:31,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:31,845 INFO L87 Difference]: Start difference. First operand 4852 states and 6144 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:33,792 INFO L93 Difference]: Finished difference Result 12249 states and 15825 transitions. [2024-11-06 20:04:33,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:33,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 185 [2024-11-06 20:04:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:33,811 INFO L225 Difference]: With dead ends: 12249 [2024-11-06 20:04:33,812 INFO L226 Difference]: Without dead ends: 7399 [2024-11-06 20:04:33,817 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-06 20:04:33,818 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 417 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:33,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 545 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 20:04:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7399 states. [2024-11-06 20:04:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7399 to 4826. [2024-11-06 20:04:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4825 states have (on average 1.2652849740932643) internal successors, (6105), 4825 states have internal predecessors, (6105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 6105 transitions. [2024-11-06 20:04:33,886 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 6105 transitions. Word has length 185 [2024-11-06 20:04:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:33,886 INFO L471 AbstractCegarLoop]: Abstraction has 4826 states and 6105 transitions. [2024-11-06 20:04:33,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 6105 transitions. [2024-11-06 20:04:33,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-06 20:04:33,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:33,888 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:33,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:04:33,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:33,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:33,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1071805537, now seen corresponding path program 1 times [2024-11-06 20:04:33,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:33,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118306490] [2024-11-06 20:04:33,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:33,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:04:34,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:34,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118306490] [2024-11-06 20:04:34,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118306490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:34,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:34,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161626256] [2024-11-06 20:04:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:34,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:34,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:34,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:34,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:34,028 INFO L87 Difference]: Start difference. First operand 4826 states and 6105 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:35,748 INFO L93 Difference]: Finished difference Result 13481 states and 17131 transitions. [2024-11-06 20:04:35,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:35,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2024-11-06 20:04:35,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:35,767 INFO L225 Difference]: With dead ends: 13481 [2024-11-06 20:04:35,767 INFO L226 Difference]: Without dead ends: 8657 [2024-11-06 20:04:35,769 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-06 20:04:35,770 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 453 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:35,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 483 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 20:04:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8657 states. [2024-11-06 20:04:35,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8657 to 7378. [2024-11-06 20:04:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7378 states, 7377 states have (on average 1.2479327639962043) internal successors, (9206), 7377 states have internal predecessors, (9206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7378 states to 7378 states and 9206 transitions. [2024-11-06 20:04:35,830 INFO L78 Accepts]: Start accepts. Automaton has 7378 states and 9206 transitions. Word has length 198 [2024-11-06 20:04:35,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:35,831 INFO L471 AbstractCegarLoop]: Abstraction has 7378 states and 9206 transitions. [2024-11-06 20:04:35,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 7378 states and 9206 transitions. [2024-11-06 20:04:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-06 20:04:35,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:35,833 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:35,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 20:04:35,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:35,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash 830636259, now seen corresponding path program 1 times [2024-11-06 20:04:35,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:35,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190876558] [2024-11-06 20:04:35,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:35,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:04:35,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:35,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190876558] [2024-11-06 20:04:35,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190876558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:35,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:35,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783908506] [2024-11-06 20:04:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:36,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:36,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:36,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:36,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:36,000 INFO L87 Difference]: Start difference. First operand 7378 states and 9206 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:37,872 INFO L93 Difference]: Finished difference Result 18607 states and 23435 transitions. [2024-11-06 20:04:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:37,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2024-11-06 20:04:37,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:37,888 INFO L225 Difference]: With dead ends: 18607 [2024-11-06 20:04:37,888 INFO L226 Difference]: Without dead ends: 10379 [2024-11-06 20:04:37,895 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-06 20:04:37,896 INFO L432 NwaCegarLoop]: 945 mSDtfsCounter, 469 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:37,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1020 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 20:04:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2024-11-06 20:04:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 10371. [2024-11-06 20:04:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10371 states, 10370 states have (on average 1.2060752169720348) internal successors, (12507), 10370 states have internal predecessors, (12507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10371 states to 10371 states and 12507 transitions. [2024-11-06 20:04:38,190 INFO L78 Accepts]: Start accepts. Automaton has 10371 states and 12507 transitions. Word has length 247 [2024-11-06 20:04:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:38,190 INFO L471 AbstractCegarLoop]: Abstraction has 10371 states and 12507 transitions. [2024-11-06 20:04:38,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 10371 states and 12507 transitions. [2024-11-06 20:04:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-06 20:04:38,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:38,199 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:38,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 20:04:38,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:38,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:38,201 INFO L85 PathProgramCache]: Analyzing trace with hash 571478886, now seen corresponding path program 1 times [2024-11-06 20:04:38,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:38,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576034066] [2024-11-06 20:04:38,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:38,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 196 proven. 70 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-06 20:04:38,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:38,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576034066] [2024-11-06 20:04:38,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576034066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:04:38,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632914506] [2024-11-06 20:04:38,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:38,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:04:38,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:04:38,537 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-06 20:04:38,538 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-06 20:04:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:38,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 20:04:38,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:04:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 196 proven. 70 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-06 20:04:38,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:04:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-06 20:04:39,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632914506] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 20:04:39,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 20:04:39,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-11-06 20:04:39,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675108161] [2024-11-06 20:04:39,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:39,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:04:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:39,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:04:39,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:04:39,244 INFO L87 Difference]: Start difference. First operand 10371 states and 12507 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:42,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:42,011 INFO L93 Difference]: Finished difference Result 32691 states and 39751 transitions. [2024-11-06 20:04:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:04:42,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 255 [2024-11-06 20:04:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:42,064 INFO L225 Difference]: With dead ends: 32691 [2024-11-06 20:04:42,064 INFO L226 Difference]: Without dead ends: 21461 [2024-11-06 20:04:42,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:04:42,075 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 1138 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 1420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 3713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1420 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:42,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 143 Invalid, 3713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1420 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 20:04:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21461 states. [2024-11-06 20:04:42,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21461 to 21459. [2024-11-06 20:04:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21459 states, 21458 states have (on average 1.1587752819461272) internal successors, (24865), 21458 states have internal predecessors, (24865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21459 states to 21459 states and 24865 transitions. [2024-11-06 20:04:42,366 INFO L78 Accepts]: Start accepts. Automaton has 21459 states and 24865 transitions. Word has length 255 [2024-11-06 20:04:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:42,367 INFO L471 AbstractCegarLoop]: Abstraction has 21459 states and 24865 transitions. [2024-11-06 20:04:42,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 21459 states and 24865 transitions. [2024-11-06 20:04:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-06 20:04:42,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:42,375 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:42,404 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-06 20:04:42,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:04:42,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:42,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:42,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1010683278, now seen corresponding path program 1 times [2024-11-06 20:04:42,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:42,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117117821] [2024-11-06 20:04:42,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:42,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-06 20:04:42,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:42,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117117821] [2024-11-06 20:04:42,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117117821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:42,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:42,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:42,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338905527] [2024-11-06 20:04:42,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:42,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:42,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:42,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:42,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:42,772 INFO L87 Difference]: Start difference. First operand 21459 states and 24865 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:44,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:44,322 INFO L93 Difference]: Finished difference Result 47592 states and 55279 transitions. [2024-11-06 20:04:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:44,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2024-11-06 20:04:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:44,357 INFO L225 Difference]: With dead ends: 47592 [2024-11-06 20:04:44,357 INFO L226 Difference]: Without dead ends: 26135 [2024-11-06 20:04:44,374 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-06 20:04:44,375 INFO L432 NwaCegarLoop]: 792 mSDtfsCounter, 373 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:44,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 858 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:04:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26135 states. [2024-11-06 20:04:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26135 to 25710. [2024-11-06 20:04:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25710 states, 25709 states have (on average 1.1431016375588314) internal successors, (29388), 25709 states have internal predecessors, (29388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25710 states to 25710 states and 29388 transitions. [2024-11-06 20:04:44,636 INFO L78 Accepts]: Start accepts. Automaton has 25710 states and 29388 transitions. Word has length 268 [2024-11-06 20:04:44,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:44,636 INFO L471 AbstractCegarLoop]: Abstraction has 25710 states and 29388 transitions. [2024-11-06 20:04:44,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 25710 states and 29388 transitions. [2024-11-06 20:04:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-11-06 20:04:44,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:44,640 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:04:44,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 20:04:44,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:44,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:44,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1351221799, now seen corresponding path program 1 times [2024-11-06 20:04:44,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:44,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100082242] [2024-11-06 20:04:44,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:44,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:45,271 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:04:45,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:45,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100082242] [2024-11-06 20:04:45,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100082242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:45,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:45,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:04:45,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562206218] [2024-11-06 20:04:45,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:45,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:04:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:45,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:04:45,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:04:45,274 INFO L87 Difference]: Start difference. First operand 25710 states and 29388 transitions. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:48,187 INFO L93 Difference]: Finished difference Result 67190 states and 77164 transitions. [2024-11-06 20:04:48,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:04:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 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 291 [2024-11-06 20:04:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:48,224 INFO L225 Difference]: With dead ends: 67190 [2024-11-06 20:04:48,224 INFO L226 Difference]: Without dead ends: 38068 [2024-11-06 20:04:48,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:04:48,238 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 868 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 2804 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 3253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 2804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:48,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 347 Invalid, 3253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 2804 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 20:04:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38068 states. [2024-11-06 20:04:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38068 to 34625. [2024-11-06 20:04:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34625 states, 34624 states have (on average 1.1460547597042514) internal successors, (39681), 34624 states have internal predecessors, (39681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34625 states to 34625 states and 39681 transitions. [2024-11-06 20:04:48,509 INFO L78 Accepts]: Start accepts. Automaton has 34625 states and 39681 transitions. Word has length 291 [2024-11-06 20:04:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:48,510 INFO L471 AbstractCegarLoop]: Abstraction has 34625 states and 39681 transitions. [2024-11-06 20:04:48,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 34625 states and 39681 transitions. [2024-11-06 20:04:48,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-06 20:04:48,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:48,515 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:04:48,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 20:04:48,515 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:48,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash 950600156, now seen corresponding path program 1 times [2024-11-06 20:04:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057027209] [2024-11-06 20:04:48,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-06 20:04:48,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:48,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057027209] [2024-11-06 20:04:48,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057027209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:48,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:48,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:48,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678834550] [2024-11-06 20:04:48,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:48,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:48,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:48,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:48,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:48,738 INFO L87 Difference]: Start difference. First operand 34625 states and 39681 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:50,270 INFO L93 Difference]: Finished difference Result 83321 states and 95565 transitions. [2024-11-06 20:04:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:50,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 306 [2024-11-06 20:04:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:50,316 INFO L225 Difference]: With dead ends: 83321 [2024-11-06 20:04:50,316 INFO L226 Difference]: Without dead ends: 45721 [2024-11-06 20:04:50,431 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-06 20:04:50,432 INFO L432 NwaCegarLoop]: 732 mSDtfsCounter, 362 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:50,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 802 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:04:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45721 states. [2024-11-06 20:04:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45721 to 45286. [2024-11-06 20:04:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45286 states, 45285 states have (on average 1.1171027934194546) internal successors, (50588), 45285 states have internal predecessors, (50588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45286 states to 45286 states and 50588 transitions. [2024-11-06 20:04:50,944 INFO L78 Accepts]: Start accepts. Automaton has 45286 states and 50588 transitions. Word has length 306 [2024-11-06 20:04:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:50,945 INFO L471 AbstractCegarLoop]: Abstraction has 45286 states and 50588 transitions. [2024-11-06 20:04:50,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 45286 states and 50588 transitions. [2024-11-06 20:04:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-06 20:04:50,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:50,953 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:50,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 20:04:50,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:50,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash -604991863, now seen corresponding path program 1 times [2024-11-06 20:04:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:50,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944941214] [2024-11-06 20:04:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:50,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 295 proven. 214 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-06 20:04:51,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:51,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944941214] [2024-11-06 20:04:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944941214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:04:51,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313113414] [2024-11-06 20:04:51,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:51,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:04:51,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:04:51,464 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-06 20:04:51,465 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-06 20:04:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:51,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 20:04:51,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:04:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 337 proven. 73 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-06 20:04:51,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:04:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-06 20:04:51,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313113414] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 20:04:51,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 20:04:51,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2024-11-06 20:04:51,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513145349] [2024-11-06 20:04:51,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:51,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:04:51,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:51,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:04:51,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-06 20:04:51,935 INFO L87 Difference]: Start difference. First operand 45286 states and 50588 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:54,598 INFO L93 Difference]: Finished difference Result 109317 states and 122120 transitions. [2024-11-06 20:04:54,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:04:54,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 329 [2024-11-06 20:04:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:54,676 INFO L225 Difference]: With dead ends: 109317 [2024-11-06 20:04:54,676 INFO L226 Difference]: Without dead ends: 64033 [2024-11-06 20:04:54,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 655 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-06 20:04:54,711 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 889 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 2868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:54,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 172 Invalid, 2868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 20:04:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64033 states. [2024-11-06 20:04:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64033 to 60203. [2024-11-06 20:04:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60203 states, 60202 states have (on average 1.1185176572206903) internal successors, (67337), 60202 states have internal predecessors, (67337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60203 states to 60203 states and 67337 transitions. [2024-11-06 20:04:55,462 INFO L78 Accepts]: Start accepts. Automaton has 60203 states and 67337 transitions. Word has length 329 [2024-11-06 20:04:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:55,463 INFO L471 AbstractCegarLoop]: Abstraction has 60203 states and 67337 transitions. [2024-11-06 20:04:55,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 60203 states and 67337 transitions. [2024-11-06 20:04:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-06 20:04:55,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:55,469 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-11-06 20:04:55,485 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-06 20:04:55,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:04:55,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:55,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:55,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1311562389, now seen corresponding path program 1 times [2024-11-06 20:04:55,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:55,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489861617] [2024-11-06 20:04:55,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:55,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-11-06 20:04:55,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:55,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489861617] [2024-11-06 20:04:55,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489861617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:55,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:55,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:55,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53383778] [2024-11-06 20:04:55,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:55,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:55,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:55,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:55,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:55,988 INFO L87 Difference]: Start difference. First operand 60203 states and 67337 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:57,908 INFO L93 Difference]: Finished difference Result 134019 states and 150109 transitions. [2024-11-06 20:04:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:57,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 359 [2024-11-06 20:04:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:57,990 INFO L225 Difference]: With dead ends: 134019 [2024-11-06 20:04:57,990 INFO L226 Difference]: Without dead ends: 70839 [2024-11-06 20:04:58,027 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-06 20:04:58,028 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 390 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:58,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 799 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:04:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70839 states. [2024-11-06 20:04:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70839 to 59739. [2024-11-06 20:04:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59739 states, 59738 states have (on average 1.1137634336603168) internal successors, (66534), 59738 states have internal predecessors, (66534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59739 states to 59739 states and 66534 transitions. [2024-11-06 20:04:58,744 INFO L78 Accepts]: Start accepts. Automaton has 59739 states and 66534 transitions. Word has length 359 [2024-11-06 20:04:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:58,745 INFO L471 AbstractCegarLoop]: Abstraction has 59739 states and 66534 transitions. [2024-11-06 20:04:58,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 59739 states and 66534 transitions. [2024-11-06 20:04:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2024-11-06 20:04:58,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:58,749 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-11-06 20:04:58,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 20:04:58,750 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:58,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1352739045, now seen corresponding path program 1 times [2024-11-06 20:04:58,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:58,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744760782] [2024-11-06 20:04:58,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-06 20:04:58,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:58,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744760782] [2024-11-06 20:04:58,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744760782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:58,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:58,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416501166] [2024-11-06 20:04:58,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:58,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:58,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:58,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:58,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:58,921 INFO L87 Difference]: Start difference. First operand 59739 states and 66534 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:00,870 INFO L93 Difference]: Finished difference Result 130129 states and 144808 transitions. [2024-11-06 20:05:00,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:00,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 400 [2024-11-06 20:05:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:00,949 INFO L225 Difference]: With dead ends: 130129 [2024-11-06 20:05:00,950 INFO L226 Difference]: Without dead ends: 69961 [2024-11-06 20:05:00,989 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-06 20:05:00,989 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 422 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:00,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 282 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:05:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69961 states. [2024-11-06 20:05:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69961 to 66125. [2024-11-06 20:05:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66125 states, 66124 states have (on average 1.1111245538684895) internal successors, (73472), 66124 states have internal predecessors, (73472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66125 states to 66125 states and 73472 transitions. [2024-11-06 20:05:01,914 INFO L78 Accepts]: Start accepts. Automaton has 66125 states and 73472 transitions. Word has length 400 [2024-11-06 20:05:01,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:01,914 INFO L471 AbstractCegarLoop]: Abstraction has 66125 states and 73472 transitions. [2024-11-06 20:05:01,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 66125 states and 73472 transitions. [2024-11-06 20:05:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2024-11-06 20:05:01,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:01,922 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:05:01,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 20:05:01,922 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:01,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:01,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2097456585, now seen corresponding path program 1 times [2024-11-06 20:05:01,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:01,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736064036] [2024-11-06 20:05:01,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:01,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:02,621 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 301 proven. 29 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-06 20:05:02,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736064036] [2024-11-06 20:05:02,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736064036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:05:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134771025] [2024-11-06 20:05:02,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:02,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:05:02,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:05:02,624 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-06 20:05:02,625 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-06 20:05:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:02,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 20:05:02,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:05:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 387 proven. 82 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-06 20:05:03,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:05:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 387 proven. 82 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-11-06 20:05:03,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134771025] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 20:05:03,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 20:05:03,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-11-06 20:05:03,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442918794] [2024-11-06 20:05:03,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 20:05:03,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 20:05:03,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:03,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 20:05:03,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 20:05:03,724 INFO L87 Difference]: Start difference. First operand 66125 states and 73472 transitions. Second operand has 9 states, 9 states have (on average 80.66666666666667) internal successors, (726), 9 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:15,244 INFO L93 Difference]: Finished difference Result 178219 states and 196759 transitions. [2024-11-06 20:05:15,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-06 20:05:15,245 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.66666666666667) internal successors, (726), 9 states have internal predecessors, (726), 0 states have call successors, (0), 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 411 [2024-11-06 20:05:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:15,344 INFO L225 Difference]: With dead ends: 178219 [2024-11-06 20:05:15,344 INFO L226 Difference]: Without dead ends: 106984 [2024-11-06 20:05:15,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 834 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2024-11-06 20:05:15,374 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 9620 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 14673 mSolverCounterSat, 2702 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9620 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 17375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2702 IncrementalHoareTripleChecker+Valid, 14673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:15,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9620 Valid, 467 Invalid, 17375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2702 Valid, 14673 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-11-06 20:05:15,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106984 states. [2024-11-06 20:05:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106984 to 87787. [2024-11-06 20:05:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87787 states, 87786 states have (on average 1.088430957100221) internal successors, (95549), 87786 states have internal predecessors, (95549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87787 states to 87787 states and 95549 transitions. [2024-11-06 20:05:16,261 INFO L78 Accepts]: Start accepts. Automaton has 87787 states and 95549 transitions. Word has length 411 [2024-11-06 20:05:16,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:16,261 INFO L471 AbstractCegarLoop]: Abstraction has 87787 states and 95549 transitions. [2024-11-06 20:05:16,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.66666666666667) internal successors, (726), 9 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:16,262 INFO L276 IsEmpty]: Start isEmpty. Operand 87787 states and 95549 transitions. [2024-11-06 20:05:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2024-11-06 20:05:16,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:16,268 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:05:16,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 20:05:16,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:05:16,469 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:16,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:16,469 INFO L85 PathProgramCache]: Analyzing trace with hash 300395610, now seen corresponding path program 1 times [2024-11-06 20:05:16,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:16,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603458092] [2024-11-06 20:05:16,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:16,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2024-11-06 20:05:16,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:16,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603458092] [2024-11-06 20:05:16,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603458092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:16,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:16,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:16,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451572758] [2024-11-06 20:05:16,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:16,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:16,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:16,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:16,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:16,968 INFO L87 Difference]: Start difference. First operand 87787 states and 95549 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:18,469 INFO L93 Difference]: Finished difference Result 173016 states and 188243 transitions. [2024-11-06 20:05:18,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:18,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 497 [2024-11-06 20:05:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:18,560 INFO L225 Difference]: With dead ends: 173016 [2024-11-06 20:05:18,560 INFO L226 Difference]: Without dead ends: 85231 [2024-11-06 20:05:18,617 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-06 20:05:18,618 INFO L432 NwaCegarLoop]: 636 mSDtfsCounter, 465 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:18,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 692 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:05:18,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85231 states. [2024-11-06 20:05:19,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85231 to 83529. [2024-11-06 20:05:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83529 states, 83528 states have (on average 1.0704554161478785) internal successors, (89413), 83528 states have internal predecessors, (89413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83529 states to 83529 states and 89413 transitions. [2024-11-06 20:05:19,644 INFO L78 Accepts]: Start accepts. Automaton has 83529 states and 89413 transitions. Word has length 497 [2024-11-06 20:05:19,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:19,645 INFO L471 AbstractCegarLoop]: Abstraction has 83529 states and 89413 transitions. [2024-11-06 20:05:19,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:19,645 INFO L276 IsEmpty]: Start isEmpty. Operand 83529 states and 89413 transitions. [2024-11-06 20:05:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2024-11-06 20:05:19,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:19,654 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:05:19,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 20:05:19,654 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:19,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:19,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1953857705, now seen corresponding path program 1 times [2024-11-06 20:05:19,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:19,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797820526] [2024-11-06 20:05:19,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:19,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:05:20,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:20,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797820526] [2024-11-06 20:05:20,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797820526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:20,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:20,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:20,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559145192] [2024-11-06 20:05:20,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:20,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:20,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:20,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:20,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:20,016 INFO L87 Difference]: Start difference. First operand 83529 states and 89413 transitions. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:21,574 INFO L93 Difference]: Finished difference Result 170876 states and 182734 transitions. [2024-11-06 20:05:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:21,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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 500 [2024-11-06 20:05:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:21,665 INFO L225 Difference]: With dead ends: 170876 [2024-11-06 20:05:21,666 INFO L226 Difference]: Without dead ends: 87349 [2024-11-06 20:05:21,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-06 20:05:21,717 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 396 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:21,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 662 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:05:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87349 states. [2024-11-06 20:05:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87349 to 83092. [2024-11-06 20:05:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83092 states, 83091 states have (on average 1.066108242769975) internal successors, (88584), 83091 states have internal predecessors, (88584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83092 states to 83092 states and 88584 transitions. [2024-11-06 20:05:22,636 INFO L78 Accepts]: Start accepts. Automaton has 83092 states and 88584 transitions. Word has length 500 [2024-11-06 20:05:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:22,637 INFO L471 AbstractCegarLoop]: Abstraction has 83092 states and 88584 transitions. [2024-11-06 20:05:22,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 83092 states and 88584 transitions. [2024-11-06 20:05:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2024-11-06 20:05:22,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:22,833 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:05:22,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 20:05:22,834 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:22,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:22,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1039151023, now seen corresponding path program 1 times [2024-11-06 20:05:22,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:22,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033722851] [2024-11-06 20:05:22,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:22,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:05:23,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:23,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033722851] [2024-11-06 20:05:23,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033722851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:23,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:23,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:23,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848073838] [2024-11-06 20:05:23,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:23,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:23,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:23,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:23,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:23,136 INFO L87 Difference]: Start difference. First operand 83092 states and 88584 transitions. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:24,865 INFO L93 Difference]: Finished difference Result 171308 states and 182689 transitions. [2024-11-06 20:05:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:24,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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 527 [2024-11-06 20:05:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:24,964 INFO L225 Difference]: With dead ends: 171308 [2024-11-06 20:05:24,964 INFO L226 Difference]: Without dead ends: 87792 [2024-11-06 20:05:25,019 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-06 20:05:25,020 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 402 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:25,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 177 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:05:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87792 states. [2024-11-06 20:05:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87792 to 82241. [2024-11-06 20:05:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82241 states, 82240 states have (on average 1.0644941634241245) internal successors, (87544), 82240 states have internal predecessors, (87544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82241 states to 82241 states and 87544 transitions. [2024-11-06 20:05:26,109 INFO L78 Accepts]: Start accepts. Automaton has 82241 states and 87544 transitions. Word has length 527 [2024-11-06 20:05:26,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:26,110 INFO L471 AbstractCegarLoop]: Abstraction has 82241 states and 87544 transitions. [2024-11-06 20:05:26,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:26,110 INFO L276 IsEmpty]: Start isEmpty. Operand 82241 states and 87544 transitions. [2024-11-06 20:05:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2024-11-06 20:05:26,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:26,124 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-06 20:05:26,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 20:05:26,124 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:26,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:26,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1481817610, now seen corresponding path program 1 times [2024-11-06 20:05:26,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:26,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272758957] [2024-11-06 20:05:26,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:26,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:26,532 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-11-06 20:05:26,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:26,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272758957] [2024-11-06 20:05:26,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272758957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:26,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:26,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:05:26,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959895906] [2024-11-06 20:05:26,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:26,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:05:26,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:26,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:05:26,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:05:26,534 INFO L87 Difference]: Start difference. First operand 82241 states and 87544 transitions. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:29,309 INFO L93 Difference]: Finished difference Result 187478 states and 199278 transitions. [2024-11-06 20:05:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:05:29,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 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 571 [2024-11-06 20:05:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:29,448 INFO L225 Difference]: With dead ends: 187478 [2024-11-06 20:05:29,448 INFO L226 Difference]: Without dead ends: 105239 [2024-11-06 20:05:29,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:05:29,510 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 721 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 2722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:29,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 187 Invalid, 2722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 20:05:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105239 states. [2024-11-06 20:05:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105239 to 98853. [2024-11-06 20:05:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98853 states, 98852 states have (on average 1.0601404119289444) internal successors, (104797), 98852 states have internal predecessors, (104797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98853 states to 98853 states and 104797 transitions. [2024-11-06 20:05:30,923 INFO L78 Accepts]: Start accepts. Automaton has 98853 states and 104797 transitions. Word has length 571 [2024-11-06 20:05:30,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:30,923 INFO L471 AbstractCegarLoop]: Abstraction has 98853 states and 104797 transitions. [2024-11-06 20:05:30,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 98853 states and 104797 transitions. [2024-11-06 20:05:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2024-11-06 20:05:30,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:30,935 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-06 20:05:30,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-06 20:05:30,935 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:30,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:30,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1778925136, now seen corresponding path program 1 times [2024-11-06 20:05:30,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:30,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231712923] [2024-11-06 20:05:30,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:30,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2024-11-06 20:05:31,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:31,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231712923] [2024-11-06 20:05:31,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231712923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:31,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:31,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:05:31,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974488547] [2024-11-06 20:05:31,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:31,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:05:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:31,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:05:31,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:05:31,822 INFO L87 Difference]: Start difference. First operand 98853 states and 104797 transitions. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:34,718 INFO L93 Difference]: Finished difference Result 218582 states and 231250 transitions. [2024-11-06 20:05:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:05:34,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 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 598 [2024-11-06 20:05:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:34,845 INFO L225 Difference]: With dead ends: 218582 [2024-11-06 20:05:34,846 INFO L226 Difference]: Without dead ends: 118881 [2024-11-06 20:05:34,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:05:34,871 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 814 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:34,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 167 Invalid, 2790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 20:05:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118881 states. [2024-11-06 20:05:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118881 to 105234. [2024-11-06 20:05:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105234 states, 105233 states have (on average 1.0591829559168702) internal successors, (111461), 105233 states have internal predecessors, (111461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105234 states to 105234 states and 111461 transitions. [2024-11-06 20:05:36,212 INFO L78 Accepts]: Start accepts. Automaton has 105234 states and 111461 transitions. Word has length 598 [2024-11-06 20:05:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:36,213 INFO L471 AbstractCegarLoop]: Abstraction has 105234 states and 111461 transitions. [2024-11-06 20:05:36,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 105234 states and 111461 transitions. [2024-11-06 20:05:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2024-11-06 20:05:36,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:36,227 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2024-11-06 20:05:36,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 20:05:36,227 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:36,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1606148972, now seen corresponding path program 1 times [2024-11-06 20:05:36,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:36,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239668984] [2024-11-06 20:05:36,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:36,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 767 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-06 20:05:36,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:36,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239668984] [2024-11-06 20:05:36,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239668984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:36,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:36,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:36,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510090912] [2024-11-06 20:05:36,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:36,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:36,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:36,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:36,900 INFO L87 Difference]: Start difference. First operand 105234 states and 111461 transitions. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:38,865 INFO L93 Difference]: Finished difference Result 220708 states and 233738 transitions. [2024-11-06 20:05:38,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:38,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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 599 [2024-11-06 20:05:38,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:39,003 INFO L225 Difference]: With dead ends: 220708 [2024-11-06 20:05:39,004 INFO L226 Difference]: Without dead ends: 115476 [2024-11-06 20:05:39,066 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-06 20:05:39,067 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 413 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:39,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 210 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:05:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115476 states. [2024-11-06 20:05:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115476 to 111191. [2024-11-06 20:05:40,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111191 states, 111190 states have (on average 1.058494468927062) internal successors, (117694), 111190 states have internal predecessors, (117694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111191 states to 111191 states and 117694 transitions. [2024-11-06 20:05:40,440 INFO L78 Accepts]: Start accepts. Automaton has 111191 states and 117694 transitions. Word has length 599 [2024-11-06 20:05:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:40,440 INFO L471 AbstractCegarLoop]: Abstraction has 111191 states and 117694 transitions. [2024-11-06 20:05:40,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 111191 states and 117694 transitions. [2024-11-06 20:05:40,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2024-11-06 20:05:40,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:40,452 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 20:05:40,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-06 20:05:40,452 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:40,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:40,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1623756611, now seen corresponding path program 1 times [2024-11-06 20:05:40,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:40,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243202932] [2024-11-06 20:05:40,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:40,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1359 backedges. 984 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2024-11-06 20:05:40,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:40,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243202932] [2024-11-06 20:05:40,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243202932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:40,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:40,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:40,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714916315] [2024-11-06 20:05:40,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:40,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:40,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:40,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:40,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:40,893 INFO L87 Difference]: Start difference. First operand 111191 states and 117694 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:42,703 INFO L93 Difference]: Finished difference Result 229187 states and 242472 transitions. [2024-11-06 20:05:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:42,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 636 [2024-11-06 20:05:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:42,830 INFO L225 Difference]: With dead ends: 229187 [2024-11-06 20:05:42,830 INFO L226 Difference]: Without dead ends: 117998 [2024-11-06 20:05:42,864 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-06 20:05:42,864 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 383 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:42,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 289 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 20:05:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117998 states. [2024-11-06 20:05:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117998 to 114591. [2024-11-06 20:05:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114591 states, 114590 states have (on average 1.0565319835936817) internal successors, (121068), 114590 states have internal predecessors, (121068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:44,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114591 states to 114591 states and 121068 transitions. [2024-11-06 20:05:44,220 INFO L78 Accepts]: Start accepts. Automaton has 114591 states and 121068 transitions. Word has length 636 [2024-11-06 20:05:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:44,221 INFO L471 AbstractCegarLoop]: Abstraction has 114591 states and 121068 transitions. [2024-11-06 20:05:44,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 114591 states and 121068 transitions. [2024-11-06 20:05:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2024-11-06 20:05:44,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:44,233 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:05:44,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-06 20:05:44,233 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:44,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:44,234 INFO L85 PathProgramCache]: Analyzing trace with hash 188817630, now seen corresponding path program 1 times [2024-11-06 20:05:44,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:44,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595911466] [2024-11-06 20:05:44,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:44,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-11-06 20:05:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:44,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595911466] [2024-11-06 20:05:44,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595911466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:44,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:44,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 20:05:44,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762361254] [2024-11-06 20:05:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:44,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 20:05:44,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:44,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 20:05:44,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:05:44,733 INFO L87 Difference]: Start difference. First operand 114591 states and 121068 transitions. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)