./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i -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 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:07:53,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:07:53,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:07:53,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:07:53,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:07:53,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:07:53,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:07:53,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:07:53,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:07:53,476 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:07:53,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:07:53,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:07:53,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:07:53,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:07:53,478 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:07:53,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:07:53,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:07:53,478 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:07:53,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:07:53,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:07:53,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:07:53,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:07:53,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:07:53,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:07:53,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:07:53,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:07:53,479 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:07:53,479 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:07:53,479 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:07:53,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:07:53,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:07:53,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:07:53,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:07:53,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:07:53,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:07:53,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:07:53,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:07:53,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:07:53,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:07:53,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:07:53,480 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:07:53,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:07:53,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:07:53,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:07:53,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:07:53,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:07:53,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:07:53,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:07:53,481 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 -> 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 [2025-01-09 16:07:53,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:07:53,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:07:53,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:07:53,755 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:07:53,755 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:07:53,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2025-01-09 16:07:55,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c70167d5/7bbb16e0993e442991688512d85b05c3/FLAG300494134 [2025-01-09 16:07:55,284 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:07:55,285 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2025-01-09 16:07:55,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c70167d5/7bbb16e0993e442991688512d85b05c3/FLAG300494134 [2025-01-09 16:07:55,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3c70167d5/7bbb16e0993e442991688512d85b05c3 [2025-01-09 16:07:55,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:07:55,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:07:55,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:07:55,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:07:55,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:07:55,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295181fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55, skipping insertion in model container [2025-01-09 16:07:55,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:07:55,733 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i[917,930] [2025-01-09 16:07:55,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:07:55,802 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:07:55,816 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i[917,930] [2025-01-09 16:07:55,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:07:55,879 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:07:55,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55 WrapperNode [2025-01-09 16:07:55,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:07:55,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:07:55,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:07:55,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:07:55,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,937 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2025-01-09 16:07:55,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:07:55,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:07:55,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:07:55,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:07:55,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,954 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:07:55,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:07:55,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:07:55,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:07:55,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:07:55,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (1/1) ... [2025-01-09 16:07:55,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:07:56,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:07:56,019 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) [2025-01-09 16:07:56,025 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 [2025-01-09 16:07:56,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:07:56,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:07:56,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:07:56,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:07:56,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:07:56,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:07:56,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:07:56,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:07:56,048 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:07:56,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:07:56,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:07:56,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:07:56,192 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:07:56,194 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:07:56,870 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2025-01-09 16:07:56,871 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:07:56,880 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:07:56,881 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:07:56,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:07:56 BoogieIcfgContainer [2025-01-09 16:07:56,881 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:07:56,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:07:56,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:07:56,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:07:56,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:07:55" (1/3) ... [2025-01-09 16:07:56,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2094627e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:07:56, skipping insertion in model container [2025-01-09 16:07:56,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:07:55" (2/3) ... [2025-01-09 16:07:56,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2094627e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:07:56, skipping insertion in model container [2025-01-09 16:07:56,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:07:56" (3/3) ... [2025-01-09 16:07:56,892 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-23.i [2025-01-09 16:07:56,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:07:56,908 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-23.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:07:56,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:07:56,967 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;@51b783a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:07:56,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:07:56,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 100 states have (on average 1.41) internal successors, (141), 101 states have internal predecessors, (141), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 16:07:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 16:07:56,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:56,986 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:56,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:56,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:56,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1332639086, now seen corresponding path program 1 times [2025-01-09 16:07:57,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:57,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482190335] [2025-01-09 16:07:57,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:57,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:57,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 16:07:57,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 16:07:57,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:57,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 16:07:57,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:57,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482190335] [2025-01-09 16:07:57,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482190335] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:07:57,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918673668] [2025-01-09 16:07:57,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:57,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:07:57,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:07:57,412 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) [2025-01-09 16:07:57,413 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 [2025-01-09 16:07:57,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 16:07:57,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 16:07:57,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:57,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:57,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:07:57,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:07:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 16:07:57,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:07:57,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918673668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:57,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:07:57,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:07:57,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997767165] [2025-01-09 16:07:57,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:57,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:07:57,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:57,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:07:57,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:07:57,825 INFO L87 Difference]: Start difference. First operand has 123 states, 100 states have (on average 1.41) internal successors, (141), 101 states have internal predecessors, (141), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 16:07:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:57,849 INFO L93 Difference]: Finished difference Result 240 states and 377 transitions. [2025-01-09 16:07:57,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:07:57,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2025-01-09 16:07:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:57,856 INFO L225 Difference]: With dead ends: 240 [2025-01-09 16:07:57,857 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 16:07:57,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:07:57,862 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:57,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:07:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 16:07:57,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 16:07:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 16:07:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-01-09 16:07:57,898 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 165 [2025-01-09 16:07:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:57,898 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-01-09 16:07:57,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 16:07:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-01-09 16:07:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 16:07:57,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:57,904 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:57,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:07:58,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 16:07:58,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:58,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1277936186, now seen corresponding path program 1 times [2025-01-09 16:07:58,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:58,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806034330] [2025-01-09 16:07:58,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:58,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 16:07:58,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 16:07:58,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:58,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:07:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:07:58,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:07:58,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806034330] [2025-01-09 16:07:58,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806034330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:07:58,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:07:58,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:07:58,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372772289] [2025-01-09 16:07:58,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:07:58,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:07:58,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:07:58,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:07:58,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:07:58,588 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 16:07:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:07:58,646 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2025-01-09 16:07:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:07:58,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 165 [2025-01-09 16:07:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:07:58,649 INFO L225 Difference]: With dead ends: 239 [2025-01-09 16:07:58,649 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 16:07:58,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:07:58,650 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:07:58,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:07:58,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 16:07:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 16:07:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.38) internal successors, (138), 100 states have internal predecessors, (138), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 16:07:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2025-01-09 16:07:58,677 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 165 [2025-01-09 16:07:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:07:58,678 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2025-01-09 16:07:58,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 16:07:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2025-01-09 16:07:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 16:07:58,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:07:58,681 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:07:58,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:07:58,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:07:58,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:07:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1398056196, now seen corresponding path program 1 times [2025-01-09 16:07:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:07:58,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750387954] [2025-01-09 16:07:58,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:07:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:07:58,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 16:07:59,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 16:07:59,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:07:59,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750387954] [2025-01-09 16:08:03,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750387954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:03,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:03,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:08:03,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066037401] [2025-01-09 16:08:03,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:03,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:08:03,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:03,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:08:03,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:08:03,740 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 16:08:05,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:05,276 INFO L93 Difference]: Finished difference Result 289 states and 423 transitions. [2025-01-09 16:08:05,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:08:05,277 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 165 [2025-01-09 16:08:05,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:05,279 INFO L225 Difference]: With dead ends: 289 [2025-01-09 16:08:05,279 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 16:08:05,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:08:05,281 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 409 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:05,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 644 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 16:08:05,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 16:08:05,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2025-01-09 16:08:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.4) internal successors, (161), 115 states have internal predecessors, (161), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 16:08:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2025-01-09 16:08:05,297 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 201 transitions. Word has length 165 [2025-01-09 16:08:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:05,298 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 201 transitions. [2025-01-09 16:08:05,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.230769230769231) internal successors, (68), 14 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 16:08:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2025-01-09 16:08:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 16:08:05,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:05,300 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:05,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:08:05,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:05,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1984862210, now seen corresponding path program 1 times [2025-01-09 16:08:05,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:05,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371024192] [2025-01-09 16:08:05,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:05,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:05,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 16:08:05,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 16:08:05,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:05,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:10,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:10,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371024192] [2025-01-09 16:08:10,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371024192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:10,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:10,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:08:10,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692396528] [2025-01-09 16:08:10,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:10,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:08:10,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:10,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:08:10,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:08:10,229 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. Second operand has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 16:08:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:11,686 INFO L93 Difference]: Finished difference Result 302 states and 442 transitions. [2025-01-09 16:08:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:08:11,687 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 165 [2025-01-09 16:08:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:11,690 INFO L225 Difference]: With dead ends: 302 [2025-01-09 16:08:11,690 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 16:08:11,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:08:11,692 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 447 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:11,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 658 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 16:08:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 16:08:11,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2025-01-09 16:08:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.391304347826087) internal successors, (160), 115 states have internal predecessors, (160), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 16:08:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-01-09 16:08:11,718 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 165 [2025-01-09 16:08:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:11,719 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-01-09 16:08:11,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 16:08:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-01-09 16:08:11,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 16:08:11,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:11,722 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:11,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:08:11,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:11,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1532069702, now seen corresponding path program 1 times [2025-01-09 16:08:11,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:11,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171340224] [2025-01-09 16:08:11,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:11,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:11,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 16:08:11,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 16:08:11,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:11,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:16,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:16,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171340224] [2025-01-09 16:08:16,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171340224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:16,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:08:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849164460] [2025-01-09 16:08:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:16,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:08:16,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:16,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:08:16,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:08:16,547 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 16:08:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:18,845 INFO L93 Difference]: Finished difference Result 315 states and 461 transitions. [2025-01-09 16:08:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:08:18,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) Word has length 165 [2025-01-09 16:08:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:18,849 INFO L225 Difference]: With dead ends: 315 [2025-01-09 16:08:18,849 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 16:08:18,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:08:18,851 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 344 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:18,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 782 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 16:08:18,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 16:08:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2025-01-09 16:08:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 16:08:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2025-01-09 16:08:18,866 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 165 [2025-01-09 16:08:18,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:18,866 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2025-01-09 16:08:18,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 16:08:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2025-01-09 16:08:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 16:08:18,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:18,869 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:18,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:08:18,869 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:18,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2118875716, now seen corresponding path program 1 times [2025-01-09 16:08:18,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:18,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342244799] [2025-01-09 16:08:18,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:18,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:18,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 16:08:18,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 16:08:18,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:18,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:21,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:21,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342244799] [2025-01-09 16:08:21,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342244799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:21,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:21,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:08:21,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025751961] [2025-01-09 16:08:21,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:21,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:08:21,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:21,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:08:21,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:08:21,747 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 16:08:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:22,798 INFO L93 Difference]: Finished difference Result 326 states and 477 transitions. [2025-01-09 16:08:22,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:08:22,800 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 165 [2025-01-09 16:08:22,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:22,802 INFO L225 Difference]: With dead ends: 326 [2025-01-09 16:08:22,802 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 16:08:22,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:08:22,803 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 325 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:22,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 868 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 16:08:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 16:08:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 148. [2025-01-09 16:08:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 126 states have internal predecessors, (177), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 16:08:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 217 transitions. [2025-01-09 16:08:22,818 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 217 transitions. Word has length 165 [2025-01-09 16:08:22,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:22,819 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 217 transitions. [2025-01-09 16:08:22,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 16:08:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 217 transitions. [2025-01-09 16:08:22,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 16:08:22,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:22,822 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:22,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:08:22,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:22,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash 188890753, now seen corresponding path program 1 times [2025-01-09 16:08:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:22,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382468741] [2025-01-09 16:08:22,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:22,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:22,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 16:08:23,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 16:08:23,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:23,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:27,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382468741] [2025-01-09 16:08:27,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382468741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:27,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:27,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 16:08:27,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993341677] [2025-01-09 16:08:27,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:27,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 16:08:27,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:27,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 16:08:27,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:08:27,505 INFO L87 Difference]: Start difference. First operand 148 states and 217 transitions. Second operand has 20 states, 18 states have (on average 3.888888888888889) internal successors, (70), 20 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 16:08:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:30,495 INFO L93 Difference]: Finished difference Result 426 states and 623 transitions. [2025-01-09 16:08:30,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:08:30,498 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.888888888888889) internal successors, (70), 20 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) Word has length 167 [2025-01-09 16:08:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:30,500 INFO L225 Difference]: With dead ends: 426 [2025-01-09 16:08:30,500 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 16:08:30,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 16:08:30,501 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 643 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 1630 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:30,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1142 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1630 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 16:08:30,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 16:08:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 161. [2025-01-09 16:08:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 139 states have (on average 1.4244604316546763) internal successors, (198), 139 states have internal predecessors, (198), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 16:08:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 238 transitions. [2025-01-09 16:08:30,524 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 238 transitions. Word has length 167 [2025-01-09 16:08:30,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:30,524 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 238 transitions. [2025-01-09 16:08:30,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.888888888888889) internal successors, (70), 20 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 16:08:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 238 transitions. [2025-01-09 16:08:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 16:08:30,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:30,526 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:30,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:08:30,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:30,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash -397915261, now seen corresponding path program 1 times [2025-01-09 16:08:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186130028] [2025-01-09 16:08:30,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:30,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 16:08:30,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 16:08:30,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:30,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:33,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:33,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186130028] [2025-01-09 16:08:33,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186130028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:33,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:33,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 16:08:33,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584680159] [2025-01-09 16:08:33,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:33,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:08:33,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:33,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:08:33,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:08:33,439 INFO L87 Difference]: Start difference. First operand 161 states and 238 transitions. Second operand has 15 states, 14 states have (on average 5.0) internal successors, (70), 15 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 16:08:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:34,904 INFO L93 Difference]: Finished difference Result 417 states and 610 transitions. [2025-01-09 16:08:34,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:08:34,905 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.0) internal successors, (70), 15 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 167 [2025-01-09 16:08:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:34,907 INFO L225 Difference]: With dead ends: 417 [2025-01-09 16:08:34,907 INFO L226 Difference]: Without dead ends: 259 [2025-01-09 16:08:34,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:08:34,908 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 653 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:34,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 736 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 16:08:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-09 16:08:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 212. [2025-01-09 16:08:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 187 states have (on average 1.4171122994652405) internal successors, (265), 188 states have internal predecessors, (265), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 16:08:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 309 transitions. [2025-01-09 16:08:34,931 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 309 transitions. Word has length 167 [2025-01-09 16:08:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:34,932 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 309 transitions. [2025-01-09 16:08:34,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.0) internal successors, (70), 15 states have internal predecessors, (70), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2025-01-09 16:08:34,932 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 309 transitions. [2025-01-09 16:08:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 16:08:34,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:34,933 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:34,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:08:34,934 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:34,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1616547581, now seen corresponding path program 1 times [2025-01-09 16:08:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:34,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366166377] [2025-01-09 16:08:34,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:34,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:34,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 16:08:35,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 16:08:35,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:35,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:37,036 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:37,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:37,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366166377] [2025-01-09 16:08:37,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366166377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:37,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:37,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:08:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453607665] [2025-01-09 16:08:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:08:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:37,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:08:37,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:08:37,037 INFO L87 Difference]: Start difference. First operand 212 states and 309 transitions. Second operand has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 11 states have internal predecessors, (70), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 16:08:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:37,966 INFO L93 Difference]: Finished difference Result 414 states and 602 transitions. [2025-01-09 16:08:37,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:08:37,967 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 11 states have internal predecessors, (70), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) Word has length 167 [2025-01-09 16:08:37,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:37,972 INFO L225 Difference]: With dead ends: 414 [2025-01-09 16:08:37,973 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 16:08:37,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:08:37,975 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 146 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:37,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 461 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:08:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 16:08:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-01-09 16:08:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 175 states have (on average 1.4) internal successors, (245), 176 states have internal predecessors, (245), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 16:08:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 289 transitions. [2025-01-09 16:08:38,008 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 289 transitions. Word has length 167 [2025-01-09 16:08:38,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:38,008 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 289 transitions. [2025-01-09 16:08:38,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.777777777777778) internal successors, (70), 11 states have internal predecessors, (70), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 16:08:38,008 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 289 transitions. [2025-01-09 16:08:38,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 16:08:38,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:38,011 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:38,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:08:38,011 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:38,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:38,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1776173650, now seen corresponding path program 1 times [2025-01-09 16:08:38,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:38,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171814981] [2025-01-09 16:08:38,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:38,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:38,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 16:08:38,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 16:08:38,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:38,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-09 16:08:38,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:38,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171814981] [2025-01-09 16:08:38,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171814981] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:08:38,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563205572] [2025-01-09 16:08:38,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:38,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:38,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:08:38,232 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) [2025-01-09 16:08:38,233 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 [2025-01-09 16:08:38,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 16:08:38,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 16:08:38,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:38,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:38,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:08:38,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:08:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:38,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:08:38,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563205572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:38,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:08:38,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 16:08:38,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16302722] [2025-01-09 16:08:38,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:38,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:08:38,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:38,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:08:38,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:08:38,567 INFO L87 Difference]: Start difference. First operand 200 states and 289 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 16:08:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:38,617 INFO L93 Difference]: Finished difference Result 403 states and 583 transitions. [2025-01-09 16:08:38,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:08:38,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 167 [2025-01-09 16:08:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:38,620 INFO L225 Difference]: With dead ends: 403 [2025-01-09 16:08:38,620 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 16:08:38,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:08:38,623 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:38,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 675 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:08:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 16:08:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-01-09 16:08:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 181 states have (on average 1.3867403314917126) internal successors, (251), 182 states have internal predecessors, (251), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 16:08:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 295 transitions. [2025-01-09 16:08:38,644 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 295 transitions. Word has length 167 [2025-01-09 16:08:38,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:38,644 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 295 transitions. [2025-01-09 16:08:38,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 16:08:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 295 transitions. [2025-01-09 16:08:38,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 16:08:38,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:38,647 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:38,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:08:38,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:08:38,848 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:38,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash 738587665, now seen corresponding path program 1 times [2025-01-09 16:08:38,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:38,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867822314] [2025-01-09 16:08:38,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:38,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 16:08:38,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 16:08:38,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:38,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:41,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:41,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867822314] [2025-01-09 16:08:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867822314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:41,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:41,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:08:41,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417384548] [2025-01-09 16:08:41,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:41,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:08:41,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:41,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:08:41,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:08:41,236 INFO L87 Difference]: Start difference. First operand 206 states and 295 transitions. Second operand has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 16:08:42,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:42,222 INFO L93 Difference]: Finished difference Result 490 states and 700 transitions. [2025-01-09 16:08:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:08:42,224 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2025-01-09 16:08:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:42,226 INFO L225 Difference]: With dead ends: 490 [2025-01-09 16:08:42,226 INFO L226 Difference]: Without dead ends: 287 [2025-01-09 16:08:42,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:08:42,227 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 452 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:42,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 649 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:08:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-01-09 16:08:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 217. [2025-01-09 16:08:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 192 states have (on average 1.4010416666666667) internal successors, (269), 193 states have internal predecessors, (269), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 16:08:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 313 transitions. [2025-01-09 16:08:42,255 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 313 transitions. Word has length 167 [2025-01-09 16:08:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:42,255 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 313 transitions. [2025-01-09 16:08:42,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 16:08:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 313 transitions. [2025-01-09 16:08:42,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 16:08:42,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:42,260 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:42,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:08:42,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:42,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash 151781651, now seen corresponding path program 1 times [2025-01-09 16:08:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:42,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549506433] [2025-01-09 16:08:42,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:42,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 16:08:42,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 16:08:42,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:42,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:45,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:45,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549506433] [2025-01-09 16:08:45,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549506433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:45,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:45,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:08:45,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558214404] [2025-01-09 16:08:45,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:45,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:08:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:45,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:08:45,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:08:45,398 INFO L87 Difference]: Start difference. First operand 217 states and 313 transitions. Second operand has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 16:08:46,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:46,776 INFO L93 Difference]: Finished difference Result 499 states and 714 transitions. [2025-01-09 16:08:46,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:08:46,778 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2025-01-09 16:08:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:46,780 INFO L225 Difference]: With dead ends: 499 [2025-01-09 16:08:46,780 INFO L226 Difference]: Without dead ends: 285 [2025-01-09 16:08:46,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:08:46,781 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 267 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:46,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 620 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 16:08:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-01-09 16:08:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 217. [2025-01-09 16:08:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 193 states have internal predecessors, (268), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 16:08:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 312 transitions. [2025-01-09 16:08:46,808 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 312 transitions. Word has length 167 [2025-01-09 16:08:46,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:46,810 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 312 transitions. [2025-01-09 16:08:46,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 16:08:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 312 transitions. [2025-01-09 16:08:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 16:08:46,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:46,811 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:46,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:08:46,811 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:46,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash 250930367, now seen corresponding path program 1 times [2025-01-09 16:08:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:46,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072532371] [2025-01-09 16:08:46,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:46,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 16:08:46,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 16:08:46,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:46,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:50,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:50,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072532371] [2025-01-09 16:08:50,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072532371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:50,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:50,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 16:08:50,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966101305] [2025-01-09 16:08:50,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:50,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:08:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:50,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:08:50,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:08:50,537 INFO L87 Difference]: Start difference. First operand 217 states and 312 transitions. Second operand has 15 states, 13 states have (on average 5.384615384615385) internal successors, (70), 15 states have internal predecessors, (70), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 16:08:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:51,947 INFO L93 Difference]: Finished difference Result 467 states and 669 transitions. [2025-01-09 16:08:51,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:08:51,947 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.384615384615385) internal successors, (70), 15 states have internal predecessors, (70), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) Word has length 167 [2025-01-09 16:08:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:51,949 INFO L225 Difference]: With dead ends: 467 [2025-01-09 16:08:51,949 INFO L226 Difference]: Without dead ends: 251 [2025-01-09 16:08:51,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:08:51,950 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 391 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:51,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 657 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 16:08:51,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-09 16:08:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 215. [2025-01-09 16:08:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 190 states have (on average 1.3789473684210527) internal successors, (262), 191 states have internal predecessors, (262), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 16:08:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 306 transitions. [2025-01-09 16:08:51,970 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 306 transitions. Word has length 167 [2025-01-09 16:08:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:51,971 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 306 transitions. [2025-01-09 16:08:51,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.384615384615385) internal successors, (70), 15 states have internal predecessors, (70), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 16:08:51,971 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 306 transitions. [2025-01-09 16:08:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 16:08:51,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:51,972 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:51,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:08:51,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:51,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:51,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2141313981, now seen corresponding path program 1 times [2025-01-09 16:08:51,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:51,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345318072] [2025-01-09 16:08:51,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:51,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:52,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 16:08:52,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 16:08:52,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:52,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:54,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:54,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345318072] [2025-01-09 16:08:54,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345318072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:54,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:54,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:08:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492874439] [2025-01-09 16:08:54,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:54,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:08:54,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:54,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:08:54,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:08:54,526 INFO L87 Difference]: Start difference. First operand 215 states and 306 transitions. Second operand has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 16:08:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:08:55,944 INFO L93 Difference]: Finished difference Result 463 states and 657 transitions. [2025-01-09 16:08:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:08:55,945 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2025-01-09 16:08:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:08:55,946 INFO L225 Difference]: With dead ends: 463 [2025-01-09 16:08:55,946 INFO L226 Difference]: Without dead ends: 251 [2025-01-09 16:08:55,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:08:55,947 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 231 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:08:55,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 965 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 16:08:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-09 16:08:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 204. [2025-01-09 16:08:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 179 states have (on average 1.3687150837988826) internal successors, (245), 180 states have internal predecessors, (245), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 16:08:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 289 transitions. [2025-01-09 16:08:55,981 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 289 transitions. Word has length 167 [2025-01-09 16:08:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:08:55,983 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 289 transitions. [2025-01-09 16:08:55,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 16:08:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 289 transitions. [2025-01-09 16:08:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 16:08:55,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:08:55,985 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:08:55,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:08:55,986 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:08:55,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:08:55,986 INFO L85 PathProgramCache]: Analyzing trace with hash 800627279, now seen corresponding path program 1 times [2025-01-09 16:08:55,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:08:55,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335389838] [2025-01-09 16:08:55,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:08:55,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:08:56,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 16:08:56,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 16:08:56,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:08:56,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:08:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:08:59,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:08:59,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335389838] [2025-01-09 16:08:59,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335389838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:08:59,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:08:59,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 16:08:59,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486924893] [2025-01-09 16:08:59,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:08:59,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:08:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:08:59,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:08:59,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:08:59,366 INFO L87 Difference]: Start difference. First operand 204 states and 289 transitions. Second operand has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 14 states have internal predecessors, (70), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 16:09:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:00,334 INFO L93 Difference]: Finished difference Result 454 states and 643 transitions. [2025-01-09 16:09:00,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:09:00,336 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 14 states have internal predecessors, (70), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) Word has length 167 [2025-01-09 16:09:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:00,337 INFO L225 Difference]: With dead ends: 454 [2025-01-09 16:09:00,337 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 16:09:00,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:09:00,338 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 561 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:00,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 554 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:09:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 16:09:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2025-01-09 16:09:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 190 states have (on average 1.3789473684210527) internal successors, (262), 191 states have internal predecessors, (262), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 16:09:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 306 transitions. [2025-01-09 16:09:00,360 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 306 transitions. Word has length 167 [2025-01-09 16:09:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:00,360 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 306 transitions. [2025-01-09 16:09:00,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.833333333333333) internal successors, (70), 14 states have internal predecessors, (70), 5 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 5 states have call successors, (20) [2025-01-09 16:09:00,361 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 306 transitions. [2025-01-09 16:09:00,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 16:09:00,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:00,363 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:09:00,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:09:00,363 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:00,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash 213821265, now seen corresponding path program 1 times [2025-01-09 16:09:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:00,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994152276] [2025-01-09 16:09:00,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:00,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:00,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 16:09:00,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 16:09:00,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:00,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:09:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 16:09:02,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:09:02,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994152276] [2025-01-09 16:09:02,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994152276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:09:02,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:09:02,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 16:09:02,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273860925] [2025-01-09 16:09:02,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:09:02,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:09:02,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:09:02,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:09:02,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:09:02,794 INFO L87 Difference]: Start difference. First operand 215 states and 306 transitions. Second operand has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 16:09:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:09:04,062 INFO L93 Difference]: Finished difference Result 465 states and 659 transitions. [2025-01-09 16:09:04,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:09:04,062 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 167 [2025-01-09 16:09:04,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:09:04,064 INFO L225 Difference]: With dead ends: 465 [2025-01-09 16:09:04,064 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 16:09:04,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:09:04,065 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 176 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:09:04,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 929 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 16:09:04,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 16:09:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 213. [2025-01-09 16:09:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 188 states have (on average 1.3829787234042554) internal successors, (260), 189 states have internal predecessors, (260), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 16:09:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 304 transitions. [2025-01-09 16:09:04,085 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 304 transitions. Word has length 167 [2025-01-09 16:09:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:09:04,085 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 304 transitions. [2025-01-09 16:09:04,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) [2025-01-09 16:09:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 304 transitions. [2025-01-09 16:09:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 16:09:04,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:09:04,087 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:09:04,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:09:04,087 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:09:04,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:09:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1081215574, now seen corresponding path program 1 times [2025-01-09 16:09:04,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:09:04,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576715338] [2025-01-09 16:09:04,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:09:04,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:09:04,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 16:09:04,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 16:09:04,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:09:04,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat