./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem17_label02.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', 'adb370abe9a266817aee227dfaf2ff5e2cfdcfe49f97cfc66a125d7a6f5fbb19'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label02.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 adb370abe9a266817aee227dfaf2ff5e2cfdcfe49f97cfc66a125d7a6f5fbb19 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:04:03,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:04:03,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 20:04:03,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:04:03,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:04:03,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:04:03,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:04:03,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:04:03,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:04:03,845 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:04:03,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:04:03,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:04:03,846 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:04:03,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:04:03,846 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:04:03,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:04:03,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:04:03,846 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:04:03,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:04:03,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:04:03,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:04:03,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:04:03,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:04:03,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:04:03,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:04:03,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:04:03,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:04:03,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:04:03,848 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 -> adb370abe9a266817aee227dfaf2ff5e2cfdcfe49f97cfc66a125d7a6f5fbb19 [2024-11-06 20:04:04,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:04:04,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:04:04,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:04:04,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:04:04,137 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:04:04,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label02.c [2024-11-06 20:04:05,424 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:04:05,905 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:04:05,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label02.c [2024-11-06 20:04:05,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e18bdaa7/9869a975efc949738a1ffab0be08dbd0/FLAG85a1afa23 [2024-11-06 20:04:05,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e18bdaa7/9869a975efc949738a1ffab0be08dbd0 [2024-11-06 20:04:05,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:04:05,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:04:05,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:04:05,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:04:05,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:04:05,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:04:05" (1/1) ... [2024-11-06 20:04:05,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7587569b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:05, skipping insertion in model container [2024-11-06 20:04:05,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:04:05" (1/1) ... [2024-11-06 20:04:06,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:04:06,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label02.c[7859,7872] [2024-11-06 20:04:06,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:04:06,753 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:04:06,779 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label02.c[7859,7872] [2024-11-06 20:04:07,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:04:07,026 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:04:07,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07 WrapperNode [2024-11-06 20:04:07,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:04:07,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:04:07,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:04:07,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:04:07,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,418 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-11-06 20:04:07,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:04:07,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:04:07,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:04:07,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:04:07,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,730 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 20:04:07,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:04:07,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:04:07,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:04:07,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:04:07,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (1/1) ... [2024-11-06 20:04:07,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:04:08,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:04:08,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 20:04:08,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 20:04:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:04:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:04:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:04:08,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:04:08,152 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:04:08,153 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:04:11,413 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-11-06 20:04:11,414 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:04:11,436 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:04:11,436 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:04:11,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:04:11 BoogieIcfgContainer [2024-11-06 20:04:11,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:04:11,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:04:11,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:04:11,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:04:11,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:04:05" (1/3) ... [2024-11-06 20:04:11,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308a28cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:04:11, skipping insertion in model container [2024-11-06 20:04:11,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:04:07" (2/3) ... [2024-11-06 20:04:11,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@308a28cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:04:11, skipping insertion in model container [2024-11-06 20:04:11,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:04:11" (3/3) ... [2024-11-06 20:04:11,451 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label02.c [2024-11-06 20:04:11,466 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:04:11,466 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:04:11,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:04:11,611 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;@377313e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:04:11,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:04:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-06 20:04:11,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:11,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:11,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:11,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2024-11-06 20:04:11,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:11,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064469142] [2024-11-06 20:04:11,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:11,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:12,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:12,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064469142] [2024-11-06 20:04:12,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064469142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:12,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:12,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:04:12,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282027394] [2024-11-06 20:04:12,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:12,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:12,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:12,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:12,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:12,133 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:14,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:14,476 INFO L93 Difference]: Finished difference Result 1644 states and 3029 transitions. [2024-11-06 20:04:14,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:14,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-06 20:04:14,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:14,491 INFO L225 Difference]: With dead ends: 1644 [2024-11-06 20:04:14,491 INFO L226 Difference]: Without dead ends: 977 [2024-11-06 20:04:14,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:14,500 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 435 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:14,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 20:04:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-06 20:04:14,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2024-11-06 20:04:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2024-11-06 20:04:14,574 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 53 [2024-11-06 20:04:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:14,575 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2024-11-06 20:04:14,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2024-11-06 20:04:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-06 20:04:14,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:14,578 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, 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] [2024-11-06 20:04:14,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:04:14,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:14,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash -10640398, now seen corresponding path program 1 times [2024-11-06 20:04:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:14,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574557113] [2024-11-06 20:04:14,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:14,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:14,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574557113] [2024-11-06 20:04:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574557113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:14,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:14,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:04:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437782114] [2024-11-06 20:04:14,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:14,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:14,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:14,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:14,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:14,875 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:16,965 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2024-11-06 20:04:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:16,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-11-06 20:04:16,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:16,973 INFO L225 Difference]: With dead ends: 2813 [2024-11-06 20:04:16,974 INFO L226 Difference]: Without dead ends: 1844 [2024-11-06 20:04:16,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:16,978 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:16,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 579 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 20:04:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2024-11-06 20:04:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2024-11-06 20:04:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2024-11-06 20:04:17,036 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 120 [2024-11-06 20:04:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:17,038 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2024-11-06 20:04:17,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2024-11-06 20:04:17,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-06 20:04:17,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:17,044 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, 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] [2024-11-06 20:04:17,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:04:17,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:17,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash -703297284, now seen corresponding path program 1 times [2024-11-06 20:04:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392889302] [2024-11-06 20:04:17,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:17,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:17,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392889302] [2024-11-06 20:04:17,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392889302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:17,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:17,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:17,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503578563] [2024-11-06 20:04:17,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:17,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:04:17,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:17,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:04:17,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:04:17,524 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:21,135 INFO L93 Difference]: Finished difference Result 6765 states and 9258 transitions. [2024-11-06 20:04:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:04:21,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-11-06 20:04:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:21,156 INFO L225 Difference]: With dead ends: 6765 [2024-11-06 20:04:21,157 INFO L226 Difference]: Without dead ends: 4926 [2024-11-06 20:04:21,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:04:21,162 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 859 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:21,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 329 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-06 20:04:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2024-11-06 20:04:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 4875. [2024-11-06 20:04:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.286417726713172) internal successors, (6270), 4874 states have internal predecessors, (6270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6270 transitions. [2024-11-06 20:04:21,265 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6270 transitions. Word has length 123 [2024-11-06 20:04:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:21,267 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6270 transitions. [2024-11-06 20:04:21,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6270 transitions. [2024-11-06 20:04:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-06 20:04:21,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:21,271 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:21,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:04:21,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:21,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1839715273, now seen corresponding path program 1 times [2024-11-06 20:04:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9325594] [2024-11-06 20:04:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-06 20:04:21,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:21,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9325594] [2024-11-06 20:04:21,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9325594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:21,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:21,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:04:21,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568026217] [2024-11-06 20:04:21,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:21,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:21,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:21,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:21,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:21,542 INFO L87 Difference]: Start difference. First operand 4875 states and 6270 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:23,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:23,238 INFO L93 Difference]: Finished difference Result 14436 states and 18541 transitions. [2024-11-06 20:04:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:23,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 194 [2024-11-06 20:04:23,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:23,265 INFO L225 Difference]: With dead ends: 14436 [2024-11-06 20:04:23,266 INFO L226 Difference]: Without dead ends: 8277 [2024-11-06 20:04:23,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:23,274 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:23,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:04:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2024-11-06 20:04:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6147. [2024-11-06 20:04:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6147 states, 6146 states have (on average 1.1906931337455255) internal successors, (7318), 6146 states have internal predecessors, (7318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 7318 transitions. [2024-11-06 20:04:23,396 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 7318 transitions. Word has length 194 [2024-11-06 20:04:23,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:23,396 INFO L471 AbstractCegarLoop]: Abstraction has 6147 states and 7318 transitions. [2024-11-06 20:04:23,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 7318 transitions. [2024-11-06 20:04:23,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-06 20:04:23,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:23,400 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:23,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 20:04:23,400 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:23,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:23,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1977125269, now seen corresponding path program 1 times [2024-11-06 20:04:23,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:23,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688530338] [2024-11-06 20:04:23,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:23,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 20:04:23,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688530338] [2024-11-06 20:04:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688530338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:23,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:23,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:23,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228595316] [2024-11-06 20:04:23,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:23,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:23,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:23,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:23,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:23,577 INFO L87 Difference]: Start difference. First operand 6147 states and 7318 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:25,738 INFO L93 Difference]: Finished difference Result 15692 states and 18897 transitions. [2024-11-06 20:04:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:25,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2024-11-06 20:04:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:25,762 INFO L225 Difference]: With dead ends: 15692 [2024-11-06 20:04:25,763 INFO L226 Difference]: Without dead ends: 9547 [2024-11-06 20:04:25,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:25,771 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 407 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:25,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 477 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 20:04:25,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9547 states. [2024-11-06 20:04:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 6124. [2024-11-06 20:04:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6124 states, 6123 states have (on average 1.1894496162012085) internal successors, (7283), 6123 states have internal predecessors, (7283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 7283 transitions. [2024-11-06 20:04:25,889 INFO L78 Accepts]: Start accepts. Automaton has 6124 states and 7283 transitions. Word has length 207 [2024-11-06 20:04:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:25,890 INFO L471 AbstractCegarLoop]: Abstraction has 6124 states and 7283 transitions. [2024-11-06 20:04:25,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 6124 states and 7283 transitions. [2024-11-06 20:04:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-06 20:04:25,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:25,897 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:25,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:04:25,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:25,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:25,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1027746944, now seen corresponding path program 1 times [2024-11-06 20:04:25,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:25,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181867257] [2024-11-06 20:04:25,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:25,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:04:26,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:26,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181867257] [2024-11-06 20:04:26,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181867257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:26,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:26,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:26,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060125228] [2024-11-06 20:04:26,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:26,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:26,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:26,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:26,118 INFO L87 Difference]: Start difference. First operand 6124 states and 7283 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:27,721 INFO L93 Difference]: Finished difference Result 16078 states and 19444 transitions. [2024-11-06 20:04:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:27,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2024-11-06 20:04:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:27,746 INFO L225 Difference]: With dead ends: 16078 [2024-11-06 20:04:27,746 INFO L226 Difference]: Without dead ends: 9956 [2024-11-06 20:04:27,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:27,754 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 487 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:27,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 788 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:04:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2024-11-06 20:04:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 9956. [2024-11-06 20:04:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9956 states, 9955 states have (on average 1.171672526368659) internal successors, (11664), 9955 states have internal predecessors, (11664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9956 states to 9956 states and 11664 transitions. [2024-11-06 20:04:27,905 INFO L78 Accepts]: Start accepts. Automaton has 9956 states and 11664 transitions. Word has length 214 [2024-11-06 20:04:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:27,906 INFO L471 AbstractCegarLoop]: Abstraction has 9956 states and 11664 transitions. [2024-11-06 20:04:27,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 9956 states and 11664 transitions. [2024-11-06 20:04:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-06 20:04:27,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:27,910 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:27,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:04:27,910 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:27,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash 173331966, now seen corresponding path program 1 times [2024-11-06 20:04:27,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:27,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503430585] [2024-11-06 20:04:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 240 proven. 70 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-06 20:04:28,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:28,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503430585] [2024-11-06 20:04:28,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503430585] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:04:28,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957029141] [2024-11-06 20:04:28,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:28,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:04:28,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:04:28,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 20:04:28,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 20:04:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:28,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 20:04:28,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:04:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 240 proven. 70 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-06 20:04:28,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:04:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-06 20:04:29,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957029141] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 20:04:29,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 20:04:29,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-11-06 20:04:29,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11164892] [2024-11-06 20:04:29,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:29,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:04:29,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:29,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:04:29,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:04:29,183 INFO L87 Difference]: Start difference. First operand 9956 states and 11664 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:32,053 INFO L93 Difference]: Finished difference Result 30575 states and 36167 transitions. [2024-11-06 20:04:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:04:32,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 277 [2024-11-06 20:04:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:32,090 INFO L225 Difference]: With dead ends: 30575 [2024-11-06 20:04:32,090 INFO L226 Difference]: Without dead ends: 19763 [2024-11-06 20:04:32,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:04:32,101 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 889 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:32,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 162 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 20:04:32,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19763 states. [2024-11-06 20:04:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 19760. [2024-11-06 20:04:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19760 states, 19759 states have (on average 1.1599777316665822) internal successors, (22920), 19759 states have internal predecessors, (22920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:32,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19760 states to 19760 states and 22920 transitions. [2024-11-06 20:04:32,359 INFO L78 Accepts]: Start accepts. Automaton has 19760 states and 22920 transitions. Word has length 277 [2024-11-06 20:04:32,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:32,359 INFO L471 AbstractCegarLoop]: Abstraction has 19760 states and 22920 transitions. [2024-11-06 20:04:32,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:32,360 INFO L276 IsEmpty]: Start isEmpty. Operand 19760 states and 22920 transitions. [2024-11-06 20:04:32,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-06 20:04:32,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:32,366 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:32,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 20:04:32,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:04:32,568 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:32,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1525566454, now seen corresponding path program 1 times [2024-11-06 20:04:32,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:32,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154023684] [2024-11-06 20:04:32,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:32,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-06 20:04:32,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:32,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154023684] [2024-11-06 20:04:32,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154023684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:32,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:32,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:32,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067680236] [2024-11-06 20:04:32,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:32,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:32,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:32,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:32,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:32,969 INFO L87 Difference]: Start difference. First operand 19760 states and 22920 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:34,623 INFO L93 Difference]: Finished difference Result 42909 states and 49989 transitions. [2024-11-06 20:04:34,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:34,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2024-11-06 20:04:34,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:34,679 INFO L225 Difference]: With dead ends: 42909 [2024-11-06 20:04:34,680 INFO L226 Difference]: Without dead ends: 23151 [2024-11-06 20:04:34,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:34,700 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 374 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:34,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 896 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:04:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23151 states. [2024-11-06 20:04:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23151 to 22725. [2024-11-06 20:04:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22725 states, 22724 states have (on average 1.1456169688435134) internal successors, (26033), 22724 states have internal predecessors, (26033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 26033 transitions. [2024-11-06 20:04:35,035 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 26033 transitions. Word has length 290 [2024-11-06 20:04:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:35,036 INFO L471 AbstractCegarLoop]: Abstraction has 22725 states and 26033 transitions. [2024-11-06 20:04:35,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 26033 transitions. [2024-11-06 20:04:35,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-06 20:04:35,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:35,043 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:35,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 20:04:35,043 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:35,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash -162552321, now seen corresponding path program 1 times [2024-11-06 20:04:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:35,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742591110] [2024-11-06 20:04:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:35,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:04:35,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:35,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742591110] [2024-11-06 20:04:35,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742591110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:35,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:35,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:04:35,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593766665] [2024-11-06 20:04:35,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:35,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:04:35,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:35,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:04:35,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:04:35,719 INFO L87 Difference]: Start difference. First operand 22725 states and 26033 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:38,776 INFO L93 Difference]: Finished difference Result 64237 states and 73654 transitions. [2024-11-06 20:04:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:04:38,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 313 [2024-11-06 20:04:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:38,820 INFO L225 Difference]: With dead ends: 64237 [2024-11-06 20:04:38,820 INFO L226 Difference]: Without dead ends: 38101 [2024-11-06 20:04:38,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:04:38,840 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 854 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 2908 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 3377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 2908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:38,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 371 Invalid, 3377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 2908 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 20:04:38,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38101 states. [2024-11-06 20:04:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38101 to 37204. [2024-11-06 20:04:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37204 states, 37203 states have (on average 1.137462032631777) internal successors, (42317), 37203 states have internal predecessors, (42317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 42317 transitions. [2024-11-06 20:04:39,432 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 42317 transitions. Word has length 313 [2024-11-06 20:04:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:39,433 INFO L471 AbstractCegarLoop]: Abstraction has 37204 states and 42317 transitions. [2024-11-06 20:04:39,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 42317 transitions. [2024-11-06 20:04:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-06 20:04:39,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:39,448 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:39,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 20:04:39,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:39,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash -769673228, now seen corresponding path program 1 times [2024-11-06 20:04:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:39,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799130796] [2024-11-06 20:04:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-06 20:04:40,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:40,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799130796] [2024-11-06 20:04:40,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799130796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:40,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:40,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:40,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758225106] [2024-11-06 20:04:40,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:40,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:40,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:40,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:40,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:40,023 INFO L87 Difference]: Start difference. First operand 37204 states and 42317 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:41,906 INFO L93 Difference]: Finished difference Result 90182 states and 102746 transitions. [2024-11-06 20:04:41,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:41,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 328 [2024-11-06 20:04:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:41,970 INFO L225 Difference]: With dead ends: 90182 [2024-11-06 20:04:41,970 INFO L226 Difference]: Without dead ends: 51278 [2024-11-06 20:04:41,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:41,999 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 363 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:41,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 824 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 20:04:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51278 states. [2024-11-06 20:04:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51278 to 49991. [2024-11-06 20:04:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49991 states, 49990 states have (on average 1.1124624924984996) internal successors, (55612), 49990 states have internal predecessors, (55612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49991 states to 49991 states and 55612 transitions. [2024-11-06 20:04:42,754 INFO L78 Accepts]: Start accepts. Automaton has 49991 states and 55612 transitions. Word has length 328 [2024-11-06 20:04:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:42,755 INFO L471 AbstractCegarLoop]: Abstraction has 49991 states and 55612 transitions. [2024-11-06 20:04:42,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 49991 states and 55612 transitions. [2024-11-06 20:04:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-06 20:04:42,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:42,768 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, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:42,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 20:04:42,768 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:42,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1314932159, now seen corresponding path program 1 times [2024-11-06 20:04:42,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:42,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920519261] [2024-11-06 20:04:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 361 proven. 214 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-06 20:04:43,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:43,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920519261] [2024-11-06 20:04:43,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920519261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:04:43,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419021411] [2024-11-06 20:04:43,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:43,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:04:43,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:04:43,533 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 20:04:43,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 20:04:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:43,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 20:04:43,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:04:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 381 proven. 73 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-06 20:04:43,881 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:04:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-06 20:04:44,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419021411] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 20:04:44,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 20:04:44,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2024-11-06 20:04:44,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015588393] [2024-11-06 20:04:44,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:44,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:04:44,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:44,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:04:44,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-06 20:04:44,162 INFO L87 Difference]: Start difference. First operand 49991 states and 55612 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:47,042 INFO L93 Difference]: Finished difference Result 118728 states and 132318 transitions. [2024-11-06 20:04:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:04:47,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 351 [2024-11-06 20:04:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:47,118 INFO L225 Difference]: With dead ends: 118728 [2024-11-06 20:04:47,118 INFO L226 Difference]: Without dead ends: 68739 [2024-11-06 20:04:47,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-06 20:04:47,155 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 860 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:47,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 199 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 20:04:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68739 states. [2024-11-06 20:04:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68739 to 64908. [2024-11-06 20:04:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64908 states, 64907 states have (on average 1.1170597932426394) internal successors, (72505), 64907 states have internal predecessors, (72505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64908 states to 64908 states and 72505 transitions. [2024-11-06 20:04:48,021 INFO L78 Accepts]: Start accepts. Automaton has 64908 states and 72505 transitions. Word has length 351 [2024-11-06 20:04:48,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:48,021 INFO L471 AbstractCegarLoop]: Abstraction has 64908 states and 72505 transitions. [2024-11-06 20:04:48,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:48,021 INFO L276 IsEmpty]: Start isEmpty. Operand 64908 states and 72505 transitions. [2024-11-06 20:04:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-06 20:04:48,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:48,029 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, 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, 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 20:04:48,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 20:04:48,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:04:48,230 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:48,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:48,230 INFO L85 PathProgramCache]: Analyzing trace with hash -444093731, now seen corresponding path program 1 times [2024-11-06 20:04:48,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:48,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335178086] [2024-11-06 20:04:48,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:48,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-06 20:04:48,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335178086] [2024-11-06 20:04:48,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335178086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:48,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:48,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:48,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499648944] [2024-11-06 20:04:48,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:48,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:48,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:48,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:48,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:48,565 INFO L87 Difference]: Start difference. First operand 64908 states and 72505 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:50,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:50,426 INFO L93 Difference]: Finished difference Result 142175 states and 159014 transitions. [2024-11-06 20:04:50,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:50,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 365 [2024-11-06 20:04:50,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:50,515 INFO L225 Difference]: With dead ends: 142175 [2024-11-06 20:04:50,515 INFO L226 Difference]: Without dead ends: 76831 [2024-11-06 20:04:50,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:50,557 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 470 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:50,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 301 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:04:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76831 states. [2024-11-06 20:04:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76831 to 73417. [2024-11-06 20:04:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73417 states, 73416 states have (on average 1.1121009044350005) internal successors, (81646), 73416 states have internal predecessors, (81646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73417 states to 73417 states and 81646 transitions. [2024-11-06 20:04:51,662 INFO L78 Accepts]: Start accepts. Automaton has 73417 states and 81646 transitions. Word has length 365 [2024-11-06 20:04:51,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:51,663 INFO L471 AbstractCegarLoop]: Abstraction has 73417 states and 81646 transitions. [2024-11-06 20:04:51,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 73417 states and 81646 transitions. [2024-11-06 20:04:51,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-11-06 20:04:51,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:51,670 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, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:51,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 20:04:51,670 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:51,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:51,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2004060531, now seen corresponding path program 1 times [2024-11-06 20:04:51,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:51,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216321423] [2024-11-06 20:04:51,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:51,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-11-06 20:04:52,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:52,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216321423] [2024-11-06 20:04:52,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216321423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:52,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:52,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:52,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263820998] [2024-11-06 20:04:52,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:52,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:52,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:52,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:52,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:52,112 INFO L87 Difference]: Start difference. First operand 73417 states and 81646 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:53,941 INFO L93 Difference]: Finished difference Result 162999 states and 181520 transitions. [2024-11-06 20:04:53,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:53,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 381 [2024-11-06 20:04:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:54,025 INFO L225 Difference]: With dead ends: 162999 [2024-11-06 20:04:54,026 INFO L226 Difference]: Without dead ends: 88307 [2024-11-06 20:04:54,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:54,069 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 388 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:54,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 819 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:04:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88307 states. [2024-11-06 20:04:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88307 to 72956. [2024-11-06 20:04:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72956 states, 72955 states have (on average 1.110931396066068) internal successors, (81048), 72955 states have internal predecessors, (81048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:55,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72956 states to 72956 states and 81048 transitions. [2024-11-06 20:04:55,076 INFO L78 Accepts]: Start accepts. Automaton has 72956 states and 81048 transitions. Word has length 381 [2024-11-06 20:04:55,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:55,077 INFO L471 AbstractCegarLoop]: Abstraction has 72956 states and 81048 transitions. [2024-11-06 20:04:55,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 72956 states and 81048 transitions. [2024-11-06 20:04:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-11-06 20:04:55,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:55,085 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:04:55,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 20:04:55,085 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:55,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:55,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1666713624, now seen corresponding path program 1 times [2024-11-06 20:04:55,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:55,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325027169] [2024-11-06 20:04:55,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:55,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-06 20:04:55,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:55,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325027169] [2024-11-06 20:04:55,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325027169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:55,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:55,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:55,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205705977] [2024-11-06 20:04:55,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:55,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:55,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:55,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:55,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:55,466 INFO L87 Difference]: Start difference. First operand 72956 states and 81048 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:04:57,775 INFO L93 Difference]: Finished difference Result 166351 states and 185065 transitions. [2024-11-06 20:04:57,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:04:57,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 399 [2024-11-06 20:04:57,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:04:57,891 INFO L225 Difference]: With dead ends: 166351 [2024-11-06 20:04:57,892 INFO L226 Difference]: Without dead ends: 92967 [2024-11-06 20:04:57,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:57,940 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 409 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:04:57,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 362 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:04:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92967 states. [2024-11-06 20:04:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92967 to 88269. [2024-11-06 20:04:58,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88269 states, 88268 states have (on average 1.1048964517152309) internal successors, (97527), 88268 states have internal predecessors, (97527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88269 states to 88269 states and 97527 transitions. [2024-11-06 20:04:59,082 INFO L78 Accepts]: Start accepts. Automaton has 88269 states and 97527 transitions. Word has length 399 [2024-11-06 20:04:59,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:04:59,082 INFO L471 AbstractCegarLoop]: Abstraction has 88269 states and 97527 transitions. [2024-11-06 20:04:59,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:04:59,083 INFO L276 IsEmpty]: Start isEmpty. Operand 88269 states and 97527 transitions. [2024-11-06 20:04:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-11-06 20:04:59,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:04:59,087 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, 5, 5, 5, 5, 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, 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 20:04:59,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 20:04:59,087 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:04:59,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:04:59,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1497264050, now seen corresponding path program 1 times [2024-11-06 20:04:59,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:04:59,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362778864] [2024-11-06 20:04:59,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:04:59,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:04:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:04:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-11-06 20:04:59,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:04:59,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362778864] [2024-11-06 20:04:59,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362778864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:04:59,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:04:59,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:04:59,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817774447] [2024-11-06 20:04:59,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:04:59,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:04:59,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:04:59,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:04:59,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:04:59,243 INFO L87 Difference]: Start difference. First operand 88269 states and 97527 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:01,113 INFO L93 Difference]: Finished difference Result 185041 states and 203999 transitions. [2024-11-06 20:05:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 403 [2024-11-06 20:05:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:01,229 INFO L225 Difference]: With dead ends: 185041 [2024-11-06 20:05:01,229 INFO L226 Difference]: Without dead ends: 96773 [2024-11-06 20:05:01,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:01,286 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 388 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:01,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 315 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:05:01,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96773 states. [2024-11-06 20:05:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96773 to 91667. [2024-11-06 20:05:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91667 states, 91666 states have (on average 1.1008989156284772) internal successors, (100915), 91666 states have internal predecessors, (100915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91667 states to 91667 states and 100915 transitions. [2024-11-06 20:05:02,399 INFO L78 Accepts]: Start accepts. Automaton has 91667 states and 100915 transitions. Word has length 403 [2024-11-06 20:05:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:02,399 INFO L471 AbstractCegarLoop]: Abstraction has 91667 states and 100915 transitions. [2024-11-06 20:05:02,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 91667 states and 100915 transitions. [2024-11-06 20:05:02,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-11-06 20:05:02,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:02,405 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:05:02,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 20:05:02,405 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:02,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:02,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1444998463, now seen corresponding path program 1 times [2024-11-06 20:05:02,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:02,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547515534] [2024-11-06 20:05:02,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:02,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 367 proven. 51 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-06 20:05:03,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:03,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547515534] [2024-11-06 20:05:03,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547515534] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:05:03,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12462510] [2024-11-06 20:05:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:03,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:05:03,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:05:03,439 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 20:05:03,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 20:05:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:03,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 20:05:03,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:05:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 431 proven. 82 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-06 20:05:04,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:05:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 431 proven. 82 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-06 20:05:05,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12462510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 20:05:05,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 20:05:05,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-11-06 20:05:05,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969925821] [2024-11-06 20:05:05,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 20:05:05,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 20:05:05,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:05,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 20:05:05,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-06 20:05:05,081 INFO L87 Difference]: Start difference. First operand 91667 states and 100915 transitions. Second operand has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:13,299 INFO L93 Difference]: Finished difference Result 236565 states and 258883 transitions. [2024-11-06 20:05:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-06 20:05:13,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 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 433 [2024-11-06 20:05:13,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:13,483 INFO L225 Difference]: With dead ends: 236565 [2024-11-06 20:05:13,483 INFO L226 Difference]: Without dead ends: 138517 [2024-11-06 20:05:13,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 886 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2024-11-06 20:05:13,534 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 8551 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 7951 mSolverCounterSat, 2096 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8551 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 10047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2096 IncrementalHoareTripleChecker+Valid, 7951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:13,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8551 Valid, 294 Invalid, 10047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2096 Valid, 7951 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-06 20:05:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138517 states. [2024-11-06 20:05:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138517 to 115024. [2024-11-06 20:05:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115024 states, 115023 states have (on average 1.0750632482199212) internal successors, (123657), 115023 states have internal predecessors, (123657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115024 states to 115024 states and 123657 transitions. [2024-11-06 20:05:14,941 INFO L78 Accepts]: Start accepts. Automaton has 115024 states and 123657 transitions. Word has length 433 [2024-11-06 20:05:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:14,942 INFO L471 AbstractCegarLoop]: Abstraction has 115024 states and 123657 transitions. [2024-11-06 20:05:14,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 115024 states and 123657 transitions. [2024-11-06 20:05:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-11-06 20:05:14,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:14,952 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:05:14,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 20:05:15,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:05:15,153 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:15,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:15,153 INFO L85 PathProgramCache]: Analyzing trace with hash -273409696, now seen corresponding path program 1 times [2024-11-06 20:05:15,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:15,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862357923] [2024-11-06 20:05:15,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:15,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-11-06 20:05:15,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862357923] [2024-11-06 20:05:15,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862357923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:15,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:15,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:15,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514136850] [2024-11-06 20:05:15,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:15,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:15,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:15,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:15,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:15,357 INFO L87 Difference]: Start difference. First operand 115024 states and 123657 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:17,641 INFO L93 Difference]: Finished difference Result 233024 states and 250467 transitions. [2024-11-06 20:05:17,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:17,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 498 [2024-11-06 20:05:17,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:17,787 INFO L225 Difference]: With dead ends: 233024 [2024-11-06 20:05:17,787 INFO L226 Difference]: Without dead ends: 118002 [2024-11-06 20:05:17,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:17,830 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 366 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:17,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 325 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:05:17,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118002 states. [2024-11-06 20:05:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118002 to 107353. [2024-11-06 20:05:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107353 states, 107352 states have (on average 1.0743535285788808) internal successors, (115334), 107352 states have internal predecessors, (115334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107353 states to 107353 states and 115334 transitions. [2024-11-06 20:05:19,573 INFO L78 Accepts]: Start accepts. Automaton has 107353 states and 115334 transitions. Word has length 498 [2024-11-06 20:05:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:19,574 INFO L471 AbstractCegarLoop]: Abstraction has 107353 states and 115334 transitions. [2024-11-06 20:05:19,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:05:19,574 INFO L276 IsEmpty]: Start isEmpty. Operand 107353 states and 115334 transitions. [2024-11-06 20:05:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2024-11-06 20:05:19,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:19,583 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:05:19,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 20:05:19,583 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:19,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1456772986, now seen corresponding path program 1 times [2024-11-06 20:05:19,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:19,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477284177] [2024-11-06 20:05:19,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:19,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat