./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-51.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2146c04df5c136bc379fc7beb1c85c891efa2bddb075e9da7893b50c36abc716 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:20:09,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:20:09,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:20:09,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:20:09,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:20:09,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:20:09,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:20:09,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:20:09,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:20:09,864 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:20:09,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:20:09,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:20:09,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:20:09,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:20:09,865 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:20:09,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:20:09,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:20:09,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:20:09,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:20:09,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:20:09,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:20:09,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:20:09,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:20:09,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:20:09,869 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:20:09,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:20:09,869 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:20:09,869 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:20:09,869 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:20:09,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:20:09,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:20:09,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:20:09,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:20:09,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:20:09,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:20:09,871 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2146c04df5c136bc379fc7beb1c85c891efa2bddb075e9da7893b50c36abc716 [2025-01-09 09:20:10,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:20:10,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:20:10,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:20:10,194 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:20:10,194 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:20:10,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-51.i [2025-01-09 09:20:11,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b3e3477a/4fd39babb7e34d23b2a6013a74c6d00d/FLAG3f9e62d8c [2025-01-09 09:20:11,824 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:20:11,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-51.i [2025-01-09 09:20:11,834 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b3e3477a/4fd39babb7e34d23b2a6013a74c6d00d/FLAG3f9e62d8c [2025-01-09 09:20:11,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b3e3477a/4fd39babb7e34d23b2a6013a74c6d00d [2025-01-09 09:20:11,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:20:11,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:20:11,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:20:11,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:20:11,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:20:11,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:20:11" (1/1) ... [2025-01-09 09:20:11,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31eff109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:11, skipping insertion in model container [2025-01-09 09:20:11,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:20:11" (1/1) ... [2025-01-09 09:20:11,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:20:12,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-51.i[916,929] [2025-01-09 09:20:12,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:20:12,181 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:20:12,192 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-51.i[916,929] [2025-01-09 09:20:12,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:20:12,272 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:20:12,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12 WrapperNode [2025-01-09 09:20:12,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:20:12,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:20:12,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:20:12,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:20:12,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,336 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 317 [2025-01-09 09:20:12,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:20:12,337 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:20:12,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:20:12,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:20:12,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,372 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 09:20:12,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:20:12,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:20:12,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:20:12,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:20:12,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (1/1) ... [2025-01-09 09:20:12,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:20:12,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:20:12,449 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 09:20:12,457 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 09:20:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:20:12,476 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:20:12,476 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:20:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:20:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:20:12,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:20:12,566 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:20:12,567 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:20:13,136 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 09:20:13,137 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:20:13,147 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:20:13,148 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:20:13,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:20:13 BoogieIcfgContainer [2025-01-09 09:20:13,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:20:13,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:20:13,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:20:13,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:20:13,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:20:11" (1/3) ... [2025-01-09 09:20:13,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6825d3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:20:13, skipping insertion in model container [2025-01-09 09:20:13,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:20:12" (2/3) ... [2025-01-09 09:20:13,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6825d3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:20:13, skipping insertion in model container [2025-01-09 09:20:13,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:20:13" (3/3) ... [2025-01-09 09:20:13,159 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-51.i [2025-01-09 09:20:13,174 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:20:13,177 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-51.i that has 2 procedures, 140 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:20:13,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:20:13,250 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;@3595f5e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:20:13,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:20:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 88 states have internal predecessors, (130), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 09:20:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-09 09:20:13,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:13,301 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:13,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:13,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1093929012, now seen corresponding path program 1 times [2025-01-09 09:20:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:13,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752502552] [2025-01-09 09:20:13,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:13,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:13,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-09 09:20:13,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-09 09:20:13,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:13,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-01-09 09:20:13,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:13,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752502552] [2025-01-09 09:20:13,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752502552] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:20:13,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523363492] [2025-01-09 09:20:13,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:20:13,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:20:13,810 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 09:20:13,812 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 09:20:13,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-09 09:20:14,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-09 09:20:14,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:14,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:14,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:20:14,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:20:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-01-09 09:20:14,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:20:14,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523363492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:14,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:20:14,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:20:14,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496359204] [2025-01-09 09:20:14,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:14,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:20:14,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:14,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:20:14,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:20:14,174 INFO L87 Difference]: Start difference. First operand has 140 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 88 states have internal predecessors, (130), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 09:20:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:14,220 INFO L93 Difference]: Finished difference Result 274 states and 505 transitions. [2025-01-09 09:20:14,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:20:14,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 311 [2025-01-09 09:20:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:14,231 INFO L225 Difference]: With dead ends: 274 [2025-01-09 09:20:14,232 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 09:20:14,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:20:14,273 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:14,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:20:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 09:20:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-01-09 09:20:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 85 states have internal predecessors, (124), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 09:20:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 224 transitions. [2025-01-09 09:20:14,331 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 224 transitions. Word has length 311 [2025-01-09 09:20:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:14,331 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 224 transitions. [2025-01-09 09:20:14,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 09:20:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 224 transitions. [2025-01-09 09:20:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-09 09:20:14,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:14,343 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:14,352 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 09:20:14,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 09:20:14,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:14,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1543433680, now seen corresponding path program 1 times [2025-01-09 09:20:14,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:14,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168916429] [2025-01-09 09:20:14,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:14,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:14,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-09 09:20:14,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-09 09:20:14,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:14,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 09:20:14,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:14,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168916429] [2025-01-09 09:20:14,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168916429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:14,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:14,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:20:14,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478387521] [2025-01-09 09:20:14,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:14,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:20:14,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:14,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:20:14,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:20:14,903 INFO L87 Difference]: Start difference. First operand 137 states and 224 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 09:20:14,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:14,987 INFO L93 Difference]: Finished difference Result 384 states and 630 transitions. [2025-01-09 09:20:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:20:14,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 311 [2025-01-09 09:20:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:14,994 INFO L225 Difference]: With dead ends: 384 [2025-01-09 09:20:14,994 INFO L226 Difference]: Without dead ends: 250 [2025-01-09 09:20:14,995 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 09:20:14,997 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 179 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:14,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 431 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:20:14,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-09 09:20:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2025-01-09 09:20:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 156 states have (on average 1.4615384615384615) internal successors, (228), 157 states have internal predecessors, (228), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 09:20:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 404 transitions. [2025-01-09 09:20:15,051 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 404 transitions. Word has length 311 [2025-01-09 09:20:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:15,054 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 404 transitions. [2025-01-09 09:20:15,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 09:20:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 404 transitions. [2025-01-09 09:20:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-09 09:20:15,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:15,075 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:15,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:20:15,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:15,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash 946095282, now seen corresponding path program 1 times [2025-01-09 09:20:15,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:15,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821331024] [2025-01-09 09:20:15,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:15,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:15,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-09 09:20:15,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-09 09:20:15,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:15,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:15,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 09:20:15,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:15,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821331024] [2025-01-09 09:20:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821331024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:15,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:15,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:20:15,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340838386] [2025-01-09 09:20:15,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:15,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:20:15,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:15,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:20:15,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:20:15,699 INFO L87 Difference]: Start difference. First operand 247 states and 404 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 09:20:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:16,050 INFO L93 Difference]: Finished difference Result 677 states and 1110 transitions. [2025-01-09 09:20:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:20:16,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 311 [2025-01-09 09:20:16,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:16,058 INFO L225 Difference]: With dead ends: 677 [2025-01-09 09:20:16,058 INFO L226 Difference]: Without dead ends: 433 [2025-01-09 09:20:16,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 09:20:16,060 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 182 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:16,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 648 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:20:16,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-01-09 09:20:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 393. [2025-01-09 09:20:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 250 states have (on average 1.472) internal successors, (368), 251 states have internal predecessors, (368), 138 states have call successors, (138), 4 states have call predecessors, (138), 4 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2025-01-09 09:20:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 644 transitions. [2025-01-09 09:20:16,142 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 644 transitions. Word has length 311 [2025-01-09 09:20:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:16,143 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 644 transitions. [2025-01-09 09:20:16,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 09:20:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 644 transitions. [2025-01-09 09:20:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-09 09:20:16,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:16,148 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:16,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:20:16,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:16,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1225713684, now seen corresponding path program 1 times [2025-01-09 09:20:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:16,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226530892] [2025-01-09 09:20:16,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:16,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-09 09:20:16,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-09 09:20:16,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:16,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 09:20:16,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:16,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226530892] [2025-01-09 09:20:16,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226530892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:16,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:16,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:20:16,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884778368] [2025-01-09 09:20:16,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:16,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:20:16,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:16,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:20:16,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:20:16,772 INFO L87 Difference]: Start difference. First operand 393 states and 644 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 09:20:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:17,265 INFO L93 Difference]: Finished difference Result 893 states and 1459 transitions. [2025-01-09 09:20:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:20:17,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 312 [2025-01-09 09:20:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:17,272 INFO L225 Difference]: With dead ends: 893 [2025-01-09 09:20:17,272 INFO L226 Difference]: Without dead ends: 649 [2025-01-09 09:20:17,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:20:17,276 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 193 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:17,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 776 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:20:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-01-09 09:20:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 635. [2025-01-09 09:20:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 402 states have (on average 1.4676616915422886) internal successors, (590), 404 states have internal predecessors, (590), 226 states have call successors, (226), 6 states have call predecessors, (226), 6 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-01-09 09:20:17,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1042 transitions. [2025-01-09 09:20:17,417 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1042 transitions. Word has length 312 [2025-01-09 09:20:17,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:17,418 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 1042 transitions. [2025-01-09 09:20:17,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 09:20:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1042 transitions. [2025-01-09 09:20:17,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-01-09 09:20:17,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:17,423 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:17,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:20:17,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:17,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:17,424 INFO L85 PathProgramCache]: Analyzing trace with hash 983761739, now seen corresponding path program 1 times [2025-01-09 09:20:17,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:17,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052526325] [2025-01-09 09:20:17,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:17,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:17,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-09 09:20:17,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-09 09:20:17,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:17,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 09:20:17,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:17,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052526325] [2025-01-09 09:20:17,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052526325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:17,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:20:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712406735] [2025-01-09 09:20:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:17,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:20:17,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:17,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:20:17,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:20:17,797 INFO L87 Difference]: Start difference. First operand 635 states and 1042 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 09:20:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:18,187 INFO L93 Difference]: Finished difference Result 1607 states and 2640 transitions. [2025-01-09 09:20:18,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:20:18,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 313 [2025-01-09 09:20:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:18,197 INFO L225 Difference]: With dead ends: 1607 [2025-01-09 09:20:18,197 INFO L226 Difference]: Without dead ends: 1121 [2025-01-09 09:20:18,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 09:20:18,204 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 188 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:18,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 631 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:20:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-01-09 09:20:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1119. [2025-01-09 09:20:18,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 706 states have (on average 1.461756373937677) internal successors, (1032), 710 states have internal predecessors, (1032), 402 states have call successors, (402), 10 states have call predecessors, (402), 10 states have return successors, (402), 398 states have call predecessors, (402), 402 states have call successors, (402) [2025-01-09 09:20:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1836 transitions. [2025-01-09 09:20:18,441 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1836 transitions. Word has length 313 [2025-01-09 09:20:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:18,442 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1836 transitions. [2025-01-09 09:20:18,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 09:20:18,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1836 transitions. [2025-01-09 09:20:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-01-09 09:20:18,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:18,447 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:18,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:20:18,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:18,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash 590734729, now seen corresponding path program 1 times [2025-01-09 09:20:18,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:18,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705159576] [2025-01-09 09:20:18,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:18,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:18,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-01-09 09:20:18,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-01-09 09:20:18,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:18,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 09:20:18,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:18,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705159576] [2025-01-09 09:20:18,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705159576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:20:18,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:20:18,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:20:18,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942278970] [2025-01-09 09:20:18,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:20:18,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:20:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:18,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:20:18,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:20:18,759 INFO L87 Difference]: Start difference. First operand 1119 states and 1836 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 09:20:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:18,903 INFO L93 Difference]: Finished difference Result 2109 states and 3463 transitions. [2025-01-09 09:20:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:20:18,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 313 [2025-01-09 09:20:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:18,916 INFO L225 Difference]: With dead ends: 2109 [2025-01-09 09:20:18,916 INFO L226 Difference]: Without dead ends: 1139 [2025-01-09 09:20:18,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 09:20:18,923 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 17 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:18,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 451 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:20:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2025-01-09 09:20:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1119. [2025-01-09 09:20:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 706 states have (on average 1.4504249291784703) internal successors, (1024), 710 states have internal predecessors, (1024), 402 states have call successors, (402), 10 states have call predecessors, (402), 10 states have return successors, (402), 398 states have call predecessors, (402), 402 states have call successors, (402) [2025-01-09 09:20:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1828 transitions. [2025-01-09 09:20:19,109 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1828 transitions. Word has length 313 [2025-01-09 09:20:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:19,111 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1828 transitions. [2025-01-09 09:20:19,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 09:20:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1828 transitions. [2025-01-09 09:20:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-01-09 09:20:19,117 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:19,117 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:19,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:20:19,118 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:19,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:19,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1052462743, now seen corresponding path program 1 times [2025-01-09 09:20:19,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:19,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595831513] [2025-01-09 09:20:19,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:19,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:19,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-09 09:20:19,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-09 09:20:19,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:19,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 24 proven. 123 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 09:20:19,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:19,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595831513] [2025-01-09 09:20:19,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595831513] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:20:19,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978210579] [2025-01-09 09:20:19,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:19,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:20:19,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:20:19,544 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 09:20:19,546 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 09:20:19,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-09 09:20:19,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-09 09:20:19,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:19,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:19,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:20:19,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:20:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1377 proven. 123 refuted. 0 times theorem prover too weak. 3400 trivial. 0 not checked. [2025-01-09 09:20:20,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:20:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 24 proven. 123 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 09:20:20,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978210579] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:20:20,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:20:20,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 09:20:20,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011636531] [2025-01-09 09:20:20,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:20:20,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 09:20:20,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:20,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 09:20:20,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 09:20:20,624 INFO L87 Difference]: Start difference. First operand 1119 states and 1828 transitions. Second operand has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 3 states have call successors, (132), 2 states have call predecessors, (132), 4 states have return successors, (133), 3 states have call predecessors, (133), 3 states have call successors, (133) [2025-01-09 09:20:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:21,100 INFO L93 Difference]: Finished difference Result 1661 states and 2670 transitions. [2025-01-09 09:20:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 09:20:21,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 3 states have call successors, (132), 2 states have call predecessors, (132), 4 states have return successors, (133), 3 states have call predecessors, (133), 3 states have call successors, (133) Word has length 314 [2025-01-09 09:20:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:21,111 INFO L225 Difference]: With dead ends: 1661 [2025-01-09 09:20:21,111 INFO L226 Difference]: Without dead ends: 1175 [2025-01-09 09:20:21,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:20:21,115 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 228 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:21,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 393 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:20:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-01-09 09:20:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 655. [2025-01-09 09:20:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 417 states have (on average 1.4316546762589928) internal successors, (597), 419 states have internal predecessors, (597), 226 states have call successors, (226), 11 states have call predecessors, (226), 11 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-01-09 09:20:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1049 transitions. [2025-01-09 09:20:21,271 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1049 transitions. Word has length 314 [2025-01-09 09:20:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:21,272 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 1049 transitions. [2025-01-09 09:20:21,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 8 states have internal predecessors, (121), 3 states have call successors, (132), 2 states have call predecessors, (132), 4 states have return successors, (133), 3 states have call predecessors, (133), 3 states have call successors, (133) [2025-01-09 09:20:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1049 transitions. [2025-01-09 09:20:21,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-01-09 09:20:21,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:21,277 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:21,287 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 09:20:21,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:20:21,479 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:21,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1445489753, now seen corresponding path program 1 times [2025-01-09 09:20:21,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:21,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693871258] [2025-01-09 09:20:21,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:21,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-09 09:20:21,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-09 09:20:21,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:21,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 54 proven. 93 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 09:20:22,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:20:22,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693871258] [2025-01-09 09:20:22,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693871258] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:20:22,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169053027] [2025-01-09 09:20:22,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:22,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:20:22,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:20:22,079 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 09:20:22,082 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 09:20:22,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-01-09 09:20:22,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-01-09 09:20:22,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:22,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:22,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 09:20:22,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:20:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2317 proven. 93 refuted. 0 times theorem prover too weak. 2490 trivial. 0 not checked. [2025-01-09 09:20:22,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:20:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 54 proven. 93 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 09:20:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169053027] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:20:23,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:20:23,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-09 09:20:23,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153316642] [2025-01-09 09:20:23,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:20:23,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:20:23,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:20:23,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:20:23,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:20:23,257 INFO L87 Difference]: Start difference. First operand 655 states and 1049 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 2 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:20:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:20:24,735 INFO L93 Difference]: Finished difference Result 1419 states and 2187 transitions. [2025-01-09 09:20:24,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 09:20:24,736 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 2 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 314 [2025-01-09 09:20:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:20:24,746 INFO L225 Difference]: With dead ends: 1419 [2025-01-09 09:20:24,746 INFO L226 Difference]: Without dead ends: 1167 [2025-01-09 09:20:24,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 623 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2025-01-09 09:20:24,749 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 330 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:20:24,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1644 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 09:20:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2025-01-09 09:20:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 847. [2025-01-09 09:20:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 528 states have (on average 1.3484848484848484) internal successors, (712), 534 states have internal predecessors, (712), 294 states have call successors, (294), 24 states have call predecessors, (294), 24 states have return successors, (294), 288 states have call predecessors, (294), 294 states have call successors, (294) [2025-01-09 09:20:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1300 transitions. [2025-01-09 09:20:24,887 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1300 transitions. Word has length 314 [2025-01-09 09:20:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:20:24,888 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1300 transitions. [2025-01-09 09:20:24,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 2 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:20:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1300 transitions. [2025-01-09 09:20:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-01-09 09:20:24,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:20:24,905 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:20:24,916 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 09:20:25,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:20:25,106 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:20:25,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:20:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1805160322, now seen corresponding path program 1 times [2025-01-09 09:20:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:20:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374656486] [2025-01-09 09:20:25,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:25,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:20:25,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 09:20:25,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 09:20:25,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:25,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:20:25,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574425969] [2025-01-09 09:20:25,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:20:25,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:20:25,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:20:25,277 INFO L229 MonitoredProcess]: Starting monitored process 5 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 09:20:25,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 09:20:25,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-01-09 09:20:25,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-01-09 09:20:25,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:20:25,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:20:25,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 09:20:25,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:20:43,252 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_34~0 256))) (and (<= 0 (+ c_~var_1_26~0 128)) (or (and (= c_~var_1_33~0 .cse0) (<= 1 .cse0)) (and (<= c_~var_1_33~0 254) (<= .cse0 c_~var_1_33~0))) (<= .cse0 254) (let ((.cse2 (+ c_~var_1_29~0 1))) (let ((.cse6 (<= (+ c_~var_1_26~0 1) 0)) (.cse4 (<= .cse2 0)) (.cse1 (<= 0 c_~var_1_26~0))) (or (and .cse1 (exists ((~var_1_27~0 Int) (~var_1_28~0 Int)) (and (not (= ~var_1_27~0 0)) (<= ~var_1_27~0 ~var_1_28~0) (<= .cse2 (mod c_~var_1_26~0 ~var_1_28~0)) (not (= ~var_1_28~0 0)) (= (mod c_~var_1_26~0 ~var_1_27~0) 0)))) (and (or (exists ((~var_1_28~0 Int)) (and (= (mod c_~var_1_26~0 ~var_1_28~0) 0) (not (= ~var_1_28~0 0)) (exists ((~var_1_27~0 Int)) (let ((.cse3 (mod c_~var_1_26~0 ~var_1_27~0))) (and (not (= ~var_1_27~0 0)) (<= (+ c_~var_1_29~0 ~var_1_27~0 1) .cse3) (<= (+ ~var_1_28~0 1) ~var_1_27~0) (<= 0 ~var_1_27~0) (not (= .cse3 0))))))) (and .cse4 (exists ((~var_1_27~0 Int) (~var_1_28~0 Int)) (and (not (= ~var_1_27~0 0)) (= (mod c_~var_1_26~0 ~var_1_28~0) 0) (<= ~var_1_27~0 ~var_1_28~0) (not (= ~var_1_28~0 0)) (not (= (mod c_~var_1_26~0 ~var_1_27~0) 0))))) (exists ((~var_1_28~0 Int)) (and (= (mod c_~var_1_26~0 ~var_1_28~0) 0) (exists ((~var_1_27~0 Int)) (let ((.cse5 (mod c_~var_1_26~0 ~var_1_27~0))) (and (<= (+ ~var_1_28~0 1) ~var_1_27~0) (<= (+ ~var_1_27~0 1) 0) (<= .cse2 (+ .cse5 ~var_1_27~0)) (not (= .cse5 0)))))))) .cse6) (and .cse4 (exists ((~var_1_27~0 Int) (~var_1_28~0 Int)) (and (not (= ~var_1_27~0 0)) (= (mod c_~var_1_26~0 ~var_1_28~0) 0) (<= ~var_1_27~0 ~var_1_28~0) (not (= ~var_1_28~0 0)) (= (mod c_~var_1_26~0 ~var_1_27~0) 0)))) (and .cse6 (or (exists ((~var_1_28~0 Int)) (and (exists ((~var_1_27~0 Int)) (let ((.cse7 (mod c_~var_1_26~0 ~var_1_27~0))) (and (<= (+ ~var_1_28~0 1) ~var_1_27~0) (<= (+ ~var_1_27~0 1) 0) (<= .cse2 (+ .cse7 ~var_1_27~0)) (not (= .cse7 0))))) (not (= (mod c_~var_1_26~0 ~var_1_28~0) 0)))) (exists ((~var_1_27~0 Int)) (and (not (= ~var_1_27~0 0)) (exists ((~var_1_28~0 Int)) (let ((.cse8 (mod c_~var_1_26~0 ~var_1_28~0))) (and (<= ~var_1_27~0 ~var_1_28~0) (<= 0 ~var_1_28~0) (not (= ~var_1_28~0 0)) (not (= .cse8 0)) (<= (+ c_~var_1_29~0 ~var_1_28~0 1) .cse8)))) (not (= (mod c_~var_1_26~0 ~var_1_27~0) 0)))) (exists ((~var_1_28~0 Int)) (and (not (= ~var_1_28~0 0)) (not (= (mod c_~var_1_26~0 ~var_1_28~0) 0)) (exists ((~var_1_27~0 Int)) (let ((.cse9 (mod c_~var_1_26~0 ~var_1_27~0))) (and (not (= ~var_1_27~0 0)) (<= (+ c_~var_1_29~0 ~var_1_27~0 1) .cse9) (<= (+ ~var_1_28~0 1) ~var_1_27~0) (<= 0 ~var_1_27~0) (not (= .cse9 0))))))) (exists ((~var_1_27~0 Int)) (and (not (= ~var_1_27~0 0)) (exists ((~var_1_28~0 Int)) (let ((.cse10 (mod c_~var_1_26~0 ~var_1_28~0))) (and (<= ~var_1_27~0 ~var_1_28~0) (<= 0 ~var_1_28~0) (not (= ~var_1_28~0 0)) (not (= .cse10 0)) (<= (+ c_~var_1_29~0 ~var_1_28~0 1) .cse10)))) (= (mod c_~var_1_26~0 ~var_1_27~0) 0))) (exists ((~var_1_27~0 Int)) (and (exists ((~var_1_28~0 Int)) (let ((.cse11 (mod c_~var_1_26~0 ~var_1_28~0))) (and (<= ~var_1_27~0 ~var_1_28~0) (not (= .cse11 0)) (<= .cse2 (+ .cse11 ~var_1_28~0)) (<= (+ ~var_1_28~0 1) 0)))) (not (= (mod c_~var_1_26~0 ~var_1_27~0) 0)))) (exists ((~var_1_27~0 Int)) (and (exists ((~var_1_28~0 Int)) (let ((.cse12 (mod c_~var_1_26~0 ~var_1_28~0))) (and (<= ~var_1_27~0 ~var_1_28~0) (not (= .cse12 0)) (<= .cse2 (+ .cse12 ~var_1_28~0)) (<= (+ ~var_1_28~0 1) 0)))) (= (mod c_~var_1_26~0 ~var_1_27~0) 0))) (and .cse4 (exists ((~var_1_27~0 Int) (~var_1_28~0 Int)) (and (= (mod c_~var_1_26~0 ~var_1_27~0) 0) (not (= (mod c_~var_1_26~0 ~var_1_28~0) 0)) (<= (+ ~var_1_28~0 1) ~var_1_27~0) (<= (+ ~var_1_27~0 1) 0)))) (and .cse4 (exists ((~var_1_27~0 Int) (~var_1_28~0 Int)) (and (not (= ~var_1_27~0 0)) (not (= ~var_1_28~0 0)) (= (mod c_~var_1_26~0 ~var_1_27~0) 0) (not (= (mod c_~var_1_26~0 ~var_1_28~0) 0)) (<= (+ ~var_1_28~0 1) ~var_1_27~0) (<= 0 ~var_1_27~0)))))) (and (exists ((~var_1_28~0 Int)) (and (<= .cse2 (mod c_~var_1_26~0 ~var_1_28~0)) (not (= ~var_1_28~0 0)))) .cse1) (and .cse4 (or (exists ((~var_1_27~0 Int)) (and (= (mod c_~var_1_26~0 ~var_1_27~0) 0) (exists ((~var_1_28~0 Int)) (and (= (mod c_~var_1_26~0 ~var_1_28~0) 0) (<= (+ ~var_1_28~0 1) ~var_1_27~0))) (<= (+ ~var_1_27~0 1) 0))) (and .cse1 (exists ((~var_1_27~0 Int)) (and (= (mod c_~var_1_26~0 ~var_1_27~0) 0) (<= (+ ~var_1_27~0 1) 0)))))) (and .cse1 (or (exists ((~var_1_27~0 Int)) (and (<= .cse2 (mod c_~var_1_26~0 ~var_1_27~0)) (not (= ~var_1_27~0 0)) (<= 0 ~var_1_27~0))) (exists ((~var_1_27~0 Int)) (and (<= .cse2 (mod c_~var_1_26~0 ~var_1_27~0)) (<= (+ ~var_1_27~0 1) 0))))) (and .cse4 (or (exists ((~var_1_27~0 Int)) (and (not (= ~var_1_27~0 0)) (exists ((~var_1_28~0 Int)) (and (= (mod c_~var_1_26~0 ~var_1_28~0) 0) (not (= ~var_1_28~0 0)) (<= (+ ~var_1_28~0 1) ~var_1_27~0))) (= (mod c_~var_1_26~0 ~var_1_27~0) 0) (<= 0 ~var_1_27~0))) (and .cse1 (exists ((~var_1_27~0 Int)) (and (not (= ~var_1_27~0 0)) (= (mod c_~var_1_26~0 ~var_1_27~0) 0) (<= 0 ~var_1_27~0))))))))))) is different from true