./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label49.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_label49.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', 'efd9f0184b4cf1cfcb5f9b1d78709aac2b2266fe0e62322fe4e22ac75e57a068'] 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_label49.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 efd9f0184b4cf1cfcb5f9b1d78709aac2b2266fe0e62322fe4e22ac75e57a068 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:08:52,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:08:52,469 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:08:52,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:08:52,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:08:52,503 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:08:52,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:08:52,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:08:52,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:08:52,505 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:08:52,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:08:52,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:08:52,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:08:52,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:08:52,507 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:08:52,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:08:52,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:08:52,508 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:08:52,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:08:52,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:08:52,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:08:52,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:08:52,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:08:52,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:08:52,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:08:52,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:08:52,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:08:52,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:08:52,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:08:52,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:08:52,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:08:52,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:08:52,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:08:52,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:08:52,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:08:52,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:08:52,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:08:52,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:08:52,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:08:52,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:08:52,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:08:52,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:08:52,512 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 -> efd9f0184b4cf1cfcb5f9b1d78709aac2b2266fe0e62322fe4e22ac75e57a068 [2024-11-06 20:08:52,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:08:52,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:08:52,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:08:52,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:08:52,804 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:08:52,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label49.c [2024-11-06 20:08:54,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:08:54,549 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:08:54,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label49.c [2024-11-06 20:08:54,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc38d6086/facaddfc08da4824a01972cb3b80428b/FLAG3575db612 [2024-11-06 20:08:54,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc38d6086/facaddfc08da4824a01972cb3b80428b [2024-11-06 20:08:54,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:08:54,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:08:54,602 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:08:54,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:08:54,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:08:54,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:08:54" (1/1) ... [2024-11-06 20:08:54,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a6a261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:54, skipping insertion in model container [2024-11-06 20:08:54,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:08:54" (1/1) ... [2024-11-06 20:08:54,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:08:54,843 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_label49.c[2362,2375] [2024-11-06 20:08:55,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:08:55,413 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:08:55,429 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_label49.c[2362,2375] [2024-11-06 20:08:55,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:08:55,713 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:08:55,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:55 WrapperNode [2024-11-06 20:08:55,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:08:55,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:08:55,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:08:55,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:08:55,725 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:08:55" (1/1) ... [2024-11-06 20:08:55,770 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:08:55" (1/1) ... [2024-11-06 20:08:56,092 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-11-06 20:08:56,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:08:56,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:08:56,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:08:56,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:08:56,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:55" (1/1) ... [2024-11-06 20:08:56,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:55" (1/1) ... [2024-11-06 20:08:56,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:55" (1/1) ... [2024-11-06 20:08:56,388 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:08:56,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:55" (1/1) ... [2024-11-06 20:08:56,389 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:55" (1/1) ... [2024-11-06 20:08:56,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:55" (1/1) ... [2024-11-06 20:08:56,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:55" (1/1) ... [2024-11-06 20:08:56,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:55" (1/1) ... [2024-11-06 20:08:56,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:55" (1/1) ... [2024-11-06 20:08:56,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:08:56,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:08:56,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:08:56,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:08:56,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:55" (1/1) ... [2024-11-06 20:08:56,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:08:56,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:08:56,707 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:08:56,710 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:08:56,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:08:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:08:56,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:08:56,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:08:56,795 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:08:56,797 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:09:00,123 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-11-06 20:09:00,123 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:09:00,154 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:09:00,154 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:09:00,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:09:00 BoogieIcfgContainer [2024-11-06 20:09:00,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:09:00,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:09:00,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:09:00,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:09:00,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:08:54" (1/3) ... [2024-11-06 20:09:00,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46afbba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:09:00, skipping insertion in model container [2024-11-06 20:09:00,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:08:55" (2/3) ... [2024-11-06 20:09:00,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46afbba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:09:00, skipping insertion in model container [2024-11-06 20:09:00,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:09:00" (3/3) ... [2024-11-06 20:09:00,169 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label49.c [2024-11-06 20:09:00,182 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:09:00,183 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:09:00,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:09:00,262 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;@715777e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:09:00,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:09:00,268 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:09:00,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-06 20:09:00,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:00,275 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:09:00,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:00,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash -884752143, now seen corresponding path program 1 times [2024-11-06 20:09:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:00,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100338819] [2024-11-06 20:09:00,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:00,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:00,506 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:09:00,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:00,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100338819] [2024-11-06 20:09:00,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100338819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:00,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:00,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:09:00,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184713697] [2024-11-06 20:09:00,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:00,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:00,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:00,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:00,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:00,536 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 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:09:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:03,071 INFO L93 Difference]: Finished difference Result 1644 states and 3029 transitions. [2024-11-06 20:09:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:03,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-11-06 20:09:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:03,089 INFO L225 Difference]: With dead ends: 1644 [2024-11-06 20:09:03,089 INFO L226 Difference]: Without dead ends: 977 [2024-11-06 20:09:03,094 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:09:03,096 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 473 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:03,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 20:09:03,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-06 20:09:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2024-11-06 20:09:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states 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:09:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2024-11-06 20:09:03,192 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 15 [2024-11-06 20:09:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:03,193 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2024-11-06 20:09:03,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states 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:09:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2024-11-06 20:09:03,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-06 20:09:03,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:03,195 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:09:03,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:09:03,196 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:03,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:03,197 INFO L85 PathProgramCache]: Analyzing trace with hash 732011866, now seen corresponding path program 1 times [2024-11-06 20:09:03,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:03,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211955565] [2024-11-06 20:09:03,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:03,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:09:03,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:03,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211955565] [2024-11-06 20:09:03,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211955565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:03,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:03,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:09:03,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633037276] [2024-11-06 20:09:03,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:03,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:03,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:03,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:03,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:03,527 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:09:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:05,575 INFO L93 Difference]: Finished difference Result 2815 states and 4382 transitions. [2024-11-06 20:09:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:05,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-06 20:09:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:05,584 INFO L225 Difference]: With dead ends: 2815 [2024-11-06 20:09:05,584 INFO L226 Difference]: Without dead ends: 1846 [2024-11-06 20:09:05,586 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:09:05,587 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:05,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 20:09:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2024-11-06 20:09:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1841. [2024-11-06 20:09:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.3505434782608696) internal successors, (2485), 1840 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states 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:09:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2485 transitions. [2024-11-06 20:09:05,640 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2485 transitions. Word has length 82 [2024-11-06 20:09:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:05,641 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2485 transitions. [2024-11-06 20:09:05,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states 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:09:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2485 transitions. [2024-11-06 20:09:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-06 20:09:05,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:05,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:09:05,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:09:05,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:05,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash 550978212, now seen corresponding path program 1 times [2024-11-06 20:09:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:05,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904348537] [2024-11-06 20:09:05,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:05,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:09:06,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:06,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904348537] [2024-11-06 20:09:06,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904348537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:06,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:06,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:06,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408969341] [2024-11-06 20:09:06,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:06,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:09:06,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:06,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:09:06,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:09:06,049 INFO L87 Difference]: Start difference. First operand 1841 states and 2485 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:09:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:09,021 INFO L93 Difference]: Finished difference Result 6765 states and 9262 transitions. [2024-11-06 20:09:09,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:09:09,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-06 20:09:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:09,040 INFO L225 Difference]: With dead ends: 6765 [2024-11-06 20:09:09,041 INFO L226 Difference]: Without dead ends: 4926 [2024-11-06 20:09:09,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:09:09,046 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 951 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 3289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:09,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 286 Invalid, 3289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 20:09:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2024-11-06 20:09:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 4875. [2024-11-06 20:09:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.2866228970045137) internal successors, (6271), 4874 states have internal predecessors, (6271), 0 states have call successors, (0), 0 states 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:09:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6271 transitions. [2024-11-06 20:09:09,134 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6271 transitions. Word has length 85 [2024-11-06 20:09:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:09,134 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6271 transitions. [2024-11-06 20:09:09,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states 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:09:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6271 transitions. [2024-11-06 20:09:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-06 20:09:09,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:09,138 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:09:09,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:09:09,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:09,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:09,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1065973743, now seen corresponding path program 1 times [2024-11-06 20:09:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:09,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464709462] [2024-11-06 20:09:09,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-06 20:09:09,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464709462] [2024-11-06 20:09:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464709462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:09,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:09,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:09:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454898724] [2024-11-06 20:09:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:09,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:09,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:09,434 INFO L87 Difference]: Start difference. First operand 4875 states and 6271 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:09:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:11,153 INFO L93 Difference]: Finished difference Result 14436 states and 18544 transitions. [2024-11-06 20:09:11,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:11,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 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 156 [2024-11-06 20:09:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:11,173 INFO L225 Difference]: With dead ends: 14436 [2024-11-06 20:09:11,174 INFO L226 Difference]: Without dead ends: 8277 [2024-11-06 20:09:11,182 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:09:11,183 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 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.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:11,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 20:09:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2024-11-06 20:09:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6144. [2024-11-06 20:09:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6144 states, 6143 states have (on average 1.1909490476965652) internal successors, (7316), 6143 states have internal predecessors, (7316), 0 states have call successors, (0), 0 states 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:09:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6144 states to 6144 states and 7316 transitions. [2024-11-06 20:09:11,284 INFO L78 Accepts]: Start accepts. Automaton has 6144 states and 7316 transitions. Word has length 156 [2024-11-06 20:09:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:11,285 INFO L471 AbstractCegarLoop]: Abstraction has 6144 states and 7316 transitions. [2024-11-06 20:09:11,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:09:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 6144 states and 7316 transitions. [2024-11-06 20:09:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-06 20:09:11,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:11,290 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:09:11,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 20:09:11,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:11,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:11,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1239550733, now seen corresponding path program 1 times [2024-11-06 20:09:11,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:11,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226163470] [2024-11-06 20:09:11,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:11,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:11,658 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 20:09:11,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226163470] [2024-11-06 20:09:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226163470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:11,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:11,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:11,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252006814] [2024-11-06 20:09:11,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:11,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:11,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:11,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:11,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:11,660 INFO L87 Difference]: Start difference. First operand 6144 states and 7316 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:09:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:13,520 INFO L93 Difference]: Finished difference Result 15306 states and 18462 transitions. [2024-11-06 20:09:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:13,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 169 [2024-11-06 20:09:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:13,539 INFO L225 Difference]: With dead ends: 15306 [2024-11-06 20:09:13,539 INFO L226 Difference]: Without dead ends: 9164 [2024-11-06 20:09:13,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:13,546 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 502 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:13,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 454 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 20:09:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9164 states. [2024-11-06 20:09:13,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9164 to 8291. [2024-11-06 20:09:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8291 states, 8290 states have (on average 1.216043425814234) internal successors, (10081), 8290 states have internal predecessors, (10081), 0 states have call successors, (0), 0 states 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:09:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8291 states to 8291 states and 10081 transitions. [2024-11-06 20:09:13,664 INFO L78 Accepts]: Start accepts. Automaton has 8291 states and 10081 transitions. Word has length 169 [2024-11-06 20:09:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:13,665 INFO L471 AbstractCegarLoop]: Abstraction has 8291 states and 10081 transitions. [2024-11-06 20:09:13,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:09:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 8291 states and 10081 transitions. [2024-11-06 20:09:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-06 20:09:13,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:13,667 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:09:13,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:09:13,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:13,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash -830729473, now seen corresponding path program 1 times [2024-11-06 20:09:13,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:13,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536770265] [2024-11-06 20:09:13,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 20:09:13,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:13,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536770265] [2024-11-06 20:09:13,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536770265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:13,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:13,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:13,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147469774] [2024-11-06 20:09:13,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:13,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:13,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:13,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:13,874 INFO L87 Difference]: Start difference. First operand 8291 states and 10081 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states 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:09:15,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:15,482 INFO L93 Difference]: Finished difference Result 21259 states and 26395 transitions. [2024-11-06 20:09:15,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:15,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 172 [2024-11-06 20:09:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:15,514 INFO L225 Difference]: With dead ends: 21259 [2024-11-06 20:09:15,514 INFO L226 Difference]: Without dead ends: 12970 [2024-11-06 20:09:15,522 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:09:15,523 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 490 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:15,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 799 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:09:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12970 states. [2024-11-06 20:09:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 12970. [2024-11-06 20:09:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12970 states, 12969 states have (on average 1.1981648546534043) internal successors, (15539), 12969 states have internal predecessors, (15539), 0 states have call successors, (0), 0 states 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:09:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12970 states to 12970 states and 15539 transitions. [2024-11-06 20:09:15,797 INFO L78 Accepts]: Start accepts. Automaton has 12970 states and 15539 transitions. Word has length 172 [2024-11-06 20:09:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:15,798 INFO L471 AbstractCegarLoop]: Abstraction has 12970 states and 15539 transitions. [2024-11-06 20:09:15,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states 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:09:15,805 INFO L276 IsEmpty]: Start isEmpty. Operand 12970 states and 15539 transitions. [2024-11-06 20:09:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-06 20:09:15,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:15,812 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:09:15,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:09:15,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:15,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:15,813 INFO L85 PathProgramCache]: Analyzing trace with hash -688792282, now seen corresponding path program 1 times [2024-11-06 20:09:15,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:15,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872589195] [2024-11-06 20:09:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:15,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 164 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 20:09:16,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:16,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872589195] [2024-11-06 20:09:16,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872589195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:09:16,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417267635] [2024-11-06 20:09:16,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:16,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:09:16,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:09:16,303 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:09:16,305 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:09:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:16,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 20:09:16,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:09:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 164 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 20:09:16,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:09:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 20:09:17,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417267635] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 20:09:17,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 20:09:17,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-11-06 20:09:17,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469156255] [2024-11-06 20:09:17,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:17,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:09:17,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:17,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:09:17,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:09:17,009 INFO L87 Difference]: Start difference. First operand 12970 states and 15539 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:09:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:19,920 INFO L93 Difference]: Finished difference Result 37036 states and 44927 transitions. [2024-11-06 20:09:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:09:19,921 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 239 [2024-11-06 20:09:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:19,976 INFO L225 Difference]: With dead ends: 37036 [2024-11-06 20:09:19,976 INFO L226 Difference]: Without dead ends: 22759 [2024-11-06 20:09:19,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 475 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:09:19,996 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 886 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:19,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 163 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 20:09:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22759 states. [2024-11-06 20:09:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22759 to 22753. [2024-11-06 20:09:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22753 states, 22752 states have (on average 1.1602496483825597) internal successors, (26398), 22752 states have internal predecessors, (26398), 0 states have call successors, (0), 0 states 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:09:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22753 states to 22753 states and 26398 transitions. [2024-11-06 20:09:20,294 INFO L78 Accepts]: Start accepts. Automaton has 22753 states and 26398 transitions. Word has length 239 [2024-11-06 20:09:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:20,294 INFO L471 AbstractCegarLoop]: Abstraction has 22753 states and 26398 transitions. [2024-11-06 20:09:20,294 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:09:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 22753 states and 26398 transitions. [2024-11-06 20:09:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-06 20:09:20,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:20,299 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:20,318 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:09:20,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:09:20,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:20,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1742726696, now seen corresponding path program 1 times [2024-11-06 20:09:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:20,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836095203] [2024-11-06 20:09:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:20,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:09:20,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:20,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836095203] [2024-11-06 20:09:20,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836095203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:20,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:20,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:20,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031513183] [2024-11-06 20:09:20,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:20,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:20,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:20,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:20,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:20,778 INFO L87 Difference]: Start difference. First operand 22753 states and 26398 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:09:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:22,558 INFO L93 Difference]: Finished difference Result 51932 states and 60510 transitions. [2024-11-06 20:09:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:22,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2024-11-06 20:09:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:22,608 INFO L225 Difference]: With dead ends: 51932 [2024-11-06 20:09:22,608 INFO L226 Difference]: Without dead ends: 28329 [2024-11-06 20:09:22,631 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:09:22,632 INFO L432 NwaCegarLoop]: 710 mSDtfsCounter, 301 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:22,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 778 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:09:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28329 states. [2024-11-06 20:09:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28329 to 27895. [2024-11-06 20:09:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27895 states, 27894 states have (on average 1.1442604144260415) internal successors, (31918), 27894 states have internal predecessors, (31918), 0 states have call successors, (0), 0 states 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:09:23,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27895 states to 27895 states and 31918 transitions. [2024-11-06 20:09:23,088 INFO L78 Accepts]: Start accepts. Automaton has 27895 states and 31918 transitions. Word has length 272 [2024-11-06 20:09:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:23,088 INFO L471 AbstractCegarLoop]: Abstraction has 27895 states and 31918 transitions. [2024-11-06 20:09:23,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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:09:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 27895 states and 31918 transitions. [2024-11-06 20:09:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-06 20:09:23,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:23,104 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 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] [2024-11-06 20:09:23,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 20:09:23,107 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:23,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash 914567840, now seen corresponding path program 1 times [2024-11-06 20:09:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:23,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287441149] [2024-11-06 20:09:23,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-11-06 20:09:23,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:23,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287441149] [2024-11-06 20:09:23,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287441149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:23,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:23,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:23,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629223234] [2024-11-06 20:09:23,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:23,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:23,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:23,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:23,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:23,565 INFO L87 Difference]: Start difference. First operand 27895 states and 31918 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 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:09:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:25,271 INFO L93 Difference]: Finished difference Result 66017 states and 75501 transitions. [2024-11-06 20:09:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:25,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 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 333 [2024-11-06 20:09:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:25,323 INFO L225 Difference]: With dead ends: 66017 [2024-11-06 20:09:25,323 INFO L226 Difference]: Without dead ends: 37699 [2024-11-06 20:09:25,344 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:09:25,345 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 484 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:25,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 275 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:09:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37699 states. [2024-11-06 20:09:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37699 to 36822. [2024-11-06 20:09:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36822 states, 36821 states have (on average 1.1376931642269357) internal successors, (41891), 36821 states have internal predecessors, (41891), 0 states have call successors, (0), 0 states 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:09:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36822 states to 36822 states and 41891 transitions. [2024-11-06 20:09:25,846 INFO L78 Accepts]: Start accepts. Automaton has 36822 states and 41891 transitions. Word has length 333 [2024-11-06 20:09:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:25,847 INFO L471 AbstractCegarLoop]: Abstraction has 36822 states and 41891 transitions. [2024-11-06 20:09:25,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 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:09:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 36822 states and 41891 transitions. [2024-11-06 20:09:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-06 20:09:25,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:25,853 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:25,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 20:09:25,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:25,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash -245028848, now seen corresponding path program 1 times [2024-11-06 20:09:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:25,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214457913] [2024-11-06 20:09:25,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:25,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-06 20:09:26,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:26,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214457913] [2024-11-06 20:09:26,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214457913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:26,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:26,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:26,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525538511] [2024-11-06 20:09:26,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:26,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:26,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:26,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:26,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:26,174 INFO L87 Difference]: Start difference. First operand 36822 states and 41891 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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:09:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:27,770 INFO L93 Difference]: Finished difference Result 82137 states and 93800 transitions. [2024-11-06 20:09:27,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:27,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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 354 [2024-11-06 20:09:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:27,822 INFO L225 Difference]: With dead ends: 82137 [2024-11-06 20:09:27,823 INFO L226 Difference]: Without dead ends: 45317 [2024-11-06 20:09:27,853 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:09:27,854 INFO L432 NwaCegarLoop]: 727 mSDtfsCounter, 272 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:27,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 789 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:09:27,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2024-11-06 20:09:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 45317. [2024-11-06 20:09:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45317 states, 45316 states have (on average 1.1218333480448406) internal successors, (50837), 45316 states have internal predecessors, (50837), 0 states have call successors, (0), 0 states 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:09:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45317 states to 45317 states and 50837 transitions. [2024-11-06 20:09:28,365 INFO L78 Accepts]: Start accepts. Automaton has 45317 states and 50837 transitions. Word has length 354 [2024-11-06 20:09:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:28,365 INFO L471 AbstractCegarLoop]: Abstraction has 45317 states and 50837 transitions. [2024-11-06 20:09:28,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states 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:09:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 45317 states and 50837 transitions. [2024-11-06 20:09:28,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-11-06 20:09:28,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:28,373 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:28,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 20:09:28,373 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:28,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:28,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2035165701, now seen corresponding path program 1 times [2024-11-06 20:09:28,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:28,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424273245] [2024-11-06 20:09:28,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:28,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:09:29,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:29,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424273245] [2024-11-06 20:09:29,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424273245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:29,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:29,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:29,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736370734] [2024-11-06 20:09:29,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:29,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:29,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:29,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:29,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:29,104 INFO L87 Difference]: Start difference. First operand 45317 states and 50837 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:09:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:30,839 INFO L93 Difference]: Finished difference Result 104723 states and 117661 transitions. [2024-11-06 20:09:30,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:30,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 377 [2024-11-06 20:09:30,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:30,901 INFO L225 Difference]: With dead ends: 104723 [2024-11-06 20:09:30,902 INFO L226 Difference]: Without dead ends: 59408 [2024-11-06 20:09:30,936 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:09:30,937 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 335 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:30,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 653 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:09:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59408 states. [2024-11-06 20:09:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59408 to 56825. [2024-11-06 20:09:31,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56825 states, 56824 states have (on average 1.1257919189075039) internal successors, (63972), 56824 states have internal predecessors, (63972), 0 states have call successors, (0), 0 states 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:09:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56825 states to 56825 states and 63972 transitions. [2024-11-06 20:09:31,864 INFO L78 Accepts]: Start accepts. Automaton has 56825 states and 63972 transitions. Word has length 377 [2024-11-06 20:09:31,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:31,865 INFO L471 AbstractCegarLoop]: Abstraction has 56825 states and 63972 transitions. [2024-11-06 20:09:31,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:09:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 56825 states and 63972 transitions. [2024-11-06 20:09:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2024-11-06 20:09:31,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:31,874 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:31,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 20:09:31,874 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:31,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1342155775, now seen corresponding path program 1 times [2024-11-06 20:09:31,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:31,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556821488] [2024-11-06 20:09:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:31,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:09:32,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:32,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556821488] [2024-11-06 20:09:32,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556821488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:32,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:32,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:09:32,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684613833] [2024-11-06 20:09:32,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:32,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:09:32,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:32,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:09:32,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:09:32,586 INFO L87 Difference]: Start difference. First operand 56825 states and 63972 transitions. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states 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:09:35,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:35,317 INFO L93 Difference]: Finished difference Result 142214 states and 159746 transitions. [2024-11-06 20:09:35,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:09:35,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 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 420 [2024-11-06 20:09:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:35,412 INFO L225 Difference]: With dead ends: 142214 [2024-11-06 20:09:35,412 INFO L226 Difference]: Without dead ends: 84966 [2024-11-06 20:09:35,438 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:09:35,439 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 813 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 2543 mSolverCounterSat, 477 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 3020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 2543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:35,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 165 Invalid, 3020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 2543 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 20:09:35,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84966 states. [2024-11-06 20:09:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84966 to 76387. [2024-11-06 20:09:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76387 states, 76386 states have (on average 1.1186212133113398) internal successors, (85447), 76386 states have internal predecessors, (85447), 0 states have call successors, (0), 0 states 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:09:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76387 states to 76387 states and 85447 transitions. [2024-11-06 20:09:36,203 INFO L78 Accepts]: Start accepts. Automaton has 76387 states and 85447 transitions. Word has length 420 [2024-11-06 20:09:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:36,204 INFO L471 AbstractCegarLoop]: Abstraction has 76387 states and 85447 transitions. [2024-11-06 20:09:36,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states 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:09:36,204 INFO L276 IsEmpty]: Start isEmpty. Operand 76387 states and 85447 transitions. [2024-11-06 20:09:36,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-06 20:09:36,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:36,212 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:36,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 20:09:36,212 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:36,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1101500681, now seen corresponding path program 1 times [2024-11-06 20:09:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422736011] [2024-11-06 20:09:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:36,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:09:37,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:37,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422736011] [2024-11-06 20:09:37,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422736011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:37,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:37,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 20:09:37,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045304902] [2024-11-06 20:09:37,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:37,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 20:09:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:37,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 20:09:37,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:09:37,255 INFO L87 Difference]: Start difference. First operand 76387 states and 85447 transitions. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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:09:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:40,252 INFO L93 Difference]: Finished difference Result 177078 states and 198314 transitions. [2024-11-06 20:09:40,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 20:09:40,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 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 427 [2024-11-06 20:09:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:40,412 INFO L225 Difference]: With dead ends: 177078 [2024-11-06 20:09:40,412 INFO L226 Difference]: Without dead ends: 100693 [2024-11-06 20:09:40,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:09:40,471 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 1109 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 3280 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 3710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 3280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:40,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 195 Invalid, 3710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 3280 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 20:09:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100693 states. [2024-11-06 20:09:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100693 to 91743. [2024-11-06 20:09:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91743 states, 91742 states have (on average 1.1246539207778334) internal successors, (103178), 91742 states have internal predecessors, (103178), 0 states have call successors, (0), 0 states 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:09:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91743 states to 91743 states and 103178 transitions. [2024-11-06 20:09:41,568 INFO L78 Accepts]: Start accepts. Automaton has 91743 states and 103178 transitions. Word has length 427 [2024-11-06 20:09:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:41,569 INFO L471 AbstractCegarLoop]: Abstraction has 91743 states and 103178 transitions. [2024-11-06 20:09:41,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states 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:09:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 91743 states and 103178 transitions. [2024-11-06 20:09:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2024-11-06 20:09:41,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:41,576 INFO L215 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2024-11-06 20:09:41,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 20:09:41,576 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:41,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:41,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1041711692, now seen corresponding path program 1 times [2024-11-06 20:09:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:41,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863847298] [2024-11-06 20:09:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:41,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-06 20:09:41,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:41,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863847298] [2024-11-06 20:09:41,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863847298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:41,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:41,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:09:41,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027345656] [2024-11-06 20:09:41,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:41,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:41,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:41,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:41,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:41,997 INFO L87 Difference]: Start difference. First operand 91743 states and 103178 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:09:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:43,349 INFO L93 Difference]: Finished difference Result 180064 states and 202010 transitions. [2024-11-06 20:09:43,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:43,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 441 [2024-11-06 20:09:43,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:43,432 INFO L225 Difference]: With dead ends: 180064 [2024-11-06 20:09:43,432 INFO L226 Difference]: Without dead ends: 88323 [2024-11-06 20:09:43,465 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:09:43,466 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 632 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:43,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 108 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 20:09:43,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88323 states. [2024-11-06 20:09:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88323 to 86189. [2024-11-06 20:09:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86189 states, 86188 states have (on average 1.1202951687009792) internal successors, (96556), 86188 states have internal predecessors, (96556), 0 states have call successors, (0), 0 states 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:09:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86189 states to 86189 states and 96556 transitions. [2024-11-06 20:09:44,507 INFO L78 Accepts]: Start accepts. Automaton has 86189 states and 96556 transitions. Word has length 441 [2024-11-06 20:09:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:44,508 INFO L471 AbstractCegarLoop]: Abstraction has 86189 states and 96556 transitions. [2024-11-06 20:09:44,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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:09:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 86189 states and 96556 transitions. [2024-11-06 20:09:44,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2024-11-06 20:09:44,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:44,515 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:44,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 20:09:44,516 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:44,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1617215359, now seen corresponding path program 1 times [2024-11-06 20:09:44,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:44,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922078659] [2024-11-06 20:09:44,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:44,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-06 20:09:45,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:45,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922078659] [2024-11-06 20:09:45,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922078659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:45,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:45,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:09:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112627872] [2024-11-06 20:09:45,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:45,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:09:45,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:45,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:09:45,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:09:45,153 INFO L87 Difference]: Start difference. First operand 86189 states and 96556 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:09:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:48,045 INFO L93 Difference]: Finished difference Result 201378 states and 224872 transitions. [2024-11-06 20:09:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:09:48,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 0 states have call successors, (0), 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 459 [2024-11-06 20:09:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:48,168 INFO L225 Difference]: With dead ends: 201378 [2024-11-06 20:09:48,168 INFO L226 Difference]: Without dead ends: 111783 [2024-11-06 20:09:48,215 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:09:48,215 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 774 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:48,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 249 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 20:09:48,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111783 states. [2024-11-06 20:09:49,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111783 to 107891. [2024-11-06 20:09:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107891 states, 107890 states have (on average 1.113161553434053) internal successors, (120099), 107890 states have internal predecessors, (120099), 0 states have call successors, (0), 0 states 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:09:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107891 states to 107891 states and 120099 transitions. [2024-11-06 20:09:49,536 INFO L78 Accepts]: Start accepts. Automaton has 107891 states and 120099 transitions. Word has length 459 [2024-11-06 20:09:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:49,537 INFO L471 AbstractCegarLoop]: Abstraction has 107891 states and 120099 transitions. [2024-11-06 20:09:49,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:09:49,537 INFO L276 IsEmpty]: Start isEmpty. Operand 107891 states and 120099 transitions. [2024-11-06 20:09:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2024-11-06 20:09:49,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:49,546 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:49,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 20:09:49,546 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:49,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:49,546 INFO L85 PathProgramCache]: Analyzing trace with hash 972152963, now seen corresponding path program 1 times [2024-11-06 20:09:49,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:49,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437585503] [2024-11-06 20:09:49,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:49,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 255 proven. 82 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-06 20:09:50,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437585503] [2024-11-06 20:09:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437585503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:09:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674989130] [2024-11-06 20:09:50,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:50,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:09:50,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:09:50,450 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:09:50,452 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:09:50,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:50,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 20:09:50,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:09:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:09:53,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 20:09:53,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674989130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:53,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 20:09:53,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 20:09:53,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048098344] [2024-11-06 20:09:53,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:53,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:53,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:53,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:09:53,197 INFO L87 Difference]: Start difference. First operand 107891 states and 120099 transitions. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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:09:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:55,356 INFO L93 Difference]: Finished difference Result 226887 states and 252354 transitions. [2024-11-06 20:09:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:55,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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 470 [2024-11-06 20:09:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:55,491 INFO L225 Difference]: With dead ends: 226887 [2024-11-06 20:09:55,491 INFO L226 Difference]: Without dead ends: 118998 [2024-11-06 20:09:55,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:09:55,554 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 233 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:55,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 367 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 20:09:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118998 states. [2024-11-06 20:09:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118998 to 115570. [2024-11-06 20:09:56,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115570 states, 115569 states have (on average 1.1057550035044) internal successors, (127791), 115569 states have internal predecessors, (127791), 0 states have call successors, (0), 0 states 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:09:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115570 states to 115570 states and 127791 transitions. [2024-11-06 20:09:57,188 INFO L78 Accepts]: Start accepts. Automaton has 115570 states and 127791 transitions. Word has length 470 [2024-11-06 20:09:57,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:09:57,188 INFO L471 AbstractCegarLoop]: Abstraction has 115570 states and 127791 transitions. [2024-11-06 20:09:57,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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:09:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 115570 states and 127791 transitions. [2024-11-06 20:09:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2024-11-06 20:09:57,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:09:57,201 INFO L215 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:57,213 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:09:57,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-06 20:09:57,401 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:09:57,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:09:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash -177803075, now seen corresponding path program 1 times [2024-11-06 20:09:57,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:09:57,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096939843] [2024-11-06 20:09:57,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:09:57,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:09:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:09:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-11-06 20:09:57,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:09:57,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096939843] [2024-11-06 20:09:57,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096939843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:09:57,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:09:57,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:09:57,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739249600] [2024-11-06 20:09:57,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:09:57,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:09:57,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:09:57,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:09:57,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:09:57,653 INFO L87 Difference]: Start difference. First operand 115570 states and 127791 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:09:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:09:59,564 INFO L93 Difference]: Finished difference Result 243465 states and 268931 transitions. [2024-11-06 20:09:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:09:59,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 507 [2024-11-06 20:09:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:09:59,698 INFO L225 Difference]: With dead ends: 243465 [2024-11-06 20:09:59,698 INFO L226 Difference]: Without dead ends: 127897 [2024-11-06 20:09:59,758 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:09:59,758 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 402 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:09:59,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 332 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:09:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127897 states. [2024-11-06 20:10:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127897 to 123211. [2024-11-06 20:10:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123211 states, 123210 states have (on average 1.0997483970456943) internal successors, (135500), 123210 states have internal predecessors, (135500), 0 states have call successors, (0), 0 states 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:10:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123211 states to 123211 states and 135500 transitions. [2024-11-06 20:10:01,648 INFO L78 Accepts]: Start accepts. Automaton has 123211 states and 135500 transitions. Word has length 507 [2024-11-06 20:10:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:10:01,648 INFO L471 AbstractCegarLoop]: Abstraction has 123211 states and 135500 transitions. [2024-11-06 20:10:01,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:10:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 123211 states and 135500 transitions. [2024-11-06 20:10:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2024-11-06 20:10:01,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:10:01,661 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-06 20:10:01,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 20:10:01,661 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:10:01,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:10:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash 68403437, now seen corresponding path program 1 times [2024-11-06 20:10:01,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:10:01,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751361147] [2024-11-06 20:10:01,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:10:01,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:10:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:10:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-11-06 20:10:02,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:10:02,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751361147] [2024-11-06 20:10:02,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751361147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:10:02,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:10:02,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:10:02,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13139511] [2024-11-06 20:10:02,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:10:02,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:10:02,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:10:02,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:10:02,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:10:02,355 INFO L87 Difference]: Start difference. First operand 123211 states and 135500 transitions. Second operand has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:10:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:10:05,157 INFO L93 Difference]: Finished difference Result 274974 states and 302066 transitions. [2024-11-06 20:10:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:10:05,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 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 539 [2024-11-06 20:10:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:10:05,320 INFO L225 Difference]: With dead ends: 274974 [2024-11-06 20:10:05,320 INFO L226 Difference]: Without dead ends: 149212 [2024-11-06 20:10:05,365 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:10:05,365 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 786 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:10:05,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 173 Invalid, 2910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 20:10:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149212 states. [2024-11-06 20:10:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149212 to 147450. [2024-11-06 20:10:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147450 states, 147449 states have (on average 1.0971047616463998) internal successors, (161767), 147449 states have internal predecessors, (161767), 0 states have call successors, (0), 0 states 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:10:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147450 states to 147450 states and 161767 transitions. [2024-11-06 20:10:07,213 INFO L78 Accepts]: Start accepts. Automaton has 147450 states and 161767 transitions. Word has length 539 [2024-11-06 20:10:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:10:07,213 INFO L471 AbstractCegarLoop]: Abstraction has 147450 states and 161767 transitions. [2024-11-06 20:10:07,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states 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:10:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 147450 states and 161767 transitions. [2024-11-06 20:10:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2024-11-06 20:10:07,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:10:07,231 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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] [2024-11-06 20:10:07,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 20:10:07,232 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:10:07,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:10:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1633858475, now seen corresponding path program 1 times [2024-11-06 20:10:07,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:10:07,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531311686] [2024-11-06 20:10:07,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:10:07,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:10:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:10:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 386 proven. 13 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-11-06 20:10:08,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:10:08,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531311686] [2024-11-06 20:10:08,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531311686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:10:08,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679460797] [2024-11-06 20:10:08,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:10:08,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:10:08,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:10:08,328 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:10:08,329 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:10:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:10:08,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 20:10:08,496 INFO L278 TraceCheckSpWp]: Computing forward predicates...