./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_fillercodestructure_filler-pe-ci_file-32.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 bc5779ebdfe5c74a3db41d9bf7ba8251563c3c8378a523b151aca96b4ca86800 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:18:47,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:18:47,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:18:47,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:18:47,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:18:47,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:18:47,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:18:47,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:18:47,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:18:47,437 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:18:47,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:18:47,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:18:47,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:18:47,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:18:47,438 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:18:47,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:18:47,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:18:47,438 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:18:47,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:18:47,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:18:47,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:18:47,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:18:47,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:18:47,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:18:47,439 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:18:47,439 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:18:47,439 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:18:47,439 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:18:47,439 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:18:47,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:18:47,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:18:47,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:18:47,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:18:47,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:18:47,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:18:47,440 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:18:47,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:18:47,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:18:47,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:18:47,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:18:47,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:18:47,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:18:47,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:18:47,441 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 -> bc5779ebdfe5c74a3db41d9bf7ba8251563c3c8378a523b151aca96b4ca86800 [2025-02-05 22:18:47,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:18:47,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:18:47,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:18:47,647 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:18:47,647 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:18:47,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i [2025-02-05 22:18:48,713 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5679196fa/7a99eb9b52524a23972132b11f47512d/FLAGc3e54e687 [2025-02-05 22:18:48,940 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:18:48,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i [2025-02-05 22:18:48,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5679196fa/7a99eb9b52524a23972132b11f47512d/FLAGc3e54e687 [2025-02-05 22:18:49,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5679196fa/7a99eb9b52524a23972132b11f47512d [2025-02-05 22:18:49,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:18:49,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:18:49,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:18:49,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:18:49,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:18:49,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49, skipping insertion in model container [2025-02-05 22:18:49,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:18:49,413 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_fillercodestructure_filler-pe-ci_file-32.i[919,932] [2025-02-05 22:18:49,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:18:49,489 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:18:49,496 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_fillercodestructure_filler-pe-ci_file-32.i[919,932] [2025-02-05 22:18:49,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:18:49,542 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:18:49,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49 WrapperNode [2025-02-05 22:18:49,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:18:49,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:18:49,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:18:49,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:18:49,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,593 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 234 [2025-02-05 22:18:49,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:18:49,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:18:49,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:18:49,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:18:49,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,622 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-02-05 22:18:49,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,632 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:18:49,643 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:18:49,644 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:18:49,644 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:18:49,644 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (1/1) ... [2025-02-05 22:18:49,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:18:49,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:18:49,667 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-02-05 22:18:49,669 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-02-05 22:18:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:18:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:18:49,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:18:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:18:49,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:18:49,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:18:49,743 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:18:49,744 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:18:50,068 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-05 22:18:50,069 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:18:50,082 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:18:50,082 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:18:50,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:50 BoogieIcfgContainer [2025-02-05 22:18:50,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:18:50,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:18:50,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:18:50,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:18:50,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:18:49" (1/3) ... [2025-02-05 22:18:50,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446d6379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:18:50, skipping insertion in model container [2025-02-05 22:18:50,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:49" (2/3) ... [2025-02-05 22:18:50,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446d6379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:18:50, skipping insertion in model container [2025-02-05 22:18:50,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:50" (3/3) ... [2025-02-05 22:18:50,092 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i [2025-02-05 22:18:50,102 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:18:50,104 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:18:50,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:18:50,157 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;@43652128, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:18:50,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:18:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 73 states have internal predecessors, (111), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 22:18:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 22:18:50,173 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:50,174 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:18:50,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:50,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1007358182, now seen corresponding path program 1 times [2025-02-05 22:18:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:50,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083832427] [2025-02-05 22:18:50,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:50,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:50,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 22:18:50,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 22:18:50,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:50,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:50,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 22:18:50,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:50,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083832427] [2025-02-05 22:18:50,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083832427] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:18:50,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190392572] [2025-02-05 22:18:50,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:50,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:50,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:18:50,420 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-02-05 22:18:50,421 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-02-05 22:18:50,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 22:18:50,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 22:18:50,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:50,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:50,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:18:50,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 22:18:50,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:18:50,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190392572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:18:50,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:18:50,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:18:50,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061663394] [2025-02-05 22:18:50,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:18:50,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:18:50,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:50,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:18:50,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:18:50,597 INFO L87 Difference]: Start difference. First operand has 98 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 73 states have internal predecessors, (111), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 22:18:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:50,625 INFO L93 Difference]: Finished difference Result 190 states and 332 transitions. [2025-02-05 22:18:50,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:18:50,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2025-02-05 22:18:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:50,631 INFO L225 Difference]: With dead ends: 190 [2025-02-05 22:18:50,631 INFO L226 Difference]: Without dead ends: 95 [2025-02-05 22:18:50,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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-02-05 22:18:50,635 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:50,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:18:50,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-05 22:18:50,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-02-05 22:18:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.5) internal successors, (105), 70 states have internal predecessors, (105), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 22:18:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 151 transitions. [2025-02-05 22:18:50,669 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 151 transitions. Word has length 156 [2025-02-05 22:18:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:50,670 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 151 transitions. [2025-02-05 22:18:50,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 22:18:50,670 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 151 transitions. [2025-02-05 22:18:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 22:18:50,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:50,673 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:18:50,681 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-02-05 22:18:50,879 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-02-05 22:18:50,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:50,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1301301001, now seen corresponding path program 1 times [2025-02-05 22:18:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:50,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064106589] [2025-02-05 22:18:50,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:50,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 22:18:50,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 22:18:50,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:50,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:18:51,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:51,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064106589] [2025-02-05 22:18:51,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064106589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:18:51,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:18:51,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:18:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271465034] [2025-02-05 22:18:51,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:18:51,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:18:51,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:51,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:18:51,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:18:51,101 INFO L87 Difference]: Start difference. First operand 95 states and 151 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:18:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:51,218 INFO L93 Difference]: Finished difference Result 279 states and 447 transitions. [2025-02-05 22:18:51,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:18:51,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2025-02-05 22:18:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:51,224 INFO L225 Difference]: With dead ends: 279 [2025-02-05 22:18:51,225 INFO L226 Difference]: Without dead ends: 187 [2025-02-05 22:18:51,226 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-02-05 22:18:51,226 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 99 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:51,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 239 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:18:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-05 22:18:51,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2025-02-05 22:18:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 135 states have (on average 1.4814814814814814) internal successors, (200), 135 states have internal predecessors, (200), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-02-05 22:18:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 292 transitions. [2025-02-05 22:18:51,255 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 292 transitions. Word has length 156 [2025-02-05 22:18:51,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:51,256 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 292 transitions. [2025-02-05 22:18:51,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:18:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 292 transitions. [2025-02-05 22:18:51,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 22:18:51,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:51,258 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:18:51,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:18:51,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:51,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:51,259 INFO L85 PathProgramCache]: Analyzing trace with hash -549677798, now seen corresponding path program 1 times [2025-02-05 22:18:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:51,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671814728] [2025-02-05 22:18:51,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:51,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 22:18:51,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 22:18:51,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:51,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:18:51,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671814728] [2025-02-05 22:18:51,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671814728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:18:51,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:18:51,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:18:51,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068335934] [2025-02-05 22:18:51,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:18:51,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:18:51,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:51,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:18:51,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:18:51,434 INFO L87 Difference]: Start difference. First operand 184 states and 292 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:18:51,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:51,647 INFO L93 Difference]: Finished difference Result 550 states and 878 transitions. [2025-02-05 22:18:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:18:51,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 157 [2025-02-05 22:18:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:51,651 INFO L225 Difference]: With dead ends: 550 [2025-02-05 22:18:51,651 INFO L226 Difference]: Without dead ends: 369 [2025-02-05 22:18:51,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:18:51,653 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 146 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:51,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 376 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:18:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-02-05 22:18:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2025-02-05 22:18:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 269 states have (on average 1.479553903345725) internal successors, (398), 269 states have internal predecessors, (398), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-02-05 22:18:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2025-02-05 22:18:51,688 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 582 transitions. Word has length 157 [2025-02-05 22:18:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:51,689 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 582 transitions. [2025-02-05 22:18:51,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:18:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 582 transitions. [2025-02-05 22:18:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 22:18:51,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:51,691 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:18:51,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:18:51,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:51,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:51,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1535729800, now seen corresponding path program 1 times [2025-02-05 22:18:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:51,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847571411] [2025-02-05 22:18:51,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:51,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 22:18:51,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 22:18:51,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:51,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:18:52,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:52,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847571411] [2025-02-05 22:18:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847571411] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:18:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78815828] [2025-02-05 22:18:52,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:52,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:52,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:18:52,192 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-02-05 22:18:52,193 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-02-05 22:18:52,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 22:18:52,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 22:18:52,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:52,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:52,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:18:52,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-05 22:18:52,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:18:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:18:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78815828] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:18:52,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:18:52,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2025-02-05 22:18:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258327612] [2025-02-05 22:18:52,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:18:52,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 22:18:52,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:52,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 22:18:52,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:18:52,645 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 5 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2025-02-05 22:18:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:18:54,062 INFO L93 Difference]: Finished difference Result 1540 states and 2360 transitions. [2025-02-05 22:18:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-05 22:18:54,063 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 5 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 157 [2025-02-05 22:18:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:18:54,068 INFO L225 Difference]: With dead ends: 1540 [2025-02-05 22:18:54,069 INFO L226 Difference]: Without dead ends: 1156 [2025-02-05 22:18:54,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=419, Invalid=1561, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 22:18:54,071 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 978 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:18:54,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1052 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 22:18:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-02-05 22:18:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 971. [2025-02-05 22:18:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 773 states have (on average 1.4437257438551099) internal successors, (1116), 782 states have internal predecessors, (1116), 172 states have call successors, (172), 25 states have call predecessors, (172), 25 states have return successors, (172), 163 states have call predecessors, (172), 172 states have call successors, (172) [2025-02-05 22:18:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1460 transitions. [2025-02-05 22:18:54,153 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1460 transitions. Word has length 157 [2025-02-05 22:18:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:18:54,154 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1460 transitions. [2025-02-05 22:18:54,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 5 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2025-02-05 22:18:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1460 transitions. [2025-02-05 22:18:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 22:18:54,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:18:54,157 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:18:54,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 22:18:54,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:54,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:18:54,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:18:54,358 INFO L85 PathProgramCache]: Analyzing trace with hash -809299486, now seen corresponding path program 1 times [2025-02-05 22:18:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:18:54,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841308016] [2025-02-05 22:18:54,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:54,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:18:54,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 22:18:54,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 22:18:54,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:54,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 123 proven. 57 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2025-02-05 22:18:55,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:18:55,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841308016] [2025-02-05 22:18:55,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841308016] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:18:55,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241891529] [2025-02-05 22:18:55,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:18:55,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:18:55,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:18:55,220 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-02-05 22:18:55,222 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-02-05 22:18:55,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 22:18:55,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 22:18:55,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:18:55,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:18:55,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 22:18:55,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:18:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 687 proven. 57 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-05 22:18:57,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:18:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 123 proven. 66 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2025-02-05 22:18:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241891529] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:18:58,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:18:58,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 37 [2025-02-05 22:18:58,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600869065] [2025-02-05 22:18:58,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:18:58,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-05 22:18:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:18:58,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-05 22:18:58,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 22:18:58,114 INFO L87 Difference]: Start difference. First operand 971 states and 1460 transitions. Second operand has 37 states, 34 states have (on average 4.411764705882353) internal successors, (150), 34 states have internal predecessors, (150), 13 states have call successors, (69), 5 states have call predecessors, (69), 11 states have return successors, (69), 12 states have call predecessors, (69), 13 states have call successors, (69) [2025-02-05 22:19:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:03,461 INFO L93 Difference]: Finished difference Result 3453 states and 5180 transitions. [2025-02-05 22:19:03,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-02-05 22:19:03,462 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 4.411764705882353) internal successors, (150), 34 states have internal predecessors, (150), 13 states have call successors, (69), 5 states have call predecessors, (69), 11 states have return successors, (69), 12 states have call predecessors, (69), 13 states have call successors, (69) Word has length 158 [2025-02-05 22:19:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:03,474 INFO L225 Difference]: With dead ends: 3453 [2025-02-05 22:19:03,474 INFO L226 Difference]: Without dead ends: 2512 [2025-02-05 22:19:03,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3847 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2300, Invalid=9256, Unknown=0, NotChecked=0, Total=11556 [2025-02-05 22:19:03,482 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 3350 mSDsluCounter, 2290 mSDsCounter, 0 mSdLazyCounter, 4228 mSolverCounterSat, 1021 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3398 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 5249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1021 IncrementalHoareTripleChecker+Valid, 4228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:03,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3398 Valid, 2463 Invalid, 5249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1021 Valid, 4228 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 22:19:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2025-02-05 22:19:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 1402. [2025-02-05 22:19:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1117 states have (on average 1.4521038495971352) internal successors, (1622), 1130 states have internal predecessors, (1622), 238 states have call successors, (238), 46 states have call predecessors, (238), 46 states have return successors, (238), 225 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-05 22:19:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2098 transitions. [2025-02-05 22:19:03,595 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2098 transitions. Word has length 158 [2025-02-05 22:19:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:03,595 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 2098 transitions. [2025-02-05 22:19:03,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 4.411764705882353) internal successors, (150), 34 states have internal predecessors, (150), 13 states have call successors, (69), 5 states have call predecessors, (69), 11 states have return successors, (69), 12 states have call predecessors, (69), 13 states have call successors, (69) [2025-02-05 22:19:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2098 transitions. [2025-02-05 22:19:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 22:19:03,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:03,598 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:03,604 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-02-05 22:19:03,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:19:03,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:03,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:03,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1414437551, now seen corresponding path program 1 times [2025-02-05 22:19:03,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:03,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63003646] [2025-02-05 22:19:03,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:03,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:03,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 22:19:03,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 22:19:03,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:03,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:19:03,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:03,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63003646] [2025-02-05 22:19:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63003646] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:03,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:03,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:19:03,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547726789] [2025-02-05 22:19:03,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:03,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:19:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:03,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:19:03,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:19:03,933 INFO L87 Difference]: Start difference. First operand 1402 states and 2098 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:04,280 INFO L93 Difference]: Finished difference Result 3399 states and 5134 transitions. [2025-02-05 22:19:04,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:19:04,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2025-02-05 22:19:04,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:04,288 INFO L225 Difference]: With dead ends: 3399 [2025-02-05 22:19:04,288 INFO L226 Difference]: Without dead ends: 2521 [2025-02-05 22:19:04,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:19:04,290 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 285 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:04,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 587 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:19:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2521 states. [2025-02-05 22:19:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2521 to 1592. [2025-02-05 22:19:04,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1305 states have (on average 1.468199233716475) internal successors, (1916), 1318 states have internal predecessors, (1916), 238 states have call successors, (238), 48 states have call predecessors, (238), 48 states have return successors, (238), 225 states have call predecessors, (238), 238 states have call successors, (238) [2025-02-05 22:19:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2392 transitions. [2025-02-05 22:19:04,363 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2392 transitions. Word has length 159 [2025-02-05 22:19:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:04,363 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2392 transitions. [2025-02-05 22:19:04,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2392 transitions. [2025-02-05 22:19:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 22:19:04,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:04,367 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:04,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:19:04,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:04,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:04,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1823261776, now seen corresponding path program 1 times [2025-02-05 22:19:04,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:04,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328231917] [2025-02-05 22:19:04,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:04,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 22:19:04,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 22:19:04,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:04,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:19:04,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:04,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328231917] [2025-02-05 22:19:04,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328231917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:04,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:04,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:19:04,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487126895] [2025-02-05 22:19:04,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:04,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:19:04,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:04,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:19:04,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:19:04,415 INFO L87 Difference]: Start difference. First operand 1592 states and 2392 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:04,538 INFO L93 Difference]: Finished difference Result 4601 states and 6935 transitions. [2025-02-05 22:19:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:19:04,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2025-02-05 22:19:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:04,550 INFO L225 Difference]: With dead ends: 4601 [2025-02-05 22:19:04,550 INFO L226 Difference]: Without dead ends: 3051 [2025-02-05 22:19:04,554 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-02-05 22:19:04,554 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 140 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:04,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 270 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:19:04,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2025-02-05 22:19:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 3049. [2025-02-05 22:19:04,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3049 states, 2494 states have (on average 1.4518845228548516) internal successors, (3621), 2519 states have internal predecessors, (3621), 462 states have call successors, (462), 92 states have call predecessors, (462), 92 states have return successors, (462), 437 states have call predecessors, (462), 462 states have call successors, (462) [2025-02-05 22:19:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 3049 states and 4545 transitions. [2025-02-05 22:19:04,719 INFO L78 Accepts]: Start accepts. Automaton has 3049 states and 4545 transitions. Word has length 159 [2025-02-05 22:19:04,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:04,720 INFO L471 AbstractCegarLoop]: Abstraction has 3049 states and 4545 transitions. [2025-02-05 22:19:04,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3049 states and 4545 transitions. [2025-02-05 22:19:04,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 22:19:04,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:04,722 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:04,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:19:04,722 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:04,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:04,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2052917796, now seen corresponding path program 1 times [2025-02-05 22:19:04,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:04,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195183608] [2025-02-05 22:19:04,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:04,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:04,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 22:19:04,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 22:19:04,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:04,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:19:04,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:04,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195183608] [2025-02-05 22:19:04,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195183608] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:19:04,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232279121] [2025-02-05 22:19:04,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:04,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:19:04,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:19:04,880 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-02-05 22:19:04,882 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-02-05 22:19:04,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 22:19:04,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 22:19:04,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:04,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:04,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 22:19:04,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:19:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 22 proven. 66 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-02-05 22:19:05,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:19:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:19:05,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232279121] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:19:05,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:19:05,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 22:19:05,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535407340] [2025-02-05 22:19:05,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:19:05,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 22:19:05,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:05,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 22:19:05,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:19:05,366 INFO L87 Difference]: Start difference. First operand 3049 states and 4545 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 3 states have call successors, (67), 2 states have call predecessors, (67), 4 states have return successors, (68), 2 states have call predecessors, (68), 3 states have call successors, (68) [2025-02-05 22:19:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:05,707 INFO L93 Difference]: Finished difference Result 7047 states and 10431 transitions. [2025-02-05 22:19:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:19:05,707 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 3 states have call successors, (67), 2 states have call predecessors, (67), 4 states have return successors, (68), 2 states have call predecessors, (68), 3 states have call successors, (68) Word has length 159 [2025-02-05 22:19:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:05,722 INFO L225 Difference]: With dead ends: 7047 [2025-02-05 22:19:05,722 INFO L226 Difference]: Without dead ends: 4040 [2025-02-05 22:19:05,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:19:05,729 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 311 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:05,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 469 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:19:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2025-02-05 22:19:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 3606. [2025-02-05 22:19:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 3010 states have (on average 1.4538205980066445) internal successors, (4376), 3035 states have internal predecessors, (4376), 462 states have call successors, (462), 133 states have call predecessors, (462), 133 states have return successors, (462), 437 states have call predecessors, (462), 462 states have call successors, (462) [2025-02-05 22:19:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 5300 transitions. [2025-02-05 22:19:05,945 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 5300 transitions. Word has length 159 [2025-02-05 22:19:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:05,947 INFO L471 AbstractCegarLoop]: Abstraction has 3606 states and 5300 transitions. [2025-02-05 22:19:05,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 3 states have call successors, (67), 2 states have call predecessors, (67), 4 states have return successors, (68), 2 states have call predecessors, (68), 3 states have call successors, (68) [2025-02-05 22:19:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 5300 transitions. [2025-02-05 22:19:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 22:19:05,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:05,950 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:05,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 22:19:06,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 22:19:06,150 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:06,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash -578497295, now seen corresponding path program 1 times [2025-02-05 22:19:06,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:06,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653668582] [2025-02-05 22:19:06,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:06,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:06,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 22:19:06,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 22:19:06,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:06,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:19:06,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:06,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653668582] [2025-02-05 22:19:06,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653668582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:06,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:06,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:19:06,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212879288] [2025-02-05 22:19:06,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:06,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:19:06,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:06,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:19:06,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:19:06,255 INFO L87 Difference]: Start difference. First operand 3606 states and 5300 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:06,540 INFO L93 Difference]: Finished difference Result 6906 states and 10175 transitions. [2025-02-05 22:19:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:19:06,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2025-02-05 22:19:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:06,555 INFO L225 Difference]: With dead ends: 6906 [2025-02-05 22:19:06,555 INFO L226 Difference]: Without dead ends: 4247 [2025-02-05 22:19:06,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:19:06,561 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 66 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:06,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 529 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:19:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2025-02-05 22:19:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 3645. [2025-02-05 22:19:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3645 states, 3049 states have (on average 1.4562151525090195) internal successors, (4440), 3074 states have internal predecessors, (4440), 462 states have call successors, (462), 133 states have call predecessors, (462), 133 states have return successors, (462), 437 states have call predecessors, (462), 462 states have call successors, (462) [2025-02-05 22:19:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 5364 transitions. [2025-02-05 22:19:06,756 INFO L78 Accepts]: Start accepts. Automaton has 3645 states and 5364 transitions. Word has length 159 [2025-02-05 22:19:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:06,756 INFO L471 AbstractCegarLoop]: Abstraction has 3645 states and 5364 transitions. [2025-02-05 22:19:06,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3645 states and 5364 transitions. [2025-02-05 22:19:06,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:19:06,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:06,759 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:06,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:19:06,760 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:06,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1211235403, now seen corresponding path program 1 times [2025-02-05 22:19:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:06,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412971172] [2025-02-05 22:19:06,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:06,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:19:06,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:19:06,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:06,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:06,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:19:06,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:06,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412971172] [2025-02-05 22:19:06,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412971172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:06,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:06,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 22:19:06,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995020455] [2025-02-05 22:19:06,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:06,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:19:06,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:06,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:19:06,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:19:06,900 INFO L87 Difference]: Start difference. First operand 3645 states and 5364 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:07,468 INFO L93 Difference]: Finished difference Result 7865 states and 11441 transitions. [2025-02-05 22:19:07,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:19:07,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 160 [2025-02-05 22:19:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:07,487 INFO L225 Difference]: With dead ends: 7865 [2025-02-05 22:19:07,487 INFO L226 Difference]: Without dead ends: 5163 [2025-02-05 22:19:07,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:19:07,495 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 419 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:07,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 786 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:19:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2025-02-05 22:19:07,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 4220. [2025-02-05 22:19:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4220 states, 3566 states have (on average 1.4596186203028603) internal successors, (5205), 3601 states have internal predecessors, (5205), 496 states have call successors, (496), 157 states have call predecessors, (496), 157 states have return successors, (496), 461 states have call predecessors, (496), 496 states have call successors, (496) [2025-02-05 22:19:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4220 states to 4220 states and 6197 transitions. [2025-02-05 22:19:07,771 INFO L78 Accepts]: Start accepts. Automaton has 4220 states and 6197 transitions. Word has length 160 [2025-02-05 22:19:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:07,772 INFO L471 AbstractCegarLoop]: Abstraction has 4220 states and 6197 transitions. [2025-02-05 22:19:07,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:07,772 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 6197 transitions. [2025-02-05 22:19:07,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:19:07,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:07,775 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:07,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:19:07,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:07,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:07,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1730422196, now seen corresponding path program 1 times [2025-02-05 22:19:07,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:07,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478451002] [2025-02-05 22:19:07,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:07,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:07,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:19:07,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:19:07,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:07,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:19:07,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:07,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478451002] [2025-02-05 22:19:07,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478451002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:07,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:07,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:19:07,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759359189] [2025-02-05 22:19:07,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:07,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:19:07,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:07,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:19:07,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:19:07,974 INFO L87 Difference]: Start difference. First operand 4220 states and 6197 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:08,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:08,279 INFO L93 Difference]: Finished difference Result 9490 states and 13986 transitions. [2025-02-05 22:19:08,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:19:08,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 160 [2025-02-05 22:19:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:08,305 INFO L225 Difference]: With dead ends: 9490 [2025-02-05 22:19:08,305 INFO L226 Difference]: Without dead ends: 5316 [2025-02-05 22:19:08,312 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-02-05 22:19:08,312 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 193 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:08,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 447 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:19:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2025-02-05 22:19:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 4513. [2025-02-05 22:19:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4513 states, 3797 states have (on average 1.4532525678166974) internal successors, (5518), 3832 states have internal predecessors, (5518), 542 states have call successors, (542), 173 states have call predecessors, (542), 173 states have return successors, (542), 507 states have call predecessors, (542), 542 states have call successors, (542) [2025-02-05 22:19:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4513 states to 4513 states and 6602 transitions. [2025-02-05 22:19:08,541 INFO L78 Accepts]: Start accepts. Automaton has 4513 states and 6602 transitions. Word has length 160 [2025-02-05 22:19:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:08,542 INFO L471 AbstractCegarLoop]: Abstraction has 4513 states and 6602 transitions. [2025-02-05 22:19:08,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4513 states and 6602 transitions. [2025-02-05 22:19:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:19:08,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:08,546 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:08,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:19:08,547 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:08,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:08,547 INFO L85 PathProgramCache]: Analyzing trace with hash 85455966, now seen corresponding path program 1 times [2025-02-05 22:19:08,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:08,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178948016] [2025-02-05 22:19:08,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:08,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:08,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:19:08,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:19:08,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:08,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:19:08,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:08,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178948016] [2025-02-05 22:19:08,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178948016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:08,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:08,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:19:08,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687744488] [2025-02-05 22:19:08,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:08,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:19:08,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:08,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:19:08,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:19:08,633 INFO L87 Difference]: Start difference. First operand 4513 states and 6602 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:09,127 INFO L93 Difference]: Finished difference Result 9444 states and 13737 transitions. [2025-02-05 22:19:09,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:19:09,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 160 [2025-02-05 22:19:09,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:09,143 INFO L225 Difference]: With dead ends: 9444 [2025-02-05 22:19:09,143 INFO L226 Difference]: Without dead ends: 6050 [2025-02-05 22:19:09,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:19:09,149 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 278 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:09,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 604 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:19:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2025-02-05 22:19:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 4519. [2025-02-05 22:19:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4519 states, 3803 states have (on average 1.4530633710228766) internal successors, (5526), 3838 states have internal predecessors, (5526), 542 states have call successors, (542), 173 states have call predecessors, (542), 173 states have return successors, (542), 507 states have call predecessors, (542), 542 states have call successors, (542) [2025-02-05 22:19:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4519 states to 4519 states and 6610 transitions. [2025-02-05 22:19:09,356 INFO L78 Accepts]: Start accepts. Automaton has 4519 states and 6610 transitions. Word has length 160 [2025-02-05 22:19:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:09,357 INFO L471 AbstractCegarLoop]: Abstraction has 4519 states and 6610 transitions. [2025-02-05 22:19:09,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 4519 states and 6610 transitions. [2025-02-05 22:19:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:19:09,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:09,360 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:09,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:19:09,360 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:09,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:09,360 INFO L85 PathProgramCache]: Analyzing trace with hash -947826354, now seen corresponding path program 1 times [2025-02-05 22:19:09,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:09,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836597466] [2025-02-05 22:19:09,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:09,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:09,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:19:09,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:19:09,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:09,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:19:09,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:09,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836597466] [2025-02-05 22:19:09,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836597466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:09,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:09,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:19:09,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532883394] [2025-02-05 22:19:09,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:09,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:19:09,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:09,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:19:09,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:19:09,482 INFO L87 Difference]: Start difference. First operand 4519 states and 6610 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:09,680 INFO L93 Difference]: Finished difference Result 9544 states and 13957 transitions. [2025-02-05 22:19:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:19:09,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 160 [2025-02-05 22:19:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:09,694 INFO L225 Difference]: With dead ends: 9544 [2025-02-05 22:19:09,694 INFO L226 Difference]: Without dead ends: 5071 [2025-02-05 22:19:09,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:19:09,702 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 29 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:09,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 420 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:19:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5071 states. [2025-02-05 22:19:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5071 to 4577. [2025-02-05 22:19:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 3861 states have (on average 1.4511784511784511) internal successors, (5603), 3896 states have internal predecessors, (5603), 542 states have call successors, (542), 173 states have call predecessors, (542), 173 states have return successors, (542), 507 states have call predecessors, (542), 542 states have call successors, (542) [2025-02-05 22:19:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 6687 transitions. [2025-02-05 22:19:09,980 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 6687 transitions. Word has length 160 [2025-02-05 22:19:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:09,981 INFO L471 AbstractCegarLoop]: Abstraction has 4577 states and 6687 transitions. [2025-02-05 22:19:09,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 6687 transitions. [2025-02-05 22:19:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:19:09,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:09,983 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:09,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:19:09,984 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:09,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash 914079993, now seen corresponding path program 1 times [2025-02-05 22:19:09,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:09,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129528791] [2025-02-05 22:19:09,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:09,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:09,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:19:10,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:19:10,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:10,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:19:10,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:19:10,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129528791] [2025-02-05 22:19:10,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129528791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:10,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:10,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:19:10,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748264623] [2025-02-05 22:19:10,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:10,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:19:10,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:19:10,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:19:10,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:19:10,054 INFO L87 Difference]: Start difference. First operand 4577 states and 6687 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:10,530 INFO L93 Difference]: Finished difference Result 10566 states and 15456 transitions. [2025-02-05 22:19:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:19:10,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 160 [2025-02-05 22:19:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:10,548 INFO L225 Difference]: With dead ends: 10566 [2025-02-05 22:19:10,548 INFO L226 Difference]: Without dead ends: 6332 [2025-02-05 22:19:10,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:19:10,556 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 143 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:10,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 342 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:19:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6332 states. [2025-02-05 22:19:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6332 to 5908. [2025-02-05 22:19:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5908 states, 4954 states have (on average 1.445902301170771) internal successors, (7163), 5001 states have internal predecessors, (7163), 722 states have call successors, (722), 231 states have call predecessors, (722), 231 states have return successors, (722), 675 states have call predecessors, (722), 722 states have call successors, (722) [2025-02-05 22:19:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5908 states to 5908 states and 8607 transitions. [2025-02-05 22:19:10,840 INFO L78 Accepts]: Start accepts. Automaton has 5908 states and 8607 transitions. Word has length 160 [2025-02-05 22:19:10,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:10,840 INFO L471 AbstractCegarLoop]: Abstraction has 5908 states and 8607 transitions. [2025-02-05 22:19:10,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5908 states and 8607 transitions. [2025-02-05 22:19:10,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:19:10,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:10,842 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:10,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 22:19:10,843 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:10,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1295479705, now seen corresponding path program 1 times [2025-02-05 22:19:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:19:10,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893521944] [2025-02-05 22:19:10,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:10,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:19:10,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:19:10,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:19:10,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:10,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:19:10,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 22:19:10,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:19:10,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:19:10,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:10,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:19:10,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 22:19:10,968 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 22:19:10,969 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 22:19:10,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 22:19:10,973 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:19:11,073 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 22:19:11,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:19:11 BoogieIcfgContainer [2025-02-05 22:19:11,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 22:19:11,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 22:19:11,076 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 22:19:11,076 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 22:19:11,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:50" (3/4) ... [2025-02-05 22:19:11,078 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 22:19:11,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 22:19:11,079 INFO L158 Benchmark]: Toolchain (without parser) took 21791.95ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 105.5MB in the beginning and 782.4MB in the end (delta: -676.9MB). Peak memory consumption was 267.0MB. Max. memory is 16.1GB. [2025-02-05 22:19:11,079 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:19:11,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.54ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 90.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:19:11,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.05ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 86.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:19:11,080 INFO L158 Benchmark]: Boogie Preprocessor took 47.76ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 80.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:19:11,080 INFO L158 Benchmark]: IcfgBuilder took 438.93ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 51.5MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 22:19:11,080 INFO L158 Benchmark]: TraceAbstraction took 20989.68ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 50.5MB in the beginning and 787.0MB in the end (delta: -736.5MB). Peak memory consumption was 199.9MB. Max. memory is 16.1GB. [2025-02-05 22:19:11,080 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 1.1GB. Free memory was 787.0MB in the beginning and 782.4MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:19:11,081 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.54ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 90.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.05ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 86.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.76ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 80.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 438.93ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 51.5MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20989.68ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 939.5MB). Free memory was 50.5MB in the beginning and 787.0MB in the end (delta: -736.5MB). Peak memory consumption was 199.9MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 1.1GB. Free memory was 787.0MB in the beginning and 782.4MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 157, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 155, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 173, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryArithmeticFLOAToperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] signed long int var_1_25 = 64; [L43] unsigned long int var_1_32 = 2219578776; [L44] unsigned char var_1_34 = 0; [L45] unsigned char var_1_36 = 5; [L46] unsigned char var_1_41 = 32; [L47] double var_1_42 = 16.125; [L48] double var_1_43 = 256.5; [L49] signed short int var_1_45 = -10; [L50] unsigned char last_1_var_1_1 = 2; [L51] unsigned char last_1_var_1_15 = 1; [L52] signed char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L177] last_1_var_1_1 = var_1_1 [L178] last_1_var_1_15 = var_1_15 [L179] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L139] var_1_4 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L140] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L141] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L141] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L142] var_1_5 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L143] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] var_1_6 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L146] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] var_1_7 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_8=32, var_1_9=201/2] [L149] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_8=32, var_1_9=201/2] [L150] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=32, var_1_9=201/2] [L150] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=32, var_1_9=201/2] [L151] var_1_8 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_9=201/2] [L152] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_9=201/2] [L153] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L153] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L154] var_1_11 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L155] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L156] var_1_12 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L157] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L158] var_1_16 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L159] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L160] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L160] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L161] var_1_17 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L162] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L163] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L163] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L164] var_1_19 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L165] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L166] var_1_21 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L167] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L168] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L168] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L169] var_1_32 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_32 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L170] RET assume_abort_if_not(var_1_32 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L171] CALL assume_abort_if_not(var_1_32 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L171] RET assume_abort_if_not(var_1_32 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L172] var_1_42 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L173] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L174] CALL assume_abort_if_not(var_1_42 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L174] RET assume_abort_if_not(var_1_42 != 0.0F) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L190] RET updateVariables() [L191] CALL step() [L56] COND FALSE !(var_1_5 >= var_1_6) [L65] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L67] unsigned char stepLocal_1 = var_1_15; [L68] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L69] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L70] COND TRUE var_1_15 && stepLocal_1 [L71] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L85] COND TRUE var_1_11 == var_1_18 [L86] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L88] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L91] COND FALSE !((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) [L94] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L96] var_1_22 = var_1_12 [L97] var_1_23 = var_1_8 [L98] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L99] EXPR var_1_13 >> var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L99] EXPR ((var_1_20) < ((var_1_13 >> var_1_5))) ? (var_1_20) : ((var_1_13 >> var_1_5)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L99] EXPR var_1_13 >> var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L99] EXPR ((var_1_20) < ((var_1_13 >> var_1_5))) ? (var_1_20) : ((var_1_13 >> var_1_5)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L99] COND FALSE !(var_1_13 < ((((var_1_20) < ((var_1_13 >> var_1_5))) ? (var_1_20) : ((var_1_13 >> var_1_5))))) [L108] COND TRUE (var_1_5 - var_1_7) <= (~ (var_1_32 - var_1_5)) [L109] var_1_25 = ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L114] COND TRUE var_1_6 >= -25 [L115] var_1_34 = var_1_16 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L117] COND TRUE (var_1_12 - var_1_12) >= (var_1_11 * var_1_11) [L118] var_1_36 = 5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L120] COND TRUE (var_1_12 / ((((var_1_42) > (256.5)) ? (var_1_42) : (256.5)))) < var_1_11 [L121] var_1_41 = var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L123] COND FALSE !((((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11))) >= (var_1_12 / var_1_42)) || var_1_16) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L128] EXPR var_1_5 & var_1_4 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L128] EXPR var_1_13 ^ (var_1_5 & var_1_4) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L128] COND FALSE !(var_1_5 <= (var_1_13 ^ (var_1_5 & var_1_4))) [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=31, var_1_21=31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_32=-2147483649, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=95, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=2219578781] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 15, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6500 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6437 mSDsluCounter, 8729 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6520 mSDsCounter, 1432 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7905 IncrementalHoareTripleChecker+Invalid, 9337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1432 mSolverCounterUnsat, 2209 mSDtfsCounter, 7905 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1326 GetRequests, 1122 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4341 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5908occurred in iteration=14, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 7463 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 3010 NumberOfCodeBlocks, 3010 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3303 ConstructedInterpolants, 0 QuantifiedInterpolants, 11505 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1532 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 21 InterpolantComputations, 11 PerfectInterpolantSequences, 20728/21252 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 22:19:11,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc5779ebdfe5c74a3db41d9bf7ba8251563c3c8378a523b151aca96b4ca86800 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:19:12,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:19:13,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 22:19:13,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:19:13,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:19:13,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:19:13,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:19:13,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:19:13,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:19:13,104 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:19:13,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:19:13,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:19:13,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:19:13,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:19:13,106 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:19:13,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:19:13,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:19:13,106 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:19:13,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:19:13,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:19:13,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:19:13,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:19:13,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:19:13,107 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 22:19:13,107 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 22:19:13,107 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 22:19:13,107 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:19:13,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:19:13,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:19:13,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:19:13,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:19:13,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:19:13,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:19:13,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:19:13,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:19:13,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:19:13,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:19:13,109 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:19:13,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:19:13,109 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 22:19:13,109 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 22:19:13,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:19:13,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:19:13,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:19:13,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:19:13,110 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 -> bc5779ebdfe5c74a3db41d9bf7ba8251563c3c8378a523b151aca96b4ca86800 [2025-02-05 22:19:13,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:19:13,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:19:13,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:19:13,355 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:19:13,355 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:19:13,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i [2025-02-05 22:19:14,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/654bcb739/0efed7ad317c49389baae443a6c60bf9/FLAGda4e42326 [2025-02-05 22:19:14,698 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:19:14,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i [2025-02-05 22:19:14,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/654bcb739/0efed7ad317c49389baae443a6c60bf9/FLAGda4e42326 [2025-02-05 22:19:15,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/654bcb739/0efed7ad317c49389baae443a6c60bf9 [2025-02-05 22:19:15,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:19:15,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:19:15,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:19:15,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:19:15,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:19:15,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e2c8718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15, skipping insertion in model container [2025-02-05 22:19:15,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:19:15,171 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_fillercodestructure_filler-pe-ci_file-32.i[919,932] [2025-02-05 22:19:15,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:19:15,229 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:19:15,237 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_fillercodestructure_filler-pe-ci_file-32.i[919,932] [2025-02-05 22:19:15,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:19:15,273 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:19:15,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15 WrapperNode [2025-02-05 22:19:15,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:19:15,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:19:15,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:19:15,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:19:15,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,310 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-02-05 22:19:15,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:19:15,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:19:15,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:19:15,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:19:15,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,333 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-02-05 22:19:15,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,340 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:19:15,346 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:19:15,346 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:19:15,346 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:19:15,347 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (1/1) ... [2025-02-05 22:19:15,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:19:15,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:19:15,373 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-02-05 22:19:15,376 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-02-05 22:19:15,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:19:15,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 22:19:15,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:19:15,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:19:15,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:19:15,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:19:15,463 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:19:15,465 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:19:36,588 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-02-05 22:19:36,588 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:19:36,594 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:19:36,594 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:19:36,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:19:36 BoogieIcfgContainer [2025-02-05 22:19:36,594 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:19:36,596 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:19:36,596 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:19:36,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:19:36,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:19:15" (1/3) ... [2025-02-05 22:19:36,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ca3bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:19:36, skipping insertion in model container [2025-02-05 22:19:36,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:19:15" (2/3) ... [2025-02-05 22:19:36,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ca3bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:19:36, skipping insertion in model container [2025-02-05 22:19:36,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:19:36" (3/3) ... [2025-02-05 22:19:36,601 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i [2025-02-05 22:19:36,610 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:19:36,611 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-32.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:19:36,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:19:36,652 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;@42ce7d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:19:36,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:19:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 22:19:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 22:19:36,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:36,666 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:36,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:36,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2064964678, now seen corresponding path program 1 times [2025-02-05 22:19:36,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:19:36,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662123039] [2025-02-05 22:19:36,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:36,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:19:36,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:19:36,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:19:36,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-05 22:19:36,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 22:19:37,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 22:19:37,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:37,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:38,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:19:38,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:19:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-02-05 22:19:38,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:19:38,043 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:19:38,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662123039] [2025-02-05 22:19:38,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662123039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:38,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:38,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:19:38,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856390893] [2025-02-05 22:19:38,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:38,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:19:38,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:19:38,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:19:38,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:19:38,070 INFO L87 Difference]: Start difference. First operand has 79 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 22:19:38,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:38,089 INFO L93 Difference]: Finished difference Result 152 states and 270 transitions. [2025-02-05 22:19:38,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:19:38,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2025-02-05 22:19:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:38,095 INFO L225 Difference]: With dead ends: 152 [2025-02-05 22:19:38,095 INFO L226 Difference]: Without dead ends: 76 [2025-02-05 22:19:38,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-02-05 22:19:38,100 INFO L435 NwaCegarLoop]: 120 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, 120 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-02-05 22:19:38,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:19:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-05 22:19:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-05 22:19:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 51 states have internal predecessors, (74), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 22:19:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 120 transitions. [2025-02-05 22:19:38,130 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 120 transitions. Word has length 152 [2025-02-05 22:19:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:38,130 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 120 transitions. [2025-02-05 22:19:38,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-05 22:19:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 120 transitions. [2025-02-05 22:19:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 22:19:38,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:38,135 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:38,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 22:19:38,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:19:38,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:38,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:38,336 INFO L85 PathProgramCache]: Analyzing trace with hash -57598813, now seen corresponding path program 1 times [2025-02-05 22:19:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:19:38,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434414915] [2025-02-05 22:19:38,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:38,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:19:38,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:19:38,339 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:19:38,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-05 22:19:38,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 22:19:39,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 22:19:39,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:39,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:39,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 22:19:39,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:19:41,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-05 22:19:41,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:19:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-05 22:19:44,624 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:19:44,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434414915] [2025-02-05 22:19:44,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434414915] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:19:44,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:19:44,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-02-05 22:19:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218161187] [2025-02-05 22:19:44,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:19:44,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 22:19:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:19:44,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 22:19:44,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:19:44,628 INFO L87 Difference]: Start difference. First operand 76 states and 120 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 22:19:49,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:19:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:19:51,196 INFO L93 Difference]: Finished difference Result 181 states and 282 transitions. [2025-02-05 22:19:51,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 22:19:51,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 152 [2025-02-05 22:19:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:19:51,199 INFO L225 Difference]: With dead ends: 181 [2025-02-05 22:19:51,199 INFO L226 Difference]: Without dead ends: 108 [2025-02-05 22:19:51,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:19:51,201 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 74 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:19:51,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 295 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-02-05 22:19:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-05 22:19:51,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2025-02-05 22:19:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 64 states have internal predecessors, (85), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 22:19:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 159 transitions. [2025-02-05 22:19:51,212 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 159 transitions. Word has length 152 [2025-02-05 22:19:51,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:19:51,213 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 159 transitions. [2025-02-05 22:19:51,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-05 22:19:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 159 transitions. [2025-02-05 22:19:51,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 22:19:51,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:19:51,214 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:19:51,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-05 22:19:51,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:19:51,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:19:51,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:19:51,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1548329827, now seen corresponding path program 1 times [2025-02-05 22:19:51,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:19:51,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395130825] [2025-02-05 22:19:51,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:19:51,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:19:51,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:19:51,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:19:51,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 22:19:51,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 22:19:52,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 22:19:52,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:19:52,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:19:52,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:19:52,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:19:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-05 22:19:56,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:19:56,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:19:56,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395130825] [2025-02-05 22:19:56,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395130825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:19:56,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:19:56,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:19:56,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163028575] [2025-02-05 22:19:56,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:19:56,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:19:56,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:19:56,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:19:56,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:19:56,894 INFO L87 Difference]: Start difference. First operand 103 states and 159 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:19:59,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:20:01,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:20:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:20:01,808 INFO L93 Difference]: Finished difference Result 255 states and 393 transitions. [2025-02-05 22:20:01,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:20:01,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 153 [2025-02-05 22:20:01,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:20:01,833 INFO L225 Difference]: With dead ends: 255 [2025-02-05 22:20:01,834 INFO L226 Difference]: Without dead ends: 178 [2025-02-05 22:20:01,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:20:01,835 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 37 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:20:01,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 210 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-02-05 22:20:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-05 22:20:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2025-02-05 22:20:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 111 states have internal predecessors, (148), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:20:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 268 transitions. [2025-02-05 22:20:01,854 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 268 transitions. Word has length 153 [2025-02-05 22:20:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:20:01,856 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 268 transitions. [2025-02-05 22:20:01,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-05 22:20:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 268 transitions. [2025-02-05 22:20:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 22:20:01,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:20:01,859 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:20:01,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 22:20:02,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:20:02,060 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:20:02,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:20:02,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1042771202, now seen corresponding path program 1 times [2025-02-05 22:20:02,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:20:02,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684303360] [2025-02-05 22:20:02,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:20:02,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:20:02,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:20:02,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:20:02,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 22:20:02,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 22:20:03,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 22:20:03,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:20:03,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:20:03,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 22:20:03,354 INFO L279 TraceCheckSpWp]: Computing forward predicates...