./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label01.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/Problem13_label01.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', '500fb51493d30e1b316117b24f5b2ae67d8f35b2c1172c5ed38f45dce818927e'] 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/Problem13_label01.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 500fb51493d30e1b316117b24f5b2ae67d8f35b2c1172c5ed38f45dce818927e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:45:48,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:45:48,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:45:48,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:45:48,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:45:48,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:45:48,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:45:48,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:45:48,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:45:48,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:45:48,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:45:48,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:45:48,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:45:48,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:45:48,816 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:45:48,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:45:48,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:45:48,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:45:48,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:45:48,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:45:48,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:45:48,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:45:48,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:45:48,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:45:48,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:45:48,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:45:48,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:45:48,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:45:48,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:45:48,817 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 -> 500fb51493d30e1b316117b24f5b2ae67d8f35b2c1172c5ed38f45dce818927e [2024-11-06 19:45:49,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:45:49,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:45:49,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:45:49,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:45:49,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:45:49,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label01.c [2024-11-06 19:45:50,143 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:45:50,581 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:45:50,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label01.c [2024-11-06 19:45:50,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8276b624/471fbe3b33664ce2b779627a40e0b40e/FLAG4931c99b8 [2024-11-06 19:45:50,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8276b624/471fbe3b33664ce2b779627a40e0b40e [2024-11-06 19:45:50,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:45:50,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:45:50,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:45:50,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:45:50,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:45:50,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:45:50" (1/1) ... [2024-11-06 19:45:50,732 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b9e176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:50, skipping insertion in model container [2024-11-06 19:45:50,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:45:50" (1/1) ... [2024-11-06 19:45:50,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:45:51,001 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/Problem13_label01.c[7003,7016] [2024-11-06 19:45:51,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:45:51,450 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:45:51,483 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/Problem13_label01.c[7003,7016] [2024-11-06 19:45:51,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:45:51,872 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:45:51,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51 WrapperNode [2024-11-06 19:45:51,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:45:51,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:45:51,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:45:51,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:45:51,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:51,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,384 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-06 19:45:52,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:45:52,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:45:52,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:45:52,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:45:52,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,705 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 19:45:52,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:45:52,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:45:52,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:45:52,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:45:52,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (1/1) ... [2024-11-06 19:45:52,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:45:52,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:45:53,007 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 19:45:53,018 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 19:45:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:45:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:45:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:45:53,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:45:53,085 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:45:53,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:45:57,482 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-06 19:45:57,482 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:45:57,512 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:45:57,512 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:45:57,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:45:57 BoogieIcfgContainer [2024-11-06 19:45:57,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:45:57,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:45:57,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:45:57,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:45:57,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:45:50" (1/3) ... [2024-11-06 19:45:57,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27966510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:45:57, skipping insertion in model container [2024-11-06 19:45:57,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:51" (2/3) ... [2024-11-06 19:45:57,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27966510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:45:57, skipping insertion in model container [2024-11-06 19:45:57,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:45:57" (3/3) ... [2024-11-06 19:45:57,520 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label01.c [2024-11-06 19:45:57,529 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:45:57,529 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:45:57,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:45:57,599 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;@43b54dcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:45:57,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:45:57,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states 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 19:45:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 19:45:57,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:57,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:57,613 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:57,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2024-11-06 19:45:57,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:57,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403335555] [2024-11-06 19:45:57,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:57,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:57,860 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 19:45:57,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:57,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403335555] [2024-11-06 19:45:57,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403335555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:57,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:57,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:45:57,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5360600] [2024-11-06 19:45:57,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:57,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:57,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:57,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:57,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:57,888 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 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 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 19:46:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:01,442 INFO L93 Difference]: Finished difference Result 3082 states and 5689 transitions. [2024-11-06 19:46:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:01,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-06 19:46:01,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:01,470 INFO L225 Difference]: With dead ends: 3082 [2024-11-06 19:46:01,470 INFO L226 Difference]: Without dead ends: 1899 [2024-11-06 19:46:01,477 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 19:46:01,479 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 990 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 3554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:01,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 641 Invalid, 3554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2955 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-06 19:46:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2024-11-06 19:46:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1894. [2024-11-06 19:46:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.7374537770734284) internal successors, (3289), 1893 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states 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 19:46:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 3289 transitions. [2024-11-06 19:46:01,607 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 3289 transitions. Word has length 49 [2024-11-06 19:46:01,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:01,608 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 3289 transitions. [2024-11-06 19:46:01,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states 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 19:46:01,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 3289 transitions. [2024-11-06 19:46:01,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-06 19:46:01,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:01,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:46:01,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:46:01,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:01,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:01,614 INFO L85 PathProgramCache]: Analyzing trace with hash -285580078, now seen corresponding path program 1 times [2024-11-06 19:46:01,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:01,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135776931] [2024-11-06 19:46:01,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:01,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:46:01,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:01,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135776931] [2024-11-06 19:46:01,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135776931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:01,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:01,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:46:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292841315] [2024-11-06 19:46:01,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:01,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:01,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:01,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:01,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:01,883 INFO L87 Difference]: Start difference. First operand 1894 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:46:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:05,772 INFO L93 Difference]: Finished difference Result 5384 states and 9441 transitions. [2024-11-06 19:46:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:05,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-11-06 19:46:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:05,782 INFO L225 Difference]: With dead ends: 5384 [2024-11-06 19:46:05,782 INFO L226 Difference]: Without dead ends: 3492 [2024-11-06 19:46:05,784 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 19:46:05,785 INFO L432 NwaCegarLoop]: 860 mSDtfsCounter, 922 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 879 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 3189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 879 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:05,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1013 Invalid, 3189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [879 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-06 19:46:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2024-11-06 19:46:05,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3491. [2024-11-06 19:46:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3491 states, 3490 states have (on average 1.5383954154727795) internal successors, (5369), 3490 states have internal predecessors, (5369), 0 states have call successors, (0), 0 states 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 19:46:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 5369 transitions. [2024-11-06 19:46:05,844 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 5369 transitions. Word has length 114 [2024-11-06 19:46:05,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:05,844 INFO L471 AbstractCegarLoop]: Abstraction has 3491 states and 5369 transitions. [2024-11-06 19:46:05,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:46:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 5369 transitions. [2024-11-06 19:46:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-06 19:46:05,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:05,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:46:05,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:46:05,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:05,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1860662409, now seen corresponding path program 1 times [2024-11-06 19:46:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:05,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665102843] [2024-11-06 19:46:05,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:46:05,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:05,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665102843] [2024-11-06 19:46:05,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665102843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:05,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:05,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:46:05,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178544953] [2024-11-06 19:46:05,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:05,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:05,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:05,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:05,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:05,990 INFO L87 Difference]: Start difference. First operand 3491 states and 5369 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:46:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:08,838 INFO L93 Difference]: Finished difference Result 10169 states and 15700 transitions. [2024-11-06 19:46:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:08,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2024-11-06 19:46:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:08,856 INFO L225 Difference]: With dead ends: 10169 [2024-11-06 19:46:08,856 INFO L226 Difference]: Without dead ends: 6680 [2024-11-06 19:46:08,859 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 19:46:08,863 INFO L432 NwaCegarLoop]: 714 mSDtfsCounter, 977 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:08,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 847 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 19:46:08,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2024-11-06 19:46:08,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 6669. [2024-11-06 19:46:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6669 states, 6668 states have (on average 1.375224955008998) internal successors, (9170), 6668 states have internal predecessors, (9170), 0 states have call successors, (0), 0 states 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 19:46:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6669 states to 6669 states and 9170 transitions. [2024-11-06 19:46:08,968 INFO L78 Accepts]: Start accepts. Automaton has 6669 states and 9170 transitions. Word has length 116 [2024-11-06 19:46:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:08,970 INFO L471 AbstractCegarLoop]: Abstraction has 6669 states and 9170 transitions. [2024-11-06 19:46:08,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:46:08,972 INFO L276 IsEmpty]: Start isEmpty. Operand 6669 states and 9170 transitions. [2024-11-06 19:46:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-06 19:46:08,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:08,978 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:46:08,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:46:08,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:08,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash 506522501, now seen corresponding path program 1 times [2024-11-06 19:46:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:08,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639431530] [2024-11-06 19:46:08,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:08,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:46:09,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:09,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639431530] [2024-11-06 19:46:09,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639431530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:09,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:09,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:46:09,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313756597] [2024-11-06 19:46:09,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:09,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:09,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:09,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:09,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:09,324 INFO L87 Difference]: Start difference. First operand 6669 states and 9170 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 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 19:46:11,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:11,837 INFO L93 Difference]: Finished difference Result 14123 states and 19185 transitions. [2024-11-06 19:46:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:11,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 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 160 [2024-11-06 19:46:11,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:11,852 INFO L225 Difference]: With dead ends: 14123 [2024-11-06 19:46:11,852 INFO L226 Difference]: Without dead ends: 7456 [2024-11-06 19:46:11,857 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 19:46:11,857 INFO L432 NwaCegarLoop]: 1086 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 2577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:11,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1215 Invalid, 2577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:46:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2024-11-06 19:46:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 7456. [2024-11-06 19:46:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7456 states, 7455 states have (on average 1.3362843729040912) internal successors, (9962), 7455 states have internal predecessors, (9962), 0 states have call successors, (0), 0 states 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 19:46:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 9962 transitions. [2024-11-06 19:46:11,938 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 9962 transitions. Word has length 160 [2024-11-06 19:46:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:11,939 INFO L471 AbstractCegarLoop]: Abstraction has 7456 states and 9962 transitions. [2024-11-06 19:46:11,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 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 19:46:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 9962 transitions. [2024-11-06 19:46:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-06 19:46:11,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:11,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:46:11,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:46:11,941 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:11,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1459044689, now seen corresponding path program 1 times [2024-11-06 19:46:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:11,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643460463] [2024-11-06 19:46:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:11,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:46:12,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:12,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643460463] [2024-11-06 19:46:12,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643460463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:12,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:12,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:12,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386990745] [2024-11-06 19:46:12,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:12,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:46:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:12,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:46:12,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:46:12,079 INFO L87 Difference]: Start difference. First operand 7456 states and 9962 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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 19:46:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:18,419 INFO L93 Difference]: Finished difference Result 26116 states and 35959 transitions. [2024-11-06 19:46:18,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:46:18,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2024-11-06 19:46:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:18,453 INFO L225 Difference]: With dead ends: 26116 [2024-11-06 19:46:18,456 INFO L226 Difference]: Without dead ends: 19449 [2024-11-06 19:46:18,462 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 19:46:18,463 INFO L432 NwaCegarLoop]: 899 mSDtfsCounter, 1640 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 6106 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 6756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 6106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:18,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 1071 Invalid, 6756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 6106 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-06 19:46:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19449 states. [2024-11-06 19:46:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19449 to 19303. [2024-11-06 19:46:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19303 states, 19302 states have (on average 1.2778468552481608) internal successors, (24665), 19302 states have internal predecessors, (24665), 0 states have call successors, (0), 0 states 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 19:46:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19303 states to 19303 states and 24665 transitions. [2024-11-06 19:46:18,651 INFO L78 Accepts]: Start accepts. Automaton has 19303 states and 24665 transitions. Word has length 174 [2024-11-06 19:46:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:18,651 INFO L471 AbstractCegarLoop]: Abstraction has 19303 states and 24665 transitions. [2024-11-06 19:46:18,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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 19:46:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 19303 states and 24665 transitions. [2024-11-06 19:46:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-06 19:46:18,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:18,656 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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 19:46:18,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:46:18,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:18,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1058846290, now seen corresponding path program 1 times [2024-11-06 19:46:18,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:18,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109767127] [2024-11-06 19:46:18,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:18,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-06 19:46:19,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:19,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109767127] [2024-11-06 19:46:19,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109767127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:19,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:46:19,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41123487] [2024-11-06 19:46:19,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:19,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:19,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:19,154 INFO L87 Difference]: Start difference. First operand 19303 states and 24665 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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 19:46:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:21,819 INFO L93 Difference]: Finished difference Result 33881 states and 44171 transitions. [2024-11-06 19:46:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:21,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 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 261 [2024-11-06 19:46:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:21,870 INFO L225 Difference]: With dead ends: 33881 [2024-11-06 19:46:21,870 INFO L226 Difference]: Without dead ends: 19312 [2024-11-06 19:46:21,881 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 19:46:21,885 INFO L432 NwaCegarLoop]: 1028 mSDtfsCounter, 728 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 2715 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:21,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1212 Invalid, 2719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2715 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:46:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19312 states. [2024-11-06 19:46:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19312 to 19303. [2024-11-06 19:46:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19303 states, 19302 states have (on average 1.2765516526784788) internal successors, (24640), 19302 states have internal predecessors, (24640), 0 states have call successors, (0), 0 states 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 19:46:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19303 states to 19303 states and 24640 transitions. [2024-11-06 19:46:22,168 INFO L78 Accepts]: Start accepts. Automaton has 19303 states and 24640 transitions. Word has length 261 [2024-11-06 19:46:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:22,169 INFO L471 AbstractCegarLoop]: Abstraction has 19303 states and 24640 transitions. [2024-11-06 19:46:22,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states 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 19:46:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 19303 states and 24640 transitions. [2024-11-06 19:46:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-06 19:46:22,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:22,175 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:22,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:46:22,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:22,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:22,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1215870024, now seen corresponding path program 1 times [2024-11-06 19:46:22,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:22,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559116951] [2024-11-06 19:46:22,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:22,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:22,297 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:46:22,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:22,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559116951] [2024-11-06 19:46:22,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559116951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:22,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:22,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:22,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828441039] [2024-11-06 19:46:22,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:22,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:22,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:22,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:22,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:22,300 INFO L87 Difference]: Start difference. First operand 19303 states and 24640 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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 19:46:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:25,298 INFO L93 Difference]: Finished difference Result 51975 states and 67214 transitions. [2024-11-06 19:46:25,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:25,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2024-11-06 19:46:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:25,340 INFO L225 Difference]: With dead ends: 51975 [2024-11-06 19:46:25,340 INFO L226 Difference]: Without dead ends: 32674 [2024-11-06 19:46:25,356 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 19:46:25,357 INFO L432 NwaCegarLoop]: 1854 mSDtfsCounter, 843 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:25,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1993 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 19:46:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32674 states. [2024-11-06 19:46:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32674 to 31881. [2024-11-06 19:46:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31881 states, 31880 states have (on average 1.224215809284818) internal successors, (39028), 31880 states have internal predecessors, (39028), 0 states have call successors, (0), 0 states 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 19:46:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31881 states to 31881 states and 39028 transitions. [2024-11-06 19:46:25,840 INFO L78 Accepts]: Start accepts. Automaton has 31881 states and 39028 transitions. Word has length 263 [2024-11-06 19:46:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:25,840 INFO L471 AbstractCegarLoop]: Abstraction has 31881 states and 39028 transitions. [2024-11-06 19:46:25,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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 19:46:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 31881 states and 39028 transitions. [2024-11-06 19:46:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-06 19:46:25,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:25,843 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:46:25,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:46:25,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:25,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash -852280536, now seen corresponding path program 1 times [2024-11-06 19:46:25,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:25,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214570064] [2024-11-06 19:46:25,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:25,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-06 19:46:25,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:25,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214570064] [2024-11-06 19:46:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214570064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866533325] [2024-11-06 19:46:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:25,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:25,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:25,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:25,996 INFO L87 Difference]: Start difference. First operand 31881 states and 39028 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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 19:46:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:28,861 INFO L93 Difference]: Finished difference Result 88168 states and 109034 transitions. [2024-11-06 19:46:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:28,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 285 [2024-11-06 19:46:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:28,919 INFO L225 Difference]: With dead ends: 88168 [2024-11-06 19:46:28,919 INFO L226 Difference]: Without dead ends: 57076 [2024-11-06 19:46:28,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 19:46:28,937 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 885 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:28,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 900 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:46:28,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57076 states. [2024-11-06 19:46:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57076 to 55492. [2024-11-06 19:46:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55492 states, 55491 states have (on average 1.1844263033645095) internal successors, (65725), 55491 states have internal predecessors, (65725), 0 states have call successors, (0), 0 states 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 19:46:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55492 states to 55492 states and 65725 transitions. [2024-11-06 19:46:29,636 INFO L78 Accepts]: Start accepts. Automaton has 55492 states and 65725 transitions. Word has length 285 [2024-11-06 19:46:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:29,637 INFO L471 AbstractCegarLoop]: Abstraction has 55492 states and 65725 transitions. [2024-11-06 19:46:29,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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 19:46:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 55492 states and 65725 transitions. [2024-11-06 19:46:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-06 19:46:29,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:29,641 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:46:29,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:46:29,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:29,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash 336538634, now seen corresponding path program 1 times [2024-11-06 19:46:29,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:29,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623321258] [2024-11-06 19:46:29,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:29,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 93 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:46:30,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:30,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623321258] [2024-11-06 19:46:30,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623321258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:46:30,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472387468] [2024-11-06 19:46:30,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:30,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:46:30,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:46:30,677 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 19:46:30,678 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 19:46:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:30,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:46:30,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:46:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-06 19:46:30,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:46:30,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472387468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:30,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:46:30,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-06 19:46:30,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470857840] [2024-11-06 19:46:30,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:30,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:30,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:30,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:30,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:46:30,876 INFO L87 Difference]: Start difference. First operand 55492 states and 65725 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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 19:46:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:33,764 INFO L93 Difference]: Finished difference Result 108618 states and 128700 transitions. [2024-11-06 19:46:33,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:33,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 290 [2024-11-06 19:46:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:33,825 INFO L225 Difference]: With dead ends: 108618 [2024-11-06 19:46:33,825 INFO L226 Difference]: Without dead ends: 53915 [2024-11-06 19:46:33,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:46:33,857 INFO L432 NwaCegarLoop]: 1360 mSDtfsCounter, 1158 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:33,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1442 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2470 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:46:33,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53915 states. [2024-11-06 19:46:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53915 to 53914. [2024-11-06 19:46:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53914 states, 53913 states have (on average 1.1423218889692652) internal successors, (61586), 53913 states have internal predecessors, (61586), 0 states have call successors, (0), 0 states 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 19:46:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53914 states to 53914 states and 61586 transitions. [2024-11-06 19:46:34,408 INFO L78 Accepts]: Start accepts. Automaton has 53914 states and 61586 transitions. Word has length 290 [2024-11-06 19:46:34,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:34,408 INFO L471 AbstractCegarLoop]: Abstraction has 53914 states and 61586 transitions. [2024-11-06 19:46:34,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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 19:46:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 53914 states and 61586 transitions. [2024-11-06 19:46:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-11-06 19:46:34,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:34,412 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:34,427 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 19:46:34,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:46:34,614 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:34,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:34,614 INFO L85 PathProgramCache]: Analyzing trace with hash -481816083, now seen corresponding path program 1 times [2024-11-06 19:46:34,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:34,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626677507] [2024-11-06 19:46:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:34,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-06 19:46:34,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:34,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626677507] [2024-11-06 19:46:34,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626677507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:34,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:34,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:34,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226293018] [2024-11-06 19:46:34,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:34,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:34,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:34,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:34,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:34,800 INFO L87 Difference]: Start difference. First operand 53914 states and 61586 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states 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 19:46:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:37,812 INFO L93 Difference]: Finished difference Result 106243 states and 121493 transitions. [2024-11-06 19:46:37,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:37,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 340 [2024-11-06 19:46:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:37,935 INFO L225 Difference]: With dead ends: 106243 [2024-11-06 19:46:37,935 INFO L226 Difference]: Without dead ends: 53118 [2024-11-06 19:46:37,964 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 19:46:37,965 INFO L432 NwaCegarLoop]: 690 mSDtfsCounter, 1093 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:37,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 822 Invalid, 2921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:46:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53118 states. [2024-11-06 19:46:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53118 to 53117. [2024-11-06 19:46:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53117 states, 53116 states have (on average 1.1028127118005875) internal successors, (58577), 53116 states have internal predecessors, (58577), 0 states have call successors, (0), 0 states 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 19:46:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53117 states to 53117 states and 58577 transitions. [2024-11-06 19:46:38,627 INFO L78 Accepts]: Start accepts. Automaton has 53117 states and 58577 transitions. Word has length 340 [2024-11-06 19:46:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:38,627 INFO L471 AbstractCegarLoop]: Abstraction has 53117 states and 58577 transitions. [2024-11-06 19:46:38,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states 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 19:46:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 53117 states and 58577 transitions. [2024-11-06 19:46:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2024-11-06 19:46:38,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:38,634 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:46:38,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:46:38,634 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:38,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1478632373, now seen corresponding path program 1 times [2024-11-06 19:46:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:38,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910796432] [2024-11-06 19:46:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2024-11-06 19:46:38,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:38,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910796432] [2024-11-06 19:46:38,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910796432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:38,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:38,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:38,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612252702] [2024-11-06 19:46:38,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:38,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:38,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:38,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:38,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:38,837 INFO L87 Difference]: Start difference. First operand 53117 states and 58577 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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 19:46:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:41,957 INFO L93 Difference]: Finished difference Result 125926 states and 138380 transitions. [2024-11-06 19:46:41,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:41,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 378 [2024-11-06 19:46:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:42,209 INFO L225 Difference]: With dead ends: 125926 [2024-11-06 19:46:42,209 INFO L226 Difference]: Without dead ends: 73598 [2024-11-06 19:46:42,222 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 19:46:42,223 INFO L432 NwaCegarLoop]: 1267 mSDtfsCounter, 1059 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 3182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 713 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:42,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1317 Invalid, 3182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [713 Valid, 2469 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 19:46:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73598 states. [2024-11-06 19:46:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73598 to 72002. [2024-11-06 19:46:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72002 states, 72001 states have (on average 1.0851238177247537) internal successors, (78130), 72001 states have internal predecessors, (78130), 0 states have call successors, (0), 0 states 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 19:46:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72002 states to 72002 states and 78130 transitions. [2024-11-06 19:46:42,736 INFO L78 Accepts]: Start accepts. Automaton has 72002 states and 78130 transitions. Word has length 378 [2024-11-06 19:46:42,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:42,736 INFO L471 AbstractCegarLoop]: Abstraction has 72002 states and 78130 transitions. [2024-11-06 19:46:42,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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 19:46:42,736 INFO L276 IsEmpty]: Start isEmpty. Operand 72002 states and 78130 transitions. [2024-11-06 19:46:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2024-11-06 19:46:42,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:42,746 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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 19:46:42,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:46:42,747 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:42,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1911303454, now seen corresponding path program 1 times [2024-11-06 19:46:42,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:42,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648940135] [2024-11-06 19:46:42,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:46:43,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:43,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648940135] [2024-11-06 19:46:43,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648940135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:43,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:43,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:43,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858073290] [2024-11-06 19:46:43,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:43,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:43,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:43,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:43,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:43,098 INFO L87 Difference]: Start difference. First operand 72002 states and 78130 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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 19:46:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:46,160 INFO L93 Difference]: Finished difference Result 160543 states and 175216 transitions. [2024-11-06 19:46:46,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:46,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 480 [2024-11-06 19:46:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:46,247 INFO L225 Difference]: With dead ends: 160543 [2024-11-06 19:46:46,247 INFO L226 Difference]: Without dead ends: 88543 [2024-11-06 19:46:46,289 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 19:46:46,290 INFO L432 NwaCegarLoop]: 1829 mSDtfsCounter, 728 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 2580 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 3193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:46,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1977 Invalid, 3193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2580 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:46:46,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88543 states. [2024-11-06 19:46:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88543 to 86954. [2024-11-06 19:46:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86954 states, 86953 states have (on average 1.073384472071119) internal successors, (93334), 86953 states have internal predecessors, (93334), 0 states have call successors, (0), 0 states 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 19:46:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86954 states to 86954 states and 93334 transitions. [2024-11-06 19:46:47,081 INFO L78 Accepts]: Start accepts. Automaton has 86954 states and 93334 transitions. Word has length 480 [2024-11-06 19:46:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:47,082 INFO L471 AbstractCegarLoop]: Abstraction has 86954 states and 93334 transitions. [2024-11-06 19:46:47,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states 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 19:46:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 86954 states and 93334 transitions. [2024-11-06 19:46:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2024-11-06 19:46:47,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:47,093 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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 19:46:47,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:46:47,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:47,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:47,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1335862030, now seen corresponding path program 1 times [2024-11-06 19:46:47,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:47,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740854581] [2024-11-06 19:46:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:47,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2024-11-06 19:46:47,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:47,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740854581] [2024-11-06 19:46:47,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740854581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:47,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:47,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779444307] [2024-11-06 19:46:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:47,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:47,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:47,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:47,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:47,363 INFO L87 Difference]: Start difference. First operand 86954 states and 93334 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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 19:46:50,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:50,723 INFO L93 Difference]: Finished difference Result 191231 states and 206463 transitions. [2024-11-06 19:46:50,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:50,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 489 [2024-11-06 19:46:50,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:50,828 INFO L225 Difference]: With dead ends: 191231 [2024-11-06 19:46:50,828 INFO L226 Difference]: Without dead ends: 105066 [2024-11-06 19:46:50,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:50,877 INFO L432 NwaCegarLoop]: 664 mSDtfsCounter, 918 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2368 mSolverCounterSat, 932 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 3300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 932 IncrementalHoareTripleChecker+Valid, 2368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:50,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 744 Invalid, 3300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [932 Valid, 2368 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:46:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105066 states. [2024-11-06 19:46:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105066 to 104265. [2024-11-06 19:46:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104265 states, 104264 states have (on average 1.0756253356863348) internal successors, (112149), 104264 states have internal predecessors, (112149), 0 states have call successors, (0), 0 states 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 19:46:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104265 states to 104265 states and 112149 transitions. [2024-11-06 19:46:52,019 INFO L78 Accepts]: Start accepts. Automaton has 104265 states and 112149 transitions. Word has length 489 [2024-11-06 19:46:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:52,019 INFO L471 AbstractCegarLoop]: Abstraction has 104265 states and 112149 transitions. [2024-11-06 19:46:52,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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 19:46:52,020 INFO L276 IsEmpty]: Start isEmpty. Operand 104265 states and 112149 transitions. [2024-11-06 19:46:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2024-11-06 19:46:52,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:52,031 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:52,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:46:52,031 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:52,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:52,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1877826396, now seen corresponding path program 1 times [2024-11-06 19:46:52,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:52,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228747775] [2024-11-06 19:46:52,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:52,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-06 19:46:52,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:52,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228747775] [2024-11-06 19:46:52,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228747775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:52,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:52,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:52,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112571712] [2024-11-06 19:46:52,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:52,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:52,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:52,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:52,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:52,430 INFO L87 Difference]: Start difference. First operand 104265 states and 112149 transitions. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 19:46:55,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:46:55,212 INFO L93 Difference]: Finished difference Result 204561 states and 220949 transitions. [2024-11-06 19:46:55,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:46:55,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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 506 [2024-11-06 19:46:55,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:46:55,318 INFO L225 Difference]: With dead ends: 204561 [2024-11-06 19:46:55,318 INFO L226 Difference]: Without dead ends: 113683 [2024-11-06 19:46:55,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 19:46:55,348 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 1175 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 756 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 756 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:46:55,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 354 Invalid, 3011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [756 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:46:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113683 states. [2024-11-06 19:46:56,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113683 to 113683. [2024-11-06 19:46:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113683 states, 113682 states have (on average 1.0711986066395736) internal successors, (121776), 113682 states have internal predecessors, (121776), 0 states have call successors, (0), 0 states 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 19:46:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113683 states to 113683 states and 121776 transitions. [2024-11-06 19:46:56,438 INFO L78 Accepts]: Start accepts. Automaton has 113683 states and 121776 transitions. Word has length 506 [2024-11-06 19:46:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:46:56,439 INFO L471 AbstractCegarLoop]: Abstraction has 113683 states and 121776 transitions. [2024-11-06 19:46:56,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 19:46:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 113683 states and 121776 transitions. [2024-11-06 19:46:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2024-11-06 19:46:56,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:46:56,458 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:56,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:46:56,459 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:46:56,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:46:56,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1474042506, now seen corresponding path program 1 times [2024-11-06 19:46:56,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:46:56,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847661648] [2024-11-06 19:46:56,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:56,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 336 proven. 110 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-06 19:46:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847661648] [2024-11-06 19:46:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847661648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:46:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741634698] [2024-11-06 19:46:57,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:46:57,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:46:57,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:46:57,550 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 19:46:57,556 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 19:46:57,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:57,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:46:57,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:46:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-06 19:46:58,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:46:58,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741634698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:58,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:46:58,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-06 19:46:58,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62120919] [2024-11-06 19:46:58,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:58,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:58,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:58,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:58,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:46:58,484 INFO L87 Difference]: Start difference. First operand 113683 states and 121776 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 2 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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 19:47:01,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:01,415 INFO L93 Difference]: Finished difference Result 217136 states and 233075 transitions. [2024-11-06 19:47:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:01,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 2 states have internal predecessors, (382), 0 states have call successors, (0), 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 551 [2024-11-06 19:47:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:01,553 INFO L225 Difference]: With dead ends: 217136 [2024-11-06 19:47:01,554 INFO L226 Difference]: Without dead ends: 116053 [2024-11-06 19:47:01,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:47:01,627 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 546 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:01,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1087 Invalid, 2553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:47:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116053 states. [2024-11-06 19:47:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116053 to 114472. [2024-11-06 19:47:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114472 states, 114471 states have (on average 1.0652042875488115) internal successors, (121935), 114471 states have internal predecessors, (121935), 0 states have call successors, (0), 0 states 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 19:47:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114472 states to 114472 states and 121935 transitions. [2024-11-06 19:47:02,963 INFO L78 Accepts]: Start accepts. Automaton has 114472 states and 121935 transitions. Word has length 551 [2024-11-06 19:47:02,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:02,963 INFO L471 AbstractCegarLoop]: Abstraction has 114472 states and 121935 transitions. [2024-11-06 19:47:02,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 2 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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 19:47:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 114472 states and 121935 transitions. [2024-11-06 19:47:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2024-11-06 19:47:02,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:02,980 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:02,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 19:47:03,184 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,SelfDestructingSolverStorable14 [2024-11-06 19:47:03,184 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:03,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2061224453, now seen corresponding path program 1 times [2024-11-06 19:47:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175489517] [2024-11-06 19:47:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:47:03,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:03,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175489517] [2024-11-06 19:47:03,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175489517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:03,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:03,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:47:03,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959583393] [2024-11-06 19:47:03,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:03,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:03,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:03,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:03,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:03,617 INFO L87 Difference]: Start difference. First operand 114472 states and 121935 transitions. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 19:47:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:06,373 INFO L93 Difference]: Finished difference Result 228158 states and 243065 transitions. [2024-11-06 19:47:06,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:06,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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 560 [2024-11-06 19:47:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:06,493 INFO L225 Difference]: With dead ends: 228158 [2024-11-06 19:47:06,493 INFO L226 Difference]: Without dead ends: 114475 [2024-11-06 19:47:06,552 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 19:47:06,553 INFO L432 NwaCegarLoop]: 1636 mSDtfsCounter, 645 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:06,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1768 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:47:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114475 states. [2024-11-06 19:47:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114475 to 113681. [2024-11-06 19:47:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113681 states, 113680 states have (on average 1.0523311048557353) internal successors, (119629), 113680 states have internal predecessors, (119629), 0 states have call successors, (0), 0 states 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 19:47:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113681 states to 113681 states and 119629 transitions. [2024-11-06 19:47:07,905 INFO L78 Accepts]: Start accepts. Automaton has 113681 states and 119629 transitions. Word has length 560 [2024-11-06 19:47:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:07,906 INFO L471 AbstractCegarLoop]: Abstraction has 113681 states and 119629 transitions. [2024-11-06 19:47:07,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 19:47:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 113681 states and 119629 transitions. [2024-11-06 19:47:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2024-11-06 19:47:07,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:07,921 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:47:07,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 19:47:07,921 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:07,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1217855569, now seen corresponding path program 1 times [2024-11-06 19:47:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:07,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414517775] [2024-11-06 19:47:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-11-06 19:47:08,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:08,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414517775] [2024-11-06 19:47:08,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414517775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:08,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:08,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:47:08,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212001904] [2024-11-06 19:47:08,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:08,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:08,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:08,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:08,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:08,362 INFO L87 Difference]: Start difference. First operand 113681 states and 119629 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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 19:47:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:11,713 INFO L93 Difference]: Finished difference Result 250204 states and 263667 transitions. [2024-11-06 19:47:11,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:11,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 570 [2024-11-06 19:47:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:11,860 INFO L225 Difference]: With dead ends: 250204 [2024-11-06 19:47:11,861 INFO L226 Difference]: Without dead ends: 148336 [2024-11-06 19:47:11,910 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 19:47:11,911 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 944 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:11,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 582 Invalid, 3226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:47:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148336 states. [2024-11-06 19:47:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148336 to 125492. [2024-11-06 19:47:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125492 states, 125491 states have (on average 1.049397964794288) internal successors, (131690), 125491 states have internal predecessors, (131690), 0 states have call successors, (0), 0 states 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 19:47:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125492 states to 125492 states and 131690 transitions. [2024-11-06 19:47:13,305 INFO L78 Accepts]: Start accepts. Automaton has 125492 states and 131690 transitions. Word has length 570 [2024-11-06 19:47:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:13,305 INFO L471 AbstractCegarLoop]: Abstraction has 125492 states and 131690 transitions. [2024-11-06 19:47:13,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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 19:47:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 125492 states and 131690 transitions. [2024-11-06 19:47:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2024-11-06 19:47:13,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:13,321 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2024-11-06 19:47:13,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 19:47:13,321 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:13,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:13,322 INFO L85 PathProgramCache]: Analyzing trace with hash -403797630, now seen corresponding path program 1 times [2024-11-06 19:47:13,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:13,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172455605] [2024-11-06 19:47:13,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:13,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-06 19:47:13,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172455605] [2024-11-06 19:47:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172455605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:47:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584726840] [2024-11-06 19:47:13,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:13,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:13,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:13,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:13,821 INFO L87 Difference]: Start difference. First operand 125492 states and 131690 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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 19:47:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:16,762 INFO L93 Difference]: Finished difference Result 250987 states and 263387 transitions. [2024-11-06 19:47:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:16,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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 593 [2024-11-06 19:47:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:16,910 INFO L225 Difference]: With dead ends: 250987 [2024-11-06 19:47:16,911 INFO L226 Difference]: Without dead ends: 126284 [2024-11-06 19:47:16,979 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 19:47:16,980 INFO L432 NwaCegarLoop]: 1360 mSDtfsCounter, 921 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2399 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 2399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:16,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 1441 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 2399 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:47:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126284 states. [2024-11-06 19:47:18,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126284 to 125487. [2024-11-06 19:47:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125487 states, 125486 states have (on average 1.04378177645315) internal successors, (130980), 125486 states have internal predecessors, (130980), 0 states have call successors, (0), 0 states 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 19:47:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125487 states to 125487 states and 130980 transitions. [2024-11-06 19:47:18,496 INFO L78 Accepts]: Start accepts. Automaton has 125487 states and 130980 transitions. Word has length 593 [2024-11-06 19:47:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:18,496 INFO L471 AbstractCegarLoop]: Abstraction has 125487 states and 130980 transitions. [2024-11-06 19:47:18,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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 19:47:18,496 INFO L276 IsEmpty]: Start isEmpty. Operand 125487 states and 130980 transitions. [2024-11-06 19:47:18,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2024-11-06 19:47:18,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:18,508 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:47:18,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 19:47:18,508 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:18,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash 630976582, now seen corresponding path program 1 times [2024-11-06 19:47:18,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:18,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35492604] [2024-11-06 19:47:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:18,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 708 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2024-11-06 19:47:18,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:18,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35492604] [2024-11-06 19:47:18,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35492604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:18,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:18,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:47:18,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946050223] [2024-11-06 19:47:18,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:18,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:47:18,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:18,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:47:18,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:47:18,709 INFO L87 Difference]: Start difference. First operand 125487 states and 130980 transitions. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)