./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:18:39,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:18:39,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:18:39,831 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:18:39,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:18:39,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:18:39,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:18:39,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:18:39,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:18:39,860 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:18:39,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:18:39,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:18:39,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:18:39,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:18:39,862 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:18:39,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:18:39,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:18:39,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:18:39,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:18:39,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:18:39,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:18:39,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:18:39,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:18:39,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:18:39,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:18:39,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:18:39,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:18:39,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:18:39,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:18:39,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:18:39,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:18:39,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:18:39,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:18:39,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:18:39,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:18:39,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:18:39,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:18:39,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:18:39,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:18:39,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:18:39,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:18:39,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:18:39,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:18:39,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:18:39,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:18:39,867 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d [2025-01-09 08:18:40,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:18:40,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:18:40,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:18:40,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:18:40,163 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:18:40,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2025-01-09 08:18:41,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32e28846a/e7600db51e3c48d4b55144875307a5f4/FLAG1a6e69c35 [2025-01-09 08:18:41,730 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:18:41,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2025-01-09 08:18:41,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32e28846a/e7600db51e3c48d4b55144875307a5f4/FLAG1a6e69c35 [2025-01-09 08:18:41,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/32e28846a/e7600db51e3c48d4b55144875307a5f4 [2025-01-09 08:18:41,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:18:41,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:18:41,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:18:41,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:18:41,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:18:41,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:18:41" (1/1) ... [2025-01-09 08:18:41,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2385ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:41, skipping insertion in model container [2025-01-09 08:18:41,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:18:41" (1/1) ... [2025-01-09 08:18:41,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:18:41,905 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2025-01-09 08:18:41,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:18:41,983 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:18:41,990 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2025-01-09 08:18:42,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:18:42,055 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:18:42,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42 WrapperNode [2025-01-09 08:18:42,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:18:42,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:18:42,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:18:42,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:18:42,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,128 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 457 [2025-01-09 08:18:42,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:18:42,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:18:42,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:18:42,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:18:42,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,169 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:18:42,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:18:42,223 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:18:42,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:18:42,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:18:42,224 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (1/1) ... [2025-01-09 08:18:42,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:18:42,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:18:42,255 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 08:18:42,258 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 08:18:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:18:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:18:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:18:42,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:18:42,388 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:18:42,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:18:43,034 INFO L? ?]: Removed 232 outVars from TransFormulas that were not future-live. [2025-01-09 08:18:43,035 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:18:43,047 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:18:43,049 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:18:43,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:18:43 BoogieIcfgContainer [2025-01-09 08:18:43,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:18:43,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:18:43,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:18:43,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:18:43,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:18:41" (1/3) ... [2025-01-09 08:18:43,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3c3a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:18:43, skipping insertion in model container [2025-01-09 08:18:43,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:18:42" (2/3) ... [2025-01-09 08:18:43,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3c3a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:18:43, skipping insertion in model container [2025-01-09 08:18:43,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:18:43" (3/3) ... [2025-01-09 08:18:43,058 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2025-01-09 08:18:43,071 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:18:43,073 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c that has 1 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:18:43,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:18:43,131 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;@76668b29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:18:43,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:18:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:43,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 08:18:43,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:43,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:43,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:43,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1135438275, now seen corresponding path program 1 times [2025-01-09 08:18:43,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:43,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186808881] [2025-01-09 08:18:43,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:43,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 08:18:43,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 08:18:43,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:43,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:43,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:43,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186808881] [2025-01-09 08:18:43,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186808881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:43,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:43,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:18:43,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216175335] [2025-01-09 08:18:43,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:43,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:18:43,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:43,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:18:43,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:18:43,636 INFO L87 Difference]: Start difference. First operand has 118 states, 116 states have (on average 1.4913793103448276) internal successors, (173), 117 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:43,691 INFO L93 Difference]: Finished difference Result 217 states and 321 transitions. [2025-01-09 08:18:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:18:43,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 08:18:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:43,698 INFO L225 Difference]: With dead ends: 217 [2025-01-09 08:18:43,699 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 08:18:43,701 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 08:18:43,703 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:43,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 495 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 08:18:43,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-09 08:18:43,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.4741379310344827) internal successors, (171), 116 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:43,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2025-01-09 08:18:43,762 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 23 [2025-01-09 08:18:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:43,762 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2025-01-09 08:18:43,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2025-01-09 08:18:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 08:18:43,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:43,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:43,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:18:43,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:43,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash 840543427, now seen corresponding path program 1 times [2025-01-09 08:18:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:43,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280440285] [2025-01-09 08:18:43,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:43,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 08:18:43,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 08:18:43,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:43,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:43,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:43,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280440285] [2025-01-09 08:18:43,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280440285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:43,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:43,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:18:43,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764601729] [2025-01-09 08:18:43,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:43,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:18:43,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:43,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:18:43,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:18:43,935 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:43,997 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2025-01-09 08:18:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:18:43,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-09 08:18:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:44,000 INFO L225 Difference]: With dead ends: 218 [2025-01-09 08:18:44,000 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 08:18:44,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 08:18:44,003 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:44,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 08:18:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-09 08:18:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2025-01-09 08:18:44,010 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 24 [2025-01-09 08:18:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:44,011 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2025-01-09 08:18:44,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2025-01-09 08:18:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 08:18:44,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:44,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:44,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:18:44,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:44,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:44,013 INFO L85 PathProgramCache]: Analyzing trace with hash -810923364, now seen corresponding path program 1 times [2025-01-09 08:18:44,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:44,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560177000] [2025-01-09 08:18:44,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:44,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:44,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 08:18:44,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 08:18:44,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:44,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:44,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:44,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560177000] [2025-01-09 08:18:44,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560177000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:44,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:44,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:18:44,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687337154] [2025-01-09 08:18:44,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:44,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:18:44,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:44,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:18:44,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:18:44,380 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:44,502 INFO L93 Difference]: Finished difference Result 231 states and 337 transitions. [2025-01-09 08:18:44,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:18:44,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-01-09 08:18:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:44,505 INFO L225 Difference]: With dead ends: 231 [2025-01-09 08:18:44,505 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 08:18:44,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:18:44,506 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 26 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:44,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 927 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 08:18:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2025-01-09 08:18:44,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.453125) internal successors, (186), 128 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2025-01-09 08:18:44,522 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 25 [2025-01-09 08:18:44,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:44,523 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2025-01-09 08:18:44,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2025-01-09 08:18:44,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 08:18:44,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:44,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:44,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:18:44,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:44,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:44,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1540066410, now seen corresponding path program 1 times [2025-01-09 08:18:44,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:44,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105685612] [2025-01-09 08:18:44,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:44,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:44,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 08:18:44,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 08:18:44,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:44,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:44,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:44,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105685612] [2025-01-09 08:18:44,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105685612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:44,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:44,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:18:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027439448] [2025-01-09 08:18:44,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:44,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:18:44,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:44,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:18:44,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:18:44,944 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:45,128 INFO L93 Difference]: Finished difference Result 305 states and 441 transitions. [2025-01-09 08:18:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:18:45,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 08:18:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:45,129 INFO L225 Difference]: With dead ends: 305 [2025-01-09 08:18:45,130 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 08:18:45,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:18:45,133 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 130 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:45,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1203 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 08:18:45,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 131. [2025-01-09 08:18:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4461538461538461) internal successors, (188), 130 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2025-01-09 08:18:45,148 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 26 [2025-01-09 08:18:45,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:45,148 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2025-01-09 08:18:45,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2025-01-09 08:18:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 08:18:45,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:45,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:45,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:18:45,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:45,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1685236529, now seen corresponding path program 1 times [2025-01-09 08:18:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:45,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139514682] [2025-01-09 08:18:45,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:45,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:45,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 08:18:45,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 08:18:45,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:45,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:45,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:45,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139514682] [2025-01-09 08:18:45,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139514682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:45,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:45,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:18:45,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923019864] [2025-01-09 08:18:45,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:45,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:18:45,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:45,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:18:45,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:18:45,329 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:45,430 INFO L93 Difference]: Finished difference Result 303 states and 434 transitions. [2025-01-09 08:18:45,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:18:45,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-01-09 08:18:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:45,432 INFO L225 Difference]: With dead ends: 303 [2025-01-09 08:18:45,432 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 08:18:45,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:18:45,434 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 109 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:45,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 910 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 08:18:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 132. [2025-01-09 08:18:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 131 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2025-01-09 08:18:45,443 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 26 [2025-01-09 08:18:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:45,443 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2025-01-09 08:18:45,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2025-01-09 08:18:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 08:18:45,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:45,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:45,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:18:45,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:45,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:45,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1487729941, now seen corresponding path program 1 times [2025-01-09 08:18:45,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:45,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214197035] [2025-01-09 08:18:45,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:45,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:45,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 08:18:45,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 08:18:45,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:45,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:45,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214197035] [2025-01-09 08:18:45,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214197035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:45,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:45,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:18:45,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019352522] [2025-01-09 08:18:45,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:45,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:18:45,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:45,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:18:45,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:18:45,571 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:45,610 INFO L93 Difference]: Finished difference Result 283 states and 405 transitions. [2025-01-09 08:18:45,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:18:45,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-09 08:18:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:45,611 INFO L225 Difference]: With dead ends: 283 [2025-01-09 08:18:45,611 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 08:18:45,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:18:45,612 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 89 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:45,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 626 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:45,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 08:18:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 128. [2025-01-09 08:18:45,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4330708661417322) internal successors, (182), 127 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 182 transitions. [2025-01-09 08:18:45,625 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 182 transitions. Word has length 27 [2025-01-09 08:18:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:45,625 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 182 transitions. [2025-01-09 08:18:45,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 182 transitions. [2025-01-09 08:18:45,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 08:18:45,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:45,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:45,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:18:45,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:45,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:45,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1767100030, now seen corresponding path program 1 times [2025-01-09 08:18:45,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:45,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316100353] [2025-01-09 08:18:45,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:45,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:45,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 08:18:45,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 08:18:45,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:45,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:46,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:46,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:46,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316100353] [2025-01-09 08:18:46,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316100353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:46,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:46,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:18:46,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307592239] [2025-01-09 08:18:46,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:46,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:18:46,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:46,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:18:46,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:18:46,171 INFO L87 Difference]: Start difference. First operand 128 states and 182 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:46,257 INFO L93 Difference]: Finished difference Result 277 states and 399 transitions. [2025-01-09 08:18:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:18:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 08:18:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:46,259 INFO L225 Difference]: With dead ends: 277 [2025-01-09 08:18:46,259 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 08:18:46,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:18:46,260 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 92 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:46,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 794 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:46,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 08:18:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2025-01-09 08:18:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4166666666666667) internal successors, (204), 144 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 204 transitions. [2025-01-09 08:18:46,269 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 204 transitions. Word has length 75 [2025-01-09 08:18:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:46,270 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 204 transitions. [2025-01-09 08:18:46,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 204 transitions. [2025-01-09 08:18:46,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 08:18:46,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:46,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:46,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:18:46,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:46,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:46,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2102834484, now seen corresponding path program 1 times [2025-01-09 08:18:46,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:46,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412833121] [2025-01-09 08:18:46,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:46,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:46,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 08:18:46,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 08:18:46,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:46,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:46,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:46,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412833121] [2025-01-09 08:18:46,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412833121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:46,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:46,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:18:46,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023067725] [2025-01-09 08:18:46,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:46,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:18:46,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:46,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:18:46,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:18:46,693 INFO L87 Difference]: Start difference. First operand 145 states and 204 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:46,738 INFO L93 Difference]: Finished difference Result 254 states and 363 transitions. [2025-01-09 08:18:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:18:46,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-01-09 08:18:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:46,739 INFO L225 Difference]: With dead ends: 254 [2025-01-09 08:18:46,739 INFO L226 Difference]: Without dead ends: 153 [2025-01-09 08:18:46,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:18:46,740 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 5 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:46,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 809 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-01-09 08:18:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2025-01-09 08:18:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 149 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 210 transitions. [2025-01-09 08:18:46,746 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 210 transitions. Word has length 76 [2025-01-09 08:18:46,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:46,746 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 210 transitions. [2025-01-09 08:18:46,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 210 transitions. [2025-01-09 08:18:46,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 08:18:46,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:46,747 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:46,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:18:46,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:46,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1102813423, now seen corresponding path program 1 times [2025-01-09 08:18:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:46,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677988964] [2025-01-09 08:18:46,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:46,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 08:18:46,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 08:18:46,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:46,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:47,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:47,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677988964] [2025-01-09 08:18:47,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677988964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:47,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:47,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:18:47,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831394978] [2025-01-09 08:18:47,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:47,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:18:47,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:47,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:18:47,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:18:47,335 INFO L87 Difference]: Start difference. First operand 150 states and 210 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:47,486 INFO L93 Difference]: Finished difference Result 307 states and 439 transitions. [2025-01-09 08:18:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:18:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-01-09 08:18:47,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:47,489 INFO L225 Difference]: With dead ends: 307 [2025-01-09 08:18:47,489 INFO L226 Difference]: Without dead ends: 201 [2025-01-09 08:18:47,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:18:47,490 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 99 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:47,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1204 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-01-09 08:18:47,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 168. [2025-01-09 08:18:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.407185628742515) internal successors, (235), 167 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 235 transitions. [2025-01-09 08:18:47,495 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 235 transitions. Word has length 77 [2025-01-09 08:18:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:47,495 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 235 transitions. [2025-01-09 08:18:47,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 235 transitions. [2025-01-09 08:18:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 08:18:47,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:47,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:47,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:18:47,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:47,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:47,498 INFO L85 PathProgramCache]: Analyzing trace with hash 599392645, now seen corresponding path program 1 times [2025-01-09 08:18:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:47,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008954011] [2025-01-09 08:18:47,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:47,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 08:18:47,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 08:18:47,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:47,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:47,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008954011] [2025-01-09 08:18:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008954011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:47,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:47,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 08:18:47,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031264642] [2025-01-09 08:18:47,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:47,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:18:47,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:47,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:18:47,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:18:47,894 INFO L87 Difference]: Start difference. First operand 168 states and 235 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:47,991 INFO L93 Difference]: Finished difference Result 292 states and 415 transitions. [2025-01-09 08:18:47,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:18:47,992 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 08:18:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:47,993 INFO L225 Difference]: With dead ends: 292 [2025-01-09 08:18:47,993 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 08:18:47,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:18:47,993 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 11 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:47,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1290 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 08:18:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2025-01-09 08:18:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4021739130434783) internal successors, (258), 184 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 258 transitions. [2025-01-09 08:18:48,002 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 258 transitions. Word has length 78 [2025-01-09 08:18:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:48,003 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 258 transitions. [2025-01-09 08:18:48,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:48,003 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 258 transitions. [2025-01-09 08:18:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 08:18:48,004 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:48,004 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:48,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:18:48,004 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:48,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash 985055635, now seen corresponding path program 1 times [2025-01-09 08:18:48,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:48,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792611515] [2025-01-09 08:18:48,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:48,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:48,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 08:18:48,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 08:18:48,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:48,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:48,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792611515] [2025-01-09 08:18:48,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792611515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:48,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:48,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:18:48,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340998369] [2025-01-09 08:18:48,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:48,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:18:48,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:48,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:18:48,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:18:48,526 INFO L87 Difference]: Start difference. First operand 185 states and 258 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:48,542 INFO L93 Difference]: Finished difference Result 308 states and 434 transitions. [2025-01-09 08:18:48,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:18:48,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-01-09 08:18:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:48,544 INFO L225 Difference]: With dead ends: 308 [2025-01-09 08:18:48,544 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 08:18:48,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:18:48,544 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 2 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:48,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 325 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 08:18:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2025-01-09 08:18:48,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.3967391304347827) internal successors, (257), 184 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 257 transitions. [2025-01-09 08:18:48,552 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 257 transitions. Word has length 78 [2025-01-09 08:18:48,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:48,553 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 257 transitions. [2025-01-09 08:18:48,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:48,553 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 257 transitions. [2025-01-09 08:18:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 08:18:48,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:48,555 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:48,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:18:48,555 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:48,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:48,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1801205834, now seen corresponding path program 1 times [2025-01-09 08:18:48,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:48,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8882607] [2025-01-09 08:18:48,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:48,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:48,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 08:18:48,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 08:18:48,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:48,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:49,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8882607] [2025-01-09 08:18:49,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8882607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:49,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:49,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 08:18:49,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564604345] [2025-01-09 08:18:49,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:49,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 08:18:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:49,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 08:18:49,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:18:49,271 INFO L87 Difference]: Start difference. First operand 185 states and 257 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:49,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:49,520 INFO L93 Difference]: Finished difference Result 360 states and 507 transitions. [2025-01-09 08:18:49,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 08:18:49,520 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-01-09 08:18:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:49,521 INFO L225 Difference]: With dead ends: 360 [2025-01-09 08:18:49,521 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 08:18:49,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-01-09 08:18:49,522 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 45 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:49,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1677 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:18:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 08:18:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 215. [2025-01-09 08:18:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.3925233644859814) internal successors, (298), 214 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 298 transitions. [2025-01-09 08:18:49,528 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 298 transitions. Word has length 79 [2025-01-09 08:18:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:49,528 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 298 transitions. [2025-01-09 08:18:49,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 298 transitions. [2025-01-09 08:18:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 08:18:49,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:49,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:49,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:18:49,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:49,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash 28135856, now seen corresponding path program 1 times [2025-01-09 08:18:49,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:49,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755661535] [2025-01-09 08:18:49,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:49,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:49,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 08:18:49,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 08:18:49,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:49,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:50,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:50,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755661535] [2025-01-09 08:18:50,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755661535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:50,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:50,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 08:18:50,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795456125] [2025-01-09 08:18:50,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:50,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 08:18:50,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:50,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 08:18:50,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:18:50,320 INFO L87 Difference]: Start difference. First operand 215 states and 298 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:50,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:50,571 INFO L93 Difference]: Finished difference Result 423 states and 596 transitions. [2025-01-09 08:18:50,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 08:18:50,571 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-09 08:18:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:50,573 INFO L225 Difference]: With dead ends: 423 [2025-01-09 08:18:50,573 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 08:18:50,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-09 08:18:50,574 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 74 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:50,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1606 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:18:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 08:18:50,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 258. [2025-01-09 08:18:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 1.3891050583657587) internal successors, (357), 257 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 357 transitions. [2025-01-09 08:18:50,588 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 357 transitions. Word has length 80 [2025-01-09 08:18:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:50,588 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 357 transitions. [2025-01-09 08:18:50,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 357 transitions. [2025-01-09 08:18:50,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 08:18:50,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:50,589 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:50,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:18:50,590 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:50,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash -118938263, now seen corresponding path program 1 times [2025-01-09 08:18:50,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:50,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644883503] [2025-01-09 08:18:50,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:50,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:50,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 08:18:50,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 08:18:50,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:50,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:51,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:51,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644883503] [2025-01-09 08:18:51,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644883503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:51,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:51,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:18:51,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44230220] [2025-01-09 08:18:51,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:51,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:18:51,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:51,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:18:51,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:18:51,161 INFO L87 Difference]: Start difference. First operand 258 states and 357 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:51,303 INFO L93 Difference]: Finished difference Result 447 states and 624 transitions. [2025-01-09 08:18:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:18:51,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-09 08:18:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:51,305 INFO L225 Difference]: With dead ends: 447 [2025-01-09 08:18:51,305 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 08:18:51,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:18:51,306 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 29 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:51,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1486 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:51,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 08:18:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 287. [2025-01-09 08:18:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.3916083916083917) internal successors, (398), 286 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 398 transitions. [2025-01-09 08:18:51,323 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 398 transitions. Word has length 80 [2025-01-09 08:18:51,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:51,323 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 398 transitions. [2025-01-09 08:18:51,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:51,323 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 398 transitions. [2025-01-09 08:18:51,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 08:18:51,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:51,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:51,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 08:18:51,325 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:51,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:51,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1169245647, now seen corresponding path program 1 times [2025-01-09 08:18:51,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:51,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599971392] [2025-01-09 08:18:51,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:51,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:51,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 08:18:51,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 08:18:51,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:51,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:52,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:52,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599971392] [2025-01-09 08:18:52,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599971392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:52,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:52,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 08:18:52,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584174653] [2025-01-09 08:18:52,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:52,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 08:18:52,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:52,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 08:18:52,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-01-09 08:18:52,332 INFO L87 Difference]: Start difference. First operand 287 states and 398 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:52,908 INFO L93 Difference]: Finished difference Result 530 states and 744 transitions. [2025-01-09 08:18:52,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 08:18:52,908 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 08:18:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:52,910 INFO L225 Difference]: With dead ends: 530 [2025-01-09 08:18:52,910 INFO L226 Difference]: Without dead ends: 352 [2025-01-09 08:18:52,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-01-09 08:18:52,911 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 158 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:52,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 2139 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:18:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-01-09 08:18:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 329. [2025-01-09 08:18:52,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.4024390243902438) internal successors, (460), 328 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 460 transitions. [2025-01-09 08:18:52,923 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 460 transitions. Word has length 81 [2025-01-09 08:18:52,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:52,923 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 460 transitions. [2025-01-09 08:18:52,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:52,923 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 460 transitions. [2025-01-09 08:18:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 08:18:52,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:52,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:52,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 08:18:52,925 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:52,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:52,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1118774572, now seen corresponding path program 1 times [2025-01-09 08:18:52,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:52,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744916709] [2025-01-09 08:18:52,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:52,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:52,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 08:18:53,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 08:18:53,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:53,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:53,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:53,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744916709] [2025-01-09 08:18:53,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744916709] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:18:53,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548667197] [2025-01-09 08:18:53,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:53,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:18:53,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:18:53,588 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 08:18:53,591 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 08:18:53,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 08:18:53,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 08:18:53,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:53,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:53,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 08:18:53,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:18:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:54,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:18:54,998 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:54,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548667197] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 08:18:54,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:18:54,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [12, 16] total 37 [2025-01-09 08:18:54,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311824351] [2025-01-09 08:18:54,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:54,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 08:18:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:55,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 08:18:55,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 08:18:55,002 INFO L87 Difference]: Start difference. First operand 329 states and 460 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:55,438 INFO L93 Difference]: Finished difference Result 564 states and 792 transitions. [2025-01-09 08:18:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 08:18:55,440 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 08:18:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:55,442 INFO L225 Difference]: With dead ends: 564 [2025-01-09 08:18:55,442 INFO L226 Difference]: Without dead ends: 385 [2025-01-09 08:18:55,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=134, Invalid=1588, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 08:18:55,445 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 59 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:55,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1513 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:18:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-01-09 08:18:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 365. [2025-01-09 08:18:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.4065934065934067) internal successors, (512), 364 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 512 transitions. [2025-01-09 08:18:55,456 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 512 transitions. Word has length 81 [2025-01-09 08:18:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:55,456 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 512 transitions. [2025-01-09 08:18:55,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 512 transitions. [2025-01-09 08:18:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 08:18:55,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:55,461 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:55,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 08:18:55,662 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,SelfDestructingSolverStorable15 [2025-01-09 08:18:55,662 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:55,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:55,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1516768061, now seen corresponding path program 1 times [2025-01-09 08:18:55,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:55,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215753607] [2025-01-09 08:18:55,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:55,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:55,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 08:18:55,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 08:18:55,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:55,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215753607] [2025-01-09 08:18:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215753607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:56,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:18:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051970408] [2025-01-09 08:18:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:56,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:18:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:56,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:18:56,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:18:56,075 INFO L87 Difference]: Start difference. First operand 365 states and 512 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:56,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:56,269 INFO L93 Difference]: Finished difference Result 677 states and 954 transitions. [2025-01-09 08:18:56,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 08:18:56,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 08:18:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:56,272 INFO L225 Difference]: With dead ends: 677 [2025-01-09 08:18:56,272 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 08:18:56,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-01-09 08:18:56,273 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 132 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 2077 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:56,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 2077 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:56,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 08:18:56,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 384. [2025-01-09 08:18:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 1.4073107049608355) internal successors, (539), 383 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 539 transitions. [2025-01-09 08:18:56,284 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 539 transitions. Word has length 81 [2025-01-09 08:18:56,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:56,284 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 539 transitions. [2025-01-09 08:18:56,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 539 transitions. [2025-01-09 08:18:56,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 08:18:56,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:56,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:56,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 08:18:56,287 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:56,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1661938180, now seen corresponding path program 1 times [2025-01-09 08:18:56,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:56,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958255043] [2025-01-09 08:18:56,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:56,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:56,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 08:18:56,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 08:18:56,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:56,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:56,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:56,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958255043] [2025-01-09 08:18:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958255043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:56,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 08:18:56,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666186908] [2025-01-09 08:18:56,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:56,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 08:18:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:56,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 08:18:56,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:18:56,876 INFO L87 Difference]: Start difference. First operand 384 states and 539 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:57,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:57,223 INFO L93 Difference]: Finished difference Result 967 states and 1369 transitions. [2025-01-09 08:18:57,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 08:18:57,224 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 08:18:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:57,228 INFO L225 Difference]: With dead ends: 967 [2025-01-09 08:18:57,229 INFO L226 Difference]: Without dead ends: 743 [2025-01-09 08:18:57,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-01-09 08:18:57,231 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 152 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:57,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 2413 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:18:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-01-09 08:18:57,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 620. [2025-01-09 08:18:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.4022617124394183) internal successors, (868), 619 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 868 transitions. [2025-01-09 08:18:57,252 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 868 transitions. Word has length 81 [2025-01-09 08:18:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:57,253 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 868 transitions. [2025-01-09 08:18:57,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 868 transitions. [2025-01-09 08:18:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 08:18:57,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:57,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:57,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 08:18:57,256 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:57,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:57,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1776829672, now seen corresponding path program 1 times [2025-01-09 08:18:57,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:57,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751363846] [2025-01-09 08:18:57,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:57,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:57,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 08:18:57,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 08:18:57,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:57,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:57,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:57,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751363846] [2025-01-09 08:18:57,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751363846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:57,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:57,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:18:57,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008750958] [2025-01-09 08:18:57,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:57,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:18:57,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:57,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:18:57,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:18:57,742 INFO L87 Difference]: Start difference. First operand 620 states and 868 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:57,902 INFO L93 Difference]: Finished difference Result 1129 states and 1589 transitions. [2025-01-09 08:18:57,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:18:57,903 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 08:18:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:57,906 INFO L225 Difference]: With dead ends: 1129 [2025-01-09 08:18:57,906 INFO L226 Difference]: Without dead ends: 652 [2025-01-09 08:18:57,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 08:18:57,908 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 81 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:57,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1310 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:18:57,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-01-09 08:18:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 648. [2025-01-09 08:18:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 647 states have (on average 1.3848531684698608) internal successors, (896), 647 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 896 transitions. [2025-01-09 08:18:57,924 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 896 transitions. Word has length 81 [2025-01-09 08:18:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:57,925 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 896 transitions. [2025-01-09 08:18:57,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 896 transitions. [2025-01-09 08:18:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 08:18:57,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:57,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:57,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 08:18:57,928 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:57,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:57,929 INFO L85 PathProgramCache]: Analyzing trace with hash -66857656, now seen corresponding path program 1 times [2025-01-09 08:18:57,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:57,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386123112] [2025-01-09 08:18:57,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:57,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:57,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 08:18:57,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 08:18:57,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:57,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:58,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:58,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386123112] [2025-01-09 08:18:58,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386123112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:58,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:58,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:18:58,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366989369] [2025-01-09 08:18:58,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:58,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:18:58,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:58,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:18:58,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:18:58,093 INFO L87 Difference]: Start difference. First operand 648 states and 896 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:58,124 INFO L93 Difference]: Finished difference Result 1067 states and 1487 transitions. [2025-01-09 08:18:58,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:18:58,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 08:18:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:58,127 INFO L225 Difference]: With dead ends: 1067 [2025-01-09 08:18:58,127 INFO L226 Difference]: Without dead ends: 638 [2025-01-09 08:18:58,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:18:58,131 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 51 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:58,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 621 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-01-09 08:18:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2025-01-09 08:18:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 1.3720565149136579) internal successors, (874), 637 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:58,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 874 transitions. [2025-01-09 08:18:58,153 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 874 transitions. Word has length 81 [2025-01-09 08:18:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:58,153 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 874 transitions. [2025-01-09 08:18:58,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 874 transitions. [2025-01-09 08:18:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 08:18:58,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:58,155 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:58,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 08:18:58,156 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:58,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:58,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1970933155, now seen corresponding path program 1 times [2025-01-09 08:18:58,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:58,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662888680] [2025-01-09 08:18:58,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:58,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:58,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 08:18:58,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 08:18:58,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:58,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:58,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:58,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662888680] [2025-01-09 08:18:58,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662888680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:18:58,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:18:58,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:18:58,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453906748] [2025-01-09 08:18:58,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:18:58,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:18:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:18:58,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:18:58,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:18:58,304 INFO L87 Difference]: Start difference. First operand 638 states and 874 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:18:58,350 INFO L93 Difference]: Finished difference Result 1111 states and 1530 transitions. [2025-01-09 08:18:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:18:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-01-09 08:18:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:18:58,353 INFO L225 Difference]: With dead ends: 1111 [2025-01-09 08:18:58,353 INFO L226 Difference]: Without dead ends: 636 [2025-01-09 08:18:58,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:18:58,355 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 57 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:18:58,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 609 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:18:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-01-09 08:18:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2025-01-09 08:18:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.368503937007874) internal successors, (869), 635 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 869 transitions. [2025-01-09 08:18:58,369 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 869 transitions. Word has length 81 [2025-01-09 08:18:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:18:58,369 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 869 transitions. [2025-01-09 08:18:58,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:18:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 869 transitions. [2025-01-09 08:18:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 08:18:58,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:18:58,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:18:58,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 08:18:58,371 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:18:58,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:18:58,372 INFO L85 PathProgramCache]: Analyzing trace with hash 94516038, now seen corresponding path program 1 times [2025-01-09 08:18:58,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:18:58,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316571956] [2025-01-09 08:18:58,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:58,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:18:58,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 08:18:58,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 08:18:58,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:58,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:18:59,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:18:59,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316571956] [2025-01-09 08:18:59,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316571956] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:18:59,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321928066] [2025-01-09 08:18:59,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:18:59,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:18:59,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:18:59,038 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 08:18:59,041 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 08:18:59,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 08:18:59,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 08:18:59,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:18:59,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:18:59,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-01-09 08:18:59,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:00,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:19:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:02,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321928066] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:19:02,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:19:02,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 30, 29] total 68 [2025-01-09 08:19:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464534457] [2025-01-09 08:19:02,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:19:02,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-01-09 08:19:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:02,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-01-09 08:19:02,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=3778, Unknown=0, NotChecked=0, Total=4556 [2025-01-09 08:19:02,689 INFO L87 Difference]: Start difference. First operand 636 states and 869 transitions. Second operand has 68 states, 68 states have (on average 3.3676470588235294) internal successors, (229), 68 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:05,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:05,784 INFO L93 Difference]: Finished difference Result 1436 states and 1999 transitions. [2025-01-09 08:19:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-01-09 08:19:05,784 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.3676470588235294) internal successors, (229), 68 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 08:19:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:05,789 INFO L225 Difference]: With dead ends: 1436 [2025-01-09 08:19:05,789 INFO L226 Difference]: Without dead ends: 1065 [2025-01-09 08:19:05,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4069 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2014, Invalid=11792, Unknown=0, NotChecked=0, Total=13806 [2025-01-09 08:19:05,795 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1064 mSDsluCounter, 4090 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 4211 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:05,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 4211 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 08:19:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-01-09 08:19:05,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 819. [2025-01-09 08:19:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.385085574572127) internal successors, (1133), 818 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1133 transitions. [2025-01-09 08:19:05,818 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1133 transitions. Word has length 82 [2025-01-09 08:19:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:05,818 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1133 transitions. [2025-01-09 08:19:05,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.3676470588235294) internal successors, (229), 68 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1133 transitions. [2025-01-09 08:19:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 08:19:05,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:05,821 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:05,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 08:19:06,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:06,025 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:06,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:06,025 INFO L85 PathProgramCache]: Analyzing trace with hash 765481122, now seen corresponding path program 1 times [2025-01-09 08:19:06,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:06,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941691990] [2025-01-09 08:19:06,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:06,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:06,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 08:19:06,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 08:19:06,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:06,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:06,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:06,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941691990] [2025-01-09 08:19:06,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941691990] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:06,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604126350] [2025-01-09 08:19:06,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:06,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:06,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:06,402 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:19:06,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:19:06,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 08:19:06,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 08:19:06,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:06,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:06,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 85 conjuncts are in the unsatisfiable core [2025-01-09 08:19:06,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:07,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:19:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:07,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604126350] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:19:07,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:19:07,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 17] total 38 [2025-01-09 08:19:07,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630856434] [2025-01-09 08:19:07,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:19:07,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 08:19:07,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:07,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 08:19:07,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 08:19:07,969 INFO L87 Difference]: Start difference. First operand 819 states and 1133 transitions. Second operand has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:08,847 INFO L93 Difference]: Finished difference Result 2425 states and 3368 transitions. [2025-01-09 08:19:08,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 08:19:08,847 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 08:19:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:08,852 INFO L225 Difference]: With dead ends: 2425 [2025-01-09 08:19:08,852 INFO L226 Difference]: Without dead ends: 1645 [2025-01-09 08:19:08,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=423, Invalid=3359, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 08:19:08,855 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 524 mSDsluCounter, 2948 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 3087 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:08,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 3087 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:19:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2025-01-09 08:19:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1564. [2025-01-09 08:19:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 1.3742802303262955) internal successors, (2148), 1563 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2148 transitions. [2025-01-09 08:19:08,889 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2148 transitions. Word has length 82 [2025-01-09 08:19:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:08,889 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2148 transitions. [2025-01-09 08:19:08,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.552631578947368) internal successors, (173), 38 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2148 transitions. [2025-01-09 08:19:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 08:19:08,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:08,893 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:08,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 08:19:09,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:09,094 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:09,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:09,094 INFO L85 PathProgramCache]: Analyzing trace with hash -6288752, now seen corresponding path program 1 times [2025-01-09 08:19:09,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:09,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181635874] [2025-01-09 08:19:09,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:09,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:09,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 08:19:09,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 08:19:09,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:09,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:09,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:09,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181635874] [2025-01-09 08:19:09,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181635874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:09,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:09,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 08:19:09,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084163017] [2025-01-09 08:19:09,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:09,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 08:19:09,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:09,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 08:19:09,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:19:09,745 INFO L87 Difference]: Start difference. First operand 1564 states and 2148 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:10,132 INFO L93 Difference]: Finished difference Result 2711 states and 3753 transitions. [2025-01-09 08:19:10,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 08:19:10,133 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 08:19:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:10,138 INFO L225 Difference]: With dead ends: 2711 [2025-01-09 08:19:10,138 INFO L226 Difference]: Without dead ends: 1596 [2025-01-09 08:19:10,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-01-09 08:19:10,141 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 124 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:10,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 1849 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:19:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2025-01-09 08:19:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1568. [2025-01-09 08:19:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.3733248245054244) internal successors, (2152), 1567 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2152 transitions. [2025-01-09 08:19:10,173 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2152 transitions. Word has length 82 [2025-01-09 08:19:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:10,173 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2152 transitions. [2025-01-09 08:19:10,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2152 transitions. [2025-01-09 08:19:10,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 08:19:10,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:10,178 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:10,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 08:19:10,178 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:10,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:10,178 INFO L85 PathProgramCache]: Analyzing trace with hash -231925111, now seen corresponding path program 1 times [2025-01-09 08:19:10,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:10,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359098279] [2025-01-09 08:19:10,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:10,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:10,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 08:19:10,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 08:19:10,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:10,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:11,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:11,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359098279] [2025-01-09 08:19:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359098279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:11,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:11,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 08:19:11,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611099090] [2025-01-09 08:19:11,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:11,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 08:19:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:11,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 08:19:11,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-01-09 08:19:11,128 INFO L87 Difference]: Start difference. First operand 1568 states and 2152 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:11,484 INFO L93 Difference]: Finished difference Result 2679 states and 3709 transitions. [2025-01-09 08:19:11,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 08:19:11,485 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 08:19:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:11,490 INFO L225 Difference]: With dead ends: 2679 [2025-01-09 08:19:11,490 INFO L226 Difference]: Without dead ends: 1600 [2025-01-09 08:19:11,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-01-09 08:19:11,492 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 98 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:11,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1830 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:19:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2025-01-09 08:19:11,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1572. [2025-01-09 08:19:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1571 states have (on average 1.372374283895608) internal successors, (2156), 1571 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2156 transitions. [2025-01-09 08:19:11,522 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2156 transitions. Word has length 82 [2025-01-09 08:19:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:11,522 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2156 transitions. [2025-01-09 08:19:11,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2156 transitions. [2025-01-09 08:19:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 08:19:11,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:11,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:11,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 08:19:11,525 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:11,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 861498717, now seen corresponding path program 1 times [2025-01-09 08:19:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:11,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584514524] [2025-01-09 08:19:11,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:11,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:11,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 08:19:11,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 08:19:11,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:11,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:11,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:11,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584514524] [2025-01-09 08:19:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584514524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:11,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:11,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693914536] [2025-01-09 08:19:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:11,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:11,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:11,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:11,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:11,696 INFO L87 Difference]: Start difference. First operand 1572 states and 2156 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:11,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:11,741 INFO L93 Difference]: Finished difference Result 2651 states and 3669 transitions. [2025-01-09 08:19:11,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:11,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-01-09 08:19:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:11,746 INFO L225 Difference]: With dead ends: 2651 [2025-01-09 08:19:11,746 INFO L226 Difference]: Without dead ends: 1358 [2025-01-09 08:19:11,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:19:11,748 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 53 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:11,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 610 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-01-09 08:19:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1358. [2025-01-09 08:19:11,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1357 states have (on average 1.3809874723655122) internal successors, (1874), 1357 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1874 transitions. [2025-01-09 08:19:11,777 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1874 transitions. Word has length 82 [2025-01-09 08:19:11,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:11,777 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1874 transitions. [2025-01-09 08:19:11,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1874 transitions. [2025-01-09 08:19:11,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 08:19:11,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:11,779 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:11,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 08:19:11,780 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:11,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:11,783 INFO L85 PathProgramCache]: Analyzing trace with hash 199575100, now seen corresponding path program 1 times [2025-01-09 08:19:11,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:11,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163279343] [2025-01-09 08:19:11,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:11,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:11,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 08:19:11,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 08:19:11,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:11,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:19:11,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:19:11,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 08:19:11,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 08:19:11,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:11,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:19:12,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:19:12,027 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:19:12,028 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:19:12,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 08:19:12,033 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:12,088 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:19:12,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:19:12 BoogieIcfgContainer [2025-01-09 08:19:12,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:19:12,093 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:19:12,093 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:19:12,094 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:19:12,095 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:18:43" (3/4) ... [2025-01-09 08:19:12,097 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:19:12,098 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:19:12,098 INFO L158 Benchmark]: Toolchain (without parser) took 30344.11ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 112.1MB in the beginning and 445.4MB in the end (delta: -333.2MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2025-01-09 08:19:12,099 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory was 124.3MB in the beginning and 123.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:19:12,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.07ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 96.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:19:12,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.82ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 86.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:19:12,101 INFO L158 Benchmark]: Boogie Preprocessor took 93.56ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 81.0MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:19:12,101 INFO L158 Benchmark]: RCFGBuilder took 826.79ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 94.3MB in the end (delta: -13.4MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2025-01-09 08:19:12,101 INFO L158 Benchmark]: TraceAbstraction took 29040.52ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 93.7MB in the beginning and 445.4MB in the end (delta: -351.8MB). Peak memory consumption was 298.3MB. Max. memory is 16.1GB. [2025-01-09 08:19:12,102 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 528.5MB. Free memory was 445.4MB in the beginning and 445.4MB in the end (delta: 70.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:19:12,103 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory was 124.3MB in the beginning and 123.9MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.07ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 96.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.82ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 86.5MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.56ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 81.0MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 826.79ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 94.3MB in the end (delta: -13.4MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. * TraceAbstraction took 29040.52ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 93.7MB in the beginning and 445.4MB in the end (delta: -351.8MB). Peak memory consumption was 298.3MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 528.5MB. Free memory was 445.4MB in the beginning and 445.4MB in the end (delta: 70.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 106, overapproximation of bitwiseAnd at line 111. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_29 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_33; [L49] SORT_12 input_35; [L50] SORT_3 input_37; [L51] SORT_3 input_39; [L52] SORT_12 input_97; [L53] SORT_3 input_99; [L54] SORT_1 input_102; [L55] SORT_3 input_104; [L56] SORT_3 input_106; [L57] SORT_3 input_108; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_29=1] [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_19_arg_0=0, var_19_arg_1=0, var_29=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_22_arg_0=0, var_22_arg_1=0, var_29=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_26_arg_0=-1, var_26_arg_1=0, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-256] [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND FALSE !(!(cond)) [L114] RET __VERIFIER_assert(!(bad_32_arg_0)) [L116] SORT_3 var_41_arg_0 = state_17; [L117] SORT_3 var_41 = ~var_41_arg_0; [L118] SORT_3 var_42_arg_0 = state_15; [L119] SORT_3 var_42 = ~var_42_arg_0; [L120] SORT_3 var_43_arg_0 = var_42; [L121] SORT_3 var_43_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1, var_43_arg_0=-1, var_43_arg_1=0] [L122] EXPR var_43_arg_0 & var_43_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1] [L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1; [L123] SORT_3 var_44_arg_0 = var_43; [L124] SORT_3 var_44 = ~var_44_arg_0; [L125] SORT_3 var_45_arg_0 = var_41; [L126] SORT_3 var_45_arg_1 = var_44; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_45_arg_0=-1, var_45_arg_1=-1] [L127] EXPR var_45_arg_0 | var_45_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1] [L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L128] SORT_3 var_46_arg_0 = var_45; [L129] SORT_3 var_46 = ~var_46_arg_0; [L130] SORT_3 var_47_arg_0 = state_17; [L131] SORT_3 var_47_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256, var_47_arg_0=0, var_47_arg_1=0] [L132] EXPR var_47_arg_0 & var_47_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256] [L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L133] SORT_3 var_48_arg_0 = var_42; [L134] SORT_3 var_48_arg_1 = var_47; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256, var_48_arg_0=-1, var_48_arg_1=0] [L135] EXPR var_48_arg_0 | var_48_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256] [L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L136] SORT_3 var_49_arg_0 = var_48; [L137] SORT_3 var_49 = ~var_49_arg_0; [L138] SORT_3 var_50_arg_0 = var_46; [L139] SORT_3 var_50_arg_1 = var_49; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_50_arg_0=-256, var_50_arg_1=-256] [L140] EXPR var_50_arg_0 | var_50_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1] [L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1; [L141] SORT_3 next_110_arg_1 = var_50; [L142] SORT_3 var_52_arg_0 = state_20; [L143] SORT_3 var_52 = ~var_52_arg_0; [L144] SORT_3 var_53_arg_0 = state_17; [L145] SORT_3 var_53_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53_arg_0=0, var_53_arg_1=-1] [L146] EXPR var_53_arg_0 | var_53_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1] [L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1; [L147] SORT_3 var_54_arg_0 = state_17; [L148] SORT_3 var_54_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255, var_54_arg_0=0, var_54_arg_1=-1] [L149] EXPR var_54_arg_0 & var_54_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255] [L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L150] SORT_3 var_55_arg_0 = var_54; [L151] SORT_3 var_55 = ~var_55_arg_0; [L152] SORT_3 var_56_arg_0 = var_53; [L153] SORT_3 var_56_arg_1 = var_55; VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_56_arg_0=255, var_56_arg_1=-1] [L154] EXPR var_56_arg_0 & var_56_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1] [L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1; [L155] SORT_3 var_57_arg_0 = var_56; [L156] SORT_3 var_57 = ~var_57_arg_0; [L157] SORT_3 next_111_arg_1 = var_57; [L158] SORT_1 var_59_arg_0 = input_2; [L159] SORT_3 var_59 = var_59_arg_0 >> 0; [L160] SORT_1 var_60_arg_0 = input_2; [L161] SORT_3 var_60 = var_60_arg_0 >> 2; [L162] SORT_3 var_61_arg_0 = var_60; [L163] SORT_3 var_61 = ~var_61_arg_0; [L164] SORT_1 var_62_arg_0 = input_2; [L165] SORT_3 var_62 = var_62_arg_0 >> 1; [L166] SORT_3 var_63_arg_0 = var_61; [L167] SORT_3 var_63_arg_1 = var_62; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63_arg_0=-1, var_63_arg_1=0] [L168] EXPR var_63_arg_0 | var_63_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0] [L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L169] SORT_3 var_64_arg_0 = var_59; [L170] SORT_3 var_64_arg_1 = var_63; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_64_arg_0=0, var_64_arg_1=255] [L171] EXPR var_64_arg_0 | var_64_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255] [L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1; [L172] SORT_3 var_65_arg_0 = var_64; [L173] SORT_3 var_65 = ~var_65_arg_0; [L174] SORT_3 var_66_arg_0 = state_15; [L175] SORT_3 var_66_arg_1 = state_17; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_65=-256, var_66_arg_0=0, var_66_arg_1=0] [L176] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_65=-256] [L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L177] SORT_3 var_67_arg_0 = var_65; [L178] SORT_3 var_67_arg_1 = var_66; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_66=0, var_67_arg_0=-256, var_67_arg_1=0] [L179] EXPR var_67_arg_0 | var_67_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_52=-1, var_59=0, var_63=255, var_66=0] [L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L180] SORT_3 var_68_arg_0 = var_67; [L181] SORT_3 var_68_arg_1 = var_52; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_59=0, var_63=255, var_66=0, var_68_arg_0=0, var_68_arg_1=-1] [L182] EXPR var_68_arg_0 & var_68_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, state_20=0, var_29=1, var_59=0, var_63=255, var_66=0] [L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L183] SORT_3 next_112_arg_1 = var_68; [L184] SORT_3 var_75_arg_0 = state_20; [L185] SORT_3 var_75_arg_1 = var_66; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_59=0, var_63=255, var_75_arg_0=0, var_75_arg_1=0] [L186] EXPR var_75_arg_0 | var_75_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_59=0, var_63=255] [L186] SORT_3 var_75 = var_75_arg_0 | var_75_arg_1; [L187] SORT_3 var_76_arg_0 = var_75; [L188] SORT_3 var_76 = ~var_76_arg_0; [L189] SORT_3 var_77_arg_0 = var_59; [L190] SORT_3 var_77_arg_1 = var_76; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_63=255, var_76=-1, var_77_arg_0=0, var_77_arg_1=-1] [L191] EXPR var_77_arg_0 & var_77_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_63=255, var_76=-1] [L191] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L192] SORT_3 var_78_arg_0 = var_77; [L193] SORT_3 var_78 = ~var_78_arg_0; [L194] SORT_3 var_82_arg_0 = var_63; [L195] SORT_3 var_82_arg_1 = var_76; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1, var_82_arg_0=255, var_82_arg_1=-1] [L196] EXPR var_82_arg_0 & var_82_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_78=-1] [L196] SORT_3 var_82 = var_82_arg_0 & var_82_arg_1; [L197] SORT_3 var_91_arg_0 = var_82; [L198] SORT_3 var_91 = ~var_91_arg_0; [L199] SORT_3 var_92_arg_0 = var_78; [L200] SORT_3 var_92_arg_1 = var_91; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_92_arg_0=-1, var_92_arg_1=-256] [L201] EXPR var_92_arg_0 & var_92_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1] [L201] SORT_3 var_92 = var_92_arg_0 & var_92_arg_1; [L202] SORT_3 var_94_arg_0 = input_4; [L203] SORT_3 var_94_arg_1 = var_92; VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1, var_94_arg_0=254, var_94_arg_1=0] [L204] EXPR var_94_arg_0 | var_94_arg_1 VAL [mask_SORT_3=1, next_110_arg_1=0, next_111_arg_1=-256, next_112_arg_1=0, var_29=1] [L204] SORT_3 var_94 = var_94_arg_0 | var_94_arg_1; [L205] SORT_3 var_95_arg_0 = var_94; [L206] SORT_3 var_95 = ~var_95_arg_0; [L207] SORT_3 next_113_arg_1 = var_95; [L209] state_15 = next_110_arg_1 [L210] state_17 = next_111_arg_1 [L211] state_20 = next_112_arg_1 [L212] state_24 = next_113_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_19_arg_0=0, var_19_arg_1=-256, var_29=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_29=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_22_arg_0=0, var_22_arg_1=0, var_29=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, state_24=-255, var_29=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_26_arg_0=-1, var_26_arg_1=-255, var_29=1] [L106] EXPR var_26_arg_0 | var_26_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1] [L111] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] EXPR var_31 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=0, var_29=1] [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.9s, OverallIterations: 27, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3264 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3264 mSDsluCounter, 36112 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31887 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6436 IncrementalHoareTripleChecker+Invalid, 6502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 4225 mSDtfsCounter, 6436 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 449 SyntacticMatches, 4 SemanticMatches, 443 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5873 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1572occurred in iteration=25, InterpolantAutomatonStates: 320, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 930 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 2079 NumberOfCodeBlocks, 2079 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2209 ConstructedInterpolants, 0 QuantifiedInterpolants, 10642 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1352 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 294/319 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 08:19:12,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:19:14,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:19:14,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 08:19:14,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:19:14,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:19:14,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:19:14,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:19:14,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:19:14,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:19:14,712 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:19:14,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:19:14,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:19:14,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:19:14,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:19:14,713 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:19:14,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:19:14,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:19:14,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:19:14,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:19:14,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:19:14,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:19:14,715 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:19:14,715 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:19:14,715 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:19:14,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:19:14,716 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:19:14,716 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:19:14,716 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:19:14,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:19:14,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:19:14,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:19:14,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:14,717 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:19:14,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:19:14,717 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:19:14,717 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:19:14,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:14,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:19:14,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:19:14,718 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:19:14,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:19:14,718 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:19:14,719 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:19:14,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:19:14,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:19:14,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:19:14,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:19:14,719 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc15dd8c58787d1f6894f4700fb98e0d8cb8608f1a57f24801c50df888951e5d [2025-01-09 08:19:15,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:19:15,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:19:15,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:19:15,045 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:19:15,046 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:19:15,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2025-01-09 08:19:16,371 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27dc35fe5/ea66b8d2cad94e04a85600cb5fb08efd/FLAG25ee7057f [2025-01-09 08:19:16,644 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:19:16,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2025-01-09 08:19:16,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27dc35fe5/ea66b8d2cad94e04a85600cb5fb08efd/FLAG25ee7057f [2025-01-09 08:19:16,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/27dc35fe5/ea66b8d2cad94e04a85600cb5fb08efd [2025-01-09 08:19:16,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:19:16,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:19:16,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:19:16,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:19:16,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:19:16,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:19:16" (1/1) ... [2025-01-09 08:19:16,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eef33c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:16, skipping insertion in model container [2025-01-09 08:19:16,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:19:16" (1/1) ... [2025-01-09 08:19:16,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:19:16,852 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2025-01-09 08:19:16,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:19:16,948 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:19:16,962 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p4.c[1259,1272] [2025-01-09 08:19:16,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:19:17,016 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:19:17,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17 WrapperNode [2025-01-09 08:19:17,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:19:17,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:19:17,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:19:17,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:19:17,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,070 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 241 [2025-01-09 08:19:17,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:19:17,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:19:17,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:19:17,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:19:17,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,118 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:19:17,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:19:17,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:19:17,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:19:17,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:19:17,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (1/1) ... [2025-01-09 08:19:17,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:17,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:17,186 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 08:19:17,190 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 08:19:17,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:19:17,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:19:17,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:19:17,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:19:17,343 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:19:17,345 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:19:17,562 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-01-09 08:19:17,564 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:19:17,574 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:19:17,575 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:19:17,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:19:17 BoogieIcfgContainer [2025-01-09 08:19:17,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:19:17,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:19:17,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:19:17,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:19:17,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:19:16" (1/3) ... [2025-01-09 08:19:17,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b5a752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:19:17, skipping insertion in model container [2025-01-09 08:19:17,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:17" (2/3) ... [2025-01-09 08:19:17,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b5a752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:19:17, skipping insertion in model container [2025-01-09 08:19:17,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:19:17" (3/3) ... [2025-01-09 08:19:17,589 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c [2025-01-09 08:19:17,605 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:19:17,608 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p4.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:19:17,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:19:17,674 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;@459ede59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:19:17,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:19:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 08:19:17,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:17,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 08:19:17,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:17,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 08:19:17,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:19:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109678225] [2025-01-09 08:19:17,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:17,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:17,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:17,700 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 08:19:17,702 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 08:19:17,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 08:19:17,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 08:19:17,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:17,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:17,856 WARN L254 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 08:19:17,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:18,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:19:18,135 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:19:18,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109678225] [2025-01-09 08:19:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109678225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:18,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:18,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:19:18,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780212385] [2025-01-09 08:19:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:18,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:19:18,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:19:18,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:19:18,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:19:18,160 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:18,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:18,207 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-01-09 08:19:18,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:19:18,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 08:19:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:18,217 INFO L225 Difference]: With dead ends: 18 [2025-01-09 08:19:18,217 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 08:19:18,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:18,222 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:18,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:18,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 08:19:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-09 08:19:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 08:19:18,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 08:19:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:18,253 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 08:19:18,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 08:19:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 08:19:18,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:18,254 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 08:19:18,262 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 08:19:18,459 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 [2025-01-09 08:19:18,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:18,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 08:19:18,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:19:18,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593191888] [2025-01-09 08:19:18,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:18,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:18,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:18,463 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 08:19:18,464 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 08:19:18,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 08:19:18,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 08:19:18,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:18,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:19:18,595 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:19:18,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 08:19:18,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 08:19:18,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:18,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:19:18,713 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-09 08:19:18,713 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:19:18,716 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:19:18,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 08:19:18,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:18,922 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 08:19:18,948 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:19:18,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:19:18 BoogieIcfgContainer [2025-01-09 08:19:18,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:19:18,952 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:19:18,953 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:19:18,953 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:19:18,953 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:19:17" (3/4) ... [2025-01-09 08:19:18,954 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 08:19:19,002 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-01-09 08:19:19,044 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 08:19:19,044 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 08:19:19,045 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:19:19,045 INFO L158 Benchmark]: Toolchain (without parser) took 2366.65ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 71.2MB in the end (delta: 20.7MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2025-01-09 08:19:19,046 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 83.9MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:19:19,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.94ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 77.0MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:19:19,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.03ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 74.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:19:19,046 INFO L158 Benchmark]: Boogie Preprocessor took 76.19ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 72.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:19:19,046 INFO L158 Benchmark]: RCFGBuilder took 424.21ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 51.5MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 08:19:19,047 INFO L158 Benchmark]: TraceAbstraction took 1374.00ms. Allocated memory is still 117.4MB. Free memory was 50.5MB in the beginning and 78.6MB in the end (delta: -28.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:19:19,047 INFO L158 Benchmark]: Witness Printer took 92.12ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 71.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:19:19,048 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 83.9MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.94ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 77.0MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.03ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 74.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.19ms. Allocated memory is still 117.4MB. Free memory was 74.6MB in the beginning and 72.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 424.21ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 51.5MB in the end (delta: 20.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1374.00ms. Allocated memory is still 117.4MB. Free memory was 50.5MB in the beginning and 78.6MB in the end (delta: -28.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 92.12ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 71.2MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_29 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_33; [L49] SORT_12 input_35; [L50] SORT_3 input_37; [L51] SORT_3 input_39; [L52] SORT_12 input_97; [L53] SORT_3 input_99; [L54] SORT_1 input_102; [L55] SORT_3 input_104; [L56] SORT_3 input_106; [L57] SORT_3 input_108; [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND FALSE !(!(cond)) [L114] RET __VERIFIER_assert(!(bad_32_arg_0)) [L116] SORT_3 var_41_arg_0 = state_17; [L117] SORT_3 var_41 = ~var_41_arg_0; [L118] SORT_3 var_42_arg_0 = state_15; [L119] SORT_3 var_42 = ~var_42_arg_0; [L120] SORT_3 var_43_arg_0 = var_42; [L121] SORT_3 var_43_arg_1 = state_20; [L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1; [L123] SORT_3 var_44_arg_0 = var_43; [L124] SORT_3 var_44 = ~var_44_arg_0; [L125] SORT_3 var_45_arg_0 = var_41; [L126] SORT_3 var_45_arg_1 = var_44; [L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1; [L128] SORT_3 var_46_arg_0 = var_45; [L129] SORT_3 var_46 = ~var_46_arg_0; [L130] SORT_3 var_47_arg_0 = state_17; [L131] SORT_3 var_47_arg_1 = state_20; [L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1; [L133] SORT_3 var_48_arg_0 = var_42; [L134] SORT_3 var_48_arg_1 = var_47; [L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1; [L136] SORT_3 var_49_arg_0 = var_48; [L137] SORT_3 var_49 = ~var_49_arg_0; [L138] SORT_3 var_50_arg_0 = var_46; [L139] SORT_3 var_50_arg_1 = var_49; [L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1; [L141] SORT_3 next_110_arg_1 = var_50; [L142] SORT_3 var_52_arg_0 = state_20; [L143] SORT_3 var_52 = ~var_52_arg_0; [L144] SORT_3 var_53_arg_0 = state_17; [L145] SORT_3 var_53_arg_1 = var_52; [L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1; [L147] SORT_3 var_54_arg_0 = state_17; [L148] SORT_3 var_54_arg_1 = var_52; [L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1; [L150] SORT_3 var_55_arg_0 = var_54; [L151] SORT_3 var_55 = ~var_55_arg_0; [L152] SORT_3 var_56_arg_0 = var_53; [L153] SORT_3 var_56_arg_1 = var_55; [L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1; [L155] SORT_3 var_57_arg_0 = var_56; [L156] SORT_3 var_57 = ~var_57_arg_0; [L157] SORT_3 next_111_arg_1 = var_57; [L158] SORT_1 var_59_arg_0 = input_2; [L159] SORT_3 var_59 = var_59_arg_0 >> 0; [L160] SORT_1 var_60_arg_0 = input_2; [L161] SORT_3 var_60 = var_60_arg_0 >> 2; [L162] SORT_3 var_61_arg_0 = var_60; [L163] SORT_3 var_61 = ~var_61_arg_0; [L164] SORT_1 var_62_arg_0 = input_2; [L165] SORT_3 var_62 = var_62_arg_0 >> 1; [L166] SORT_3 var_63_arg_0 = var_61; [L167] SORT_3 var_63_arg_1 = var_62; [L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L169] SORT_3 var_64_arg_0 = var_59; [L170] SORT_3 var_64_arg_1 = var_63; [L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1; [L172] SORT_3 var_65_arg_0 = var_64; [L173] SORT_3 var_65 = ~var_65_arg_0; [L174] SORT_3 var_66_arg_0 = state_15; [L175] SORT_3 var_66_arg_1 = state_17; [L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L177] SORT_3 var_67_arg_0 = var_65; [L178] SORT_3 var_67_arg_1 = var_66; [L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1; [L180] SORT_3 var_68_arg_0 = var_67; [L181] SORT_3 var_68_arg_1 = var_52; [L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1; [L183] SORT_3 next_112_arg_1 = var_68; [L184] SORT_3 var_75_arg_0 = state_20; [L185] SORT_3 var_75_arg_1 = var_66; [L186] SORT_3 var_75 = var_75_arg_0 | var_75_arg_1; [L187] SORT_3 var_76_arg_0 = var_75; [L188] SORT_3 var_76 = ~var_76_arg_0; [L189] SORT_3 var_77_arg_0 = var_59; [L190] SORT_3 var_77_arg_1 = var_76; [L191] SORT_3 var_77 = var_77_arg_0 & var_77_arg_1; [L192] SORT_3 var_78_arg_0 = var_77; [L193] SORT_3 var_78 = ~var_78_arg_0; [L194] SORT_3 var_82_arg_0 = var_63; [L195] SORT_3 var_82_arg_1 = var_76; [L196] SORT_3 var_82 = var_82_arg_0 & var_82_arg_1; [L197] SORT_3 var_91_arg_0 = var_82; [L198] SORT_3 var_91 = ~var_91_arg_0; [L199] SORT_3 var_92_arg_0 = var_78; [L200] SORT_3 var_92_arg_1 = var_91; [L201] SORT_3 var_92 = var_92_arg_0 & var_92_arg_1; [L202] SORT_3 var_94_arg_0 = input_4; [L203] SORT_3 var_94_arg_1 = var_92; [L204] SORT_3 var_94 = var_94_arg_0 | var_94_arg_1; [L205] SORT_3 var_95_arg_0 = var_94; [L206] SORT_3 var_95 = ~var_95_arg_0; [L207] SORT_3 next_113_arg_1 = var_95; [L209] state_15 = next_110_arg_1 [L210] state_17 = next_111_arg_1 [L211] state_20 = next_112_arg_1 [L212] state_24 = next_113_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_33 = __VERIFIER_nondet_uchar() [L85] input_35 = __VERIFIER_nondet_uchar() [L86] input_37 = __VERIFIER_nondet_uchar() [L87] input_39 = __VERIFIER_nondet_uchar() [L88] input_97 = __VERIFIER_nondet_uchar() [L89] input_99 = __VERIFIER_nondet_uchar() [L90] input_102 = __VERIFIER_nondet_uchar() [L91] input_104 = __VERIFIER_nondet_uchar() [L92] input_106 = __VERIFIER_nondet_uchar() [L93] input_108 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = var_23; [L105] SORT_3 var_26_arg_1 = state_24; [L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L107] SORT_3 var_30_arg_0 = var_26; [L108] SORT_3 var_30 = ~var_30_arg_0; [L109] SORT_3 var_31_arg_0 = var_29; [L110] SORT_3 var_31_arg_1 = var_30; [L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1; [L112] var_31 = var_31 & mask_SORT_3 [L113] SORT_3 bad_32_arg_0 = var_31; [L114] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 4 mSDtfsCounter, 9 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 4 NumberOfNonLiveVariables, 49 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 08:19:19,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE