./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-27.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 e79123d310ccbbfae3d8263279cae4e31c01266f439645cd8009b4db2afa383c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:15:49,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:15:49,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:15:49,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:15:49,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:15:49,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:15:49,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:15:49,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:15:49,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:15:49,990 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:15:49,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:15:49,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:15:49,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:15:49,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:15:49,991 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:15:49,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:15:49,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:15:49,992 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:15:49,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:15:49,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:15:49,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:15:49,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:15:49,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:15:49,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:15:49,992 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:15:49,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:15:49,992 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:15:49,993 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:15:49,993 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:15:49,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:15:49,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:15:49,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:15:49,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:15:49,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:15:49,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:15:49,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:15:49,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:15:49,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:15:49,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:15:49,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:15:49,994 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:15:49,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:15:49,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:15:49,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:15:49,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:15:49,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:15:49,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:15:49,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:15:49,995 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 -> e79123d310ccbbfae3d8263279cae4e31c01266f439645cd8009b4db2afa383c [2025-01-09 12:15:50,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:15:50,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:15:50,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:15:50,221 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:15:50,221 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:15:50,222 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_normal_file-27.i [2025-01-09 12:15:51,354 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94546d537/4b9947f4bf6543438cb5fa3790d0edbb/FLAGea30e8742 [2025-01-09 12:15:51,633 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:15:51,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-27.i [2025-01-09 12:15:51,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94546d537/4b9947f4bf6543438cb5fa3790d0edbb/FLAGea30e8742 [2025-01-09 12:15:51,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/94546d537/4b9947f4bf6543438cb5fa3790d0edbb [2025-01-09 12:15:51,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:15:51,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:15:51,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:15:51,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:15:51,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:15:51,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:15:51" (1/1) ... [2025-01-09 12:15:51,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45fe83f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:51, skipping insertion in model container [2025-01-09 12:15:51,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:15:51" (1/1) ... [2025-01-09 12:15:51,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:15:52,057 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_normal_file-27.i[913,926] [2025-01-09 12:15:52,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:15:52,103 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:15:52,110 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_normal_file-27.i[913,926] [2025-01-09 12:15:52,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:15:52,137 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:15:52,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52 WrapperNode [2025-01-09 12:15:52,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:15:52,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:15:52,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:15:52,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:15:52,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,170 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2025-01-09 12:15:52,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:15:52,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:15:52,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:15:52,171 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:15:52,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,202 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:15:52,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:15:52,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:15:52,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:15:52,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:15:52,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (1/1) ... [2025-01-09 12:15:52,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:15:52,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:15:52,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:15:52,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:15:52,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:15:52,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:15:52,261 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:15:52,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:15:52,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:15:52,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:15:52,322 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:15:52,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:15:52,544 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:15:52,544 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:15:52,554 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:15:52,554 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:15:52,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:15:52 BoogieIcfgContainer [2025-01-09 12:15:52,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:15:52,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:15:52,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:15:52,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:15:52,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:15:51" (1/3) ... [2025-01-09 12:15:52,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9247de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:15:52, skipping insertion in model container [2025-01-09 12:15:52,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:52" (2/3) ... [2025-01-09 12:15:52,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9247de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:15:52, skipping insertion in model container [2025-01-09 12:15:52,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:15:52" (3/3) ... [2025-01-09 12:15:52,564 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-27.i [2025-01-09 12:15:52,577 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:15:52,578 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-27.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:15:52,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:15:52,629 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;@16d3d374, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:15:52,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:15:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:15:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 12:15:52,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:15:52,642 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:15:52,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:15:52,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:15:52,647 INFO L85 PathProgramCache]: Analyzing trace with hash 269799866, now seen corresponding path program 1 times [2025-01-09 12:15:52,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:15:52,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050287655] [2025-01-09 12:15:52,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:15:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:15:52,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 12:15:52,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 12:15:52,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:15:52,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:15:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 12:15:52,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:15:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050287655] [2025-01-09 12:15:52,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050287655] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:15:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761528594] [2025-01-09 12:15:52,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:15:52,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:15:52,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:15:52,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:15:52,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:15:52,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 12:15:53,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 12:15:53,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:15:53,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:15:53,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:15:53,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:15:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 12:15:53,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:15:53,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761528594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:15:53,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:15:53,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:15:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242920011] [2025-01-09 12:15:53,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:15:53,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:15:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:15:53,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:15:53,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:15:53,086 INFO L87 Difference]: Start difference. First operand has 70 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 12:15:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:15:53,106 INFO L93 Difference]: Finished difference Result 134 states and 223 transitions. [2025-01-09 12:15:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:15:53,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2025-01-09 12:15:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:15:53,112 INFO L225 Difference]: With dead ends: 134 [2025-01-09 12:15:53,112 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 12:15:53,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:15:53,116 INFO L435 NwaCegarLoop]: 99 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, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:15:53,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:15:53,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 12:15:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 12:15:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:15:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2025-01-09 12:15:53,144 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 132 [2025-01-09 12:15:53,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:15:53,144 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2025-01-09 12:15:53,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 12:15:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2025-01-09 12:15:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 12:15:53,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:15:53,147 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:15:53,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 12:15:53,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:15:53,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:15:53,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:15:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1186667326, now seen corresponding path program 1 times [2025-01-09 12:15:53,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:15:53,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542168269] [2025-01-09 12:15:53,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:15:53,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:15:53,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 12:15:53,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 12:15:53,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:15:53,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:15:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 12:15:53,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:15:53,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542168269] [2025-01-09 12:15:53,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542168269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:15:53,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:15:53,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:15:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935447198] [2025-01-09 12:15:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:15:53,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:15:53,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:15:53,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:15:53,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:15:53,737 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:15:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:15:53,791 INFO L93 Difference]: Finished difference Result 195 states and 291 transitions. [2025-01-09 12:15:53,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:15:53,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2025-01-09 12:15:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:15:53,793 INFO L225 Difference]: With dead ends: 195 [2025-01-09 12:15:53,793 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 12:15:53,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:15:53,794 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:15:53,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 272 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:15:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 12:15:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2025-01-09 12:15:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 12:15:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 188 transitions. [2025-01-09 12:15:53,814 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 188 transitions. Word has length 132 [2025-01-09 12:15:53,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:15:53,815 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 188 transitions. [2025-01-09 12:15:53,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:15:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 188 transitions. [2025-01-09 12:15:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 12:15:53,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:15:53,816 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:15:53,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:15:53,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:15:53,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:15:53,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1532635031, now seen corresponding path program 1 times [2025-01-09 12:15:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:15:53,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112858367] [2025-01-09 12:15:53,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:15:53,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:15:53,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 12:15:53,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 12:15:53,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:15:53,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:15:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 12:15:54,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:15:54,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112858367] [2025-01-09 12:15:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112858367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:15:54,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:15:54,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:15:54,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899743861] [2025-01-09 12:15:54,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:15:54,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:15:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:15:54,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:15:54,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:15:54,171 INFO L87 Difference]: Start difference. First operand 127 states and 188 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:15:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:15:54,316 INFO L93 Difference]: Finished difference Result 377 states and 562 transitions. [2025-01-09 12:15:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:15:54,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2025-01-09 12:15:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:15:54,319 INFO L225 Difference]: With dead ends: 377 [2025-01-09 12:15:54,319 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 12:15:54,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-01-09 12:15:54,320 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 59 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:15:54,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 277 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:15:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 12:15:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2025-01-09 12:15:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 166 states have internal predecessors, (214), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 12:15:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 374 transitions. [2025-01-09 12:15:54,346 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 374 transitions. Word has length 133 [2025-01-09 12:15:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:15:54,346 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 374 transitions. [2025-01-09 12:15:54,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:15:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 374 transitions. [2025-01-09 12:15:54,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 12:15:54,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:15:54,348 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:15:54,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:15:54,348 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:15:54,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:15:54,349 INFO L85 PathProgramCache]: Analyzing trace with hash -511566677, now seen corresponding path program 1 times [2025-01-09 12:15:54,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:15:54,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034080801] [2025-01-09 12:15:54,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:15:54,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:15:54,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 12:15:54,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 12:15:54,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:15:54,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:15:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 12:15:54,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:15:54,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034080801] [2025-01-09 12:15:54,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034080801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:15:54,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:15:54,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:15:54,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222414312] [2025-01-09 12:15:54,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:15:54,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:15:54,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:15:54,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:15:54,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:15:54,586 INFO L87 Difference]: Start difference. First operand 251 states and 374 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:15:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:15:54,730 INFO L93 Difference]: Finished difference Result 377 states and 563 transitions. [2025-01-09 12:15:54,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:15:54,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2025-01-09 12:15:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:15:54,736 INFO L225 Difference]: With dead ends: 377 [2025-01-09 12:15:54,738 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 12:15:54,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-01-09 12:15:54,742 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 97 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:15:54,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 136 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:15:54,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 12:15:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 129. [2025-01-09 12:15:54,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 12:15:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 190 transitions. [2025-01-09 12:15:54,782 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 190 transitions. Word has length 133 [2025-01-09 12:15:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:15:54,783 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 190 transitions. [2025-01-09 12:15:54,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:15:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 190 transitions. [2025-01-09 12:15:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 12:15:54,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:15:54,789 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:15:54,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:15:54,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:15:54,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:15:54,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1805016368, now seen corresponding path program 1 times [2025-01-09 12:15:54,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:15:54,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385486673] [2025-01-09 12:15:54,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:15:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:15:54,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 12:15:54,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 12:15:54,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:15:54,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:15:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 12:15:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:15:54,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385486673] [2025-01-09 12:15:54,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385486673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:15:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:15:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:15:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54885395] [2025-01-09 12:15:54,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:15:54,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:15:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:15:54,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:15:54,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:15:54,978 INFO L87 Difference]: Start difference. First operand 129 states and 190 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:15:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:15:55,253 INFO L93 Difference]: Finished difference Result 421 states and 624 transitions. [2025-01-09 12:15:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:15:55,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 134 [2025-01-09 12:15:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:15:55,256 INFO L225 Difference]: With dead ends: 421 [2025-01-09 12:15:55,258 INFO L226 Difference]: Without dead ends: 295 [2025-01-09 12:15:55,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:15:55,260 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 108 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:15:55,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 288 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:15:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-01-09 12:15:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 253. [2025-01-09 12:15:55,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 168 states have (on average 1.2678571428571428) internal successors, (213), 168 states have internal predecessors, (213), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 12:15:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 373 transitions. [2025-01-09 12:15:55,321 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 373 transitions. Word has length 134 [2025-01-09 12:15:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:15:55,321 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 373 transitions. [2025-01-09 12:15:55,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:15:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 373 transitions. [2025-01-09 12:15:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 12:15:55,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:15:55,326 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:15:55,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:15:55,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:15:55,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:15:55,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1903144914, now seen corresponding path program 1 times [2025-01-09 12:15:55,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:15:55,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354193426] [2025-01-09 12:15:55,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:15:55,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:15:55,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 12:15:55,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 12:15:55,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:15:55,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:15:55,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:15:55,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 12:15:55,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 12:15:55,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:15:55,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:15:55,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:15:55,490 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:15:55,491 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:15:55,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:15:55,494 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 12:15:55,574 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:15:55,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:15:55 BoogieIcfgContainer [2025-01-09 12:15:55,577 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:15:55,578 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:15:55,578 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:15:55,578 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:15:55,579 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:15:52" (3/4) ... [2025-01-09 12:15:55,580 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:15:55,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:15:55,582 INFO L158 Benchmark]: Toolchain (without parser) took 3656.24ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 107.2MB in the beginning and 146.5MB in the end (delta: -39.3MB). Peak memory consumption was 134.4MB. Max. memory is 16.1GB. [2025-01-09 12:15:55,582 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:15:55,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.06ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 93.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:15:55,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.92ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:15:55,583 INFO L158 Benchmark]: Boogie Preprocessor took 42.72ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 87.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:15:55,583 INFO L158 Benchmark]: RCFGBuilder took 341.34ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 69.1MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:15:55,584 INFO L158 Benchmark]: TraceAbstraction took 3020.38ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 68.5MB in the beginning and 146.5MB in the end (delta: -78.0MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. [2025-01-09 12:15:55,584 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 318.8MB. Free memory was 146.5MB in the beginning and 146.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:15:55,585 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.17ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.06ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 93.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.92ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.72ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 87.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 341.34ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 69.1MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3020.38ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 68.5MB in the beginning and 146.5MB in the end (delta: -78.0MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 318.8MB. Free memory was 146.5MB in the beginning and 146.5MB in the end (delta: 27.1kB). There was no memory consumed. 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 107, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someBinaryArithmeticFLOAToperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=0, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L129] isInitial = 1 [L130] FCALL initially() [L132] FCALL updateLastVariables() [L133] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L94] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L94] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L95] var_1_4 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L96] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L97] var_1_5 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L98] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L99] var_1_6 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_7=316/5, var_1_8=1] [L100] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_7=316/5, var_1_8=1] [L101] var_1_7 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L102] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L103] var_1_11 = __VERIFIER_nondet_ulong() [L104] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L104] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L105] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L105] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L106] var_1_13 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L107] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L108] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L108] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L110] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L112] var_1_16 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L113] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L114] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L114] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L115] var_1_17 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L116] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L117] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L117] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L118] var_1_19 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L119] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L120] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L120] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L133] RET updateVariables() [L134] CALL step() [L45] COND FALSE !(var_1_6 == (var_1_4 / var_1_13)) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L48] var_1_20 = var_1_11 [L49] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L50] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L50] COND TRUE (var_1_21 + var_1_12) > (2u >> var_1_11) [L51] COND TRUE var_1_12 != var_1_21 [L52] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L57] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L68] unsigned char stepLocal_1 = var_1_14; [L69] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=1, var_1_10=0, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L70] COND TRUE var_1_14 || stepLocal_0 VAL [isInitial=1, stepLocal_1=1, var_1_10=0, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L71] COND TRUE stepLocal_1 || var_1_14 [L72] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=1] [L79] COND FALSE !(var_1_6 > (- var_1_7)) [L84] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=0, var_1_8=0] [L86] var_1_22 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=0, var_1_8=0] [L134] RET step() [L135] CALL, EXPR property() [L125] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=0, var_1_8=0] [L125-L126] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 1072 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 514 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 228 IncrementalHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 558 mSDtfsCounter, 228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=253occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 172 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 930 NumberOfCodeBlocks, 930 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 790 ConstructedInterpolants, 0 QuantifiedInterpolants, 1390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 301 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 4522/4560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 12:15:55,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_normal_file-27.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 e79123d310ccbbfae3d8263279cae4e31c01266f439645cd8009b4db2afa383c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:15:57,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:15:57,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:15:57,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:15:57,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:15:57,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:15:57,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:15:57,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:15:57,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:15:57,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:15:57,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:15:57,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:15:57,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:15:57,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:15:57,687 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:15:57,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:15:57,688 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:15:57,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:15:57,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:15:57,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:15:57,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:15:57,689 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 -> e79123d310ccbbfae3d8263279cae4e31c01266f439645cd8009b4db2afa383c [2025-01-09 12:15:57,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:15:57,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:15:57,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:15:57,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:15:57,952 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:15:57,953 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_normal_file-27.i [2025-01-09 12:15:59,234 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93f769211/60cca4e7462f492b9e16c4446bbc7dda/FLAG87f89df4a [2025-01-09 12:15:59,477 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:15:59,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-27.i [2025-01-09 12:15:59,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93f769211/60cca4e7462f492b9e16c4446bbc7dda/FLAG87f89df4a [2025-01-09 12:15:59,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/93f769211/60cca4e7462f492b9e16c4446bbc7dda [2025-01-09 12:15:59,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:15:59,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:15:59,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:15:59,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:15:59,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:15:59,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:15:59,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58126662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59, skipping insertion in model container [2025-01-09 12:15:59,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:15:59,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:15:59,903 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_normal_file-27.i[913,926] [2025-01-09 12:15:59,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:15:59,951 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:15:59,959 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_normal_file-27.i[913,926] [2025-01-09 12:15:59,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:15:59,986 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:15:59,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59 WrapperNode [2025-01-09 12:15:59,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:15:59,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:15:59,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:15:59,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:15:59,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:15:59,999 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:16:00,017 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2025-01-09 12:16:00,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:16:00,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:16:00,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:16:00,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:16:00,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:16:00,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:16:00,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:16:00,044 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:16:00,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:16:00,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:16:00,050 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:16:00,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:16:00,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:16:00,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:16:00,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:16:00,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:16:00,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:16:00,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:16:00,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:16:00,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (1/1) ... [2025-01-09 12:16:00,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:16:00,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:16:00,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:16:00,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:16:00,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:16:00,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:16:00,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:16:00,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:16:00,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:16:00,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:16:00,167 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:16:00,169 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:16:04,976 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:16:04,977 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:16:04,984 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:16:04,986 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:16:04,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:16:04 BoogieIcfgContainer [2025-01-09 12:16:04,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:16:04,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:16:04,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:16:04,994 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:16:04,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:15:59" (1/3) ... [2025-01-09 12:16:04,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135a5776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:16:04, skipping insertion in model container [2025-01-09 12:16:04,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:15:59" (2/3) ... [2025-01-09 12:16:04,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135a5776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:16:04, skipping insertion in model container [2025-01-09 12:16:04,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:16:04" (3/3) ... [2025-01-09 12:16:04,997 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-27.i [2025-01-09 12:16:05,007 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:16:05,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-27.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:16:05,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:16:05,050 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;@7f44b778, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:16:05,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:16:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:16:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 12:16:05,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:16:05,061 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:16:05,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:16:05,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:16:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash 757680132, now seen corresponding path program 1 times [2025-01-09 12:16:05,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:16:05,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111442021] [2025-01-09 12:16:05,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:16:05,075 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-01-09 12:16:05,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:16:05,079 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-01-09 12:16:05,080 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-01-09 12:16:05,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 12:16:05,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 12:16:05,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:16:05,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:16:05,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:16:05,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:16:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-01-09 12:16:05,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:16:05,457 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:16:05,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111442021] [2025-01-09 12:16:05,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111442021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:16:05,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:16:05,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:16:05,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88953551] [2025-01-09 12:16:05,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:16:05,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:16:05,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:16:05,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:16:05,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:16:05,473 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.35) internal successors, (54), 41 states have internal predecessors, (54), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 12:16:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:16:05,487 INFO L93 Difference]: Finished difference Result 120 states and 203 transitions. [2025-01-09 12:16:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:16:05,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-01-09 12:16:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:16:05,492 INFO L225 Difference]: With dead ends: 120 [2025-01-09 12:16:05,493 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 12:16:05,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:16:05,497 INFO L435 NwaCegarLoop]: 89 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, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:16:05,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:16:05,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 12:16:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 12:16:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:16:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2025-01-09 12:16:05,535 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2025-01-09 12:16:05,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:16:05,535 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2025-01-09 12:16:05,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 12:16:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2025-01-09 12:16:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 12:16:05,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:16:05,538 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:16:05,556 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-01-09 12:16:05,739 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-01-09 12:16:05,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:16:05,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:16:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash 159470076, now seen corresponding path program 1 times [2025-01-09 12:16:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:16:05,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464615031] [2025-01-09 12:16:05,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:16:05,740 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-01-09 12:16:05,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:16:05,745 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-01-09 12:16:05,746 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-01-09 12:16:05,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 12:16:06,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 12:16:06,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:16:06,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:16:06,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 12:16:06,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:16:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 12:16:06,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:16:06,717 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:16:06,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464615031] [2025-01-09 12:16:06,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464615031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:16:06,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:16:06,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:16:06,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816953045] [2025-01-09 12:16:06,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:16:06,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:16:06,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:16:06,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:16:06,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:16:06,719 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:16:09,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:16:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:16:10,102 INFO L93 Difference]: Finished difference Result 214 states and 321 transitions. [2025-01-09 12:16:10,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:16:10,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-01-09 12:16:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:16:10,124 INFO L225 Difference]: With dead ends: 214 [2025-01-09 12:16:10,125 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 12:16:10,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 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-01-09 12:16:10,125 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 104 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:16:10,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 264 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-09 12:16:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 12:16:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 115. [2025-01-09 12:16:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 12:16:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2025-01-09 12:16:10,148 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 129 [2025-01-09 12:16:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:16:10,148 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2025-01-09 12:16:10,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:16:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2025-01-09 12:16:10,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 12:16:10,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:16:10,150 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:16:10,159 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 12:16:10,350 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-01-09 12:16:10,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:16:10,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:16:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash -98695362, now seen corresponding path program 1 times [2025-01-09 12:16:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:16:10,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617098802] [2025-01-09 12:16:10,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:16:10,353 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-01-09 12:16:10,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:16:10,358 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-01-09 12:16:10,360 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-01-09 12:16:10,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 12:16:10,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 12:16:10,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:16:10,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:16:10,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:16:10,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:16:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 397 proven. 30 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-01-09 12:16:11,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:16:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 12:16:11,344 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:16:11,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617098802] [2025-01-09 12:16:11,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617098802] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 12:16:11,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:16:11,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 12:16:11,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554526126] [2025-01-09 12:16:11,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:16:11,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:16:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:16:11,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:16:11,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:16:11,357 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:16:14,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:16:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:16:14,122 INFO L93 Difference]: Finished difference Result 180 states and 263 transitions. [2025-01-09 12:16:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:16:14,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2025-01-09 12:16:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:16:14,149 INFO L225 Difference]: With dead ends: 180 [2025-01-09 12:16:14,149 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 12:16:14,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:16:14,150 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 53 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:16:14,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 114 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 12:16:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 12:16:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-01-09 12:16:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.2307692307692308) internal successors, (96), 78 states have internal predecessors, (96), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 12:16:14,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2025-01-09 12:16:14,164 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 129 [2025-01-09 12:16:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:16:14,164 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2025-01-09 12:16:14,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:16:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2025-01-09 12:16:14,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 12:16:14,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:16:14,166 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:16:14,178 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-01-09 12:16:14,370 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-01-09 12:16:14,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:16:14,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:16:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1672230946, now seen corresponding path program 1 times [2025-01-09 12:16:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:16:14,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514060557] [2025-01-09 12:16:14,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:16:14,371 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-01-09 12:16:14,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:16:14,373 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-01-09 12:16:14,374 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-01-09 12:16:14,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 12:16:14,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 12:16:14,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:16:14,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:16:14,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 12:16:14,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:16:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 12:16:15,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:16:15,324 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:16:15,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514060557] [2025-01-09 12:16:15,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514060557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:16:15,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:16:15,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:16:15,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851122892] [2025-01-09 12:16:15,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:16:15,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:16:15,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:16:15,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:16:15,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:16:15,326 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:16:19,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:16:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:16:19,400 INFO L93 Difference]: Finished difference Result 363 states and 522 transitions. [2025-01-09 12:16:19,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:16:19,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-01-09 12:16:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:16:19,428 INFO L225 Difference]: With dead ends: 363 [2025-01-09 12:16:19,428 INFO L226 Difference]: Without dead ends: 243 [2025-01-09 12:16:19,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:16:19,429 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 18 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:16:19,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 263 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 12:16:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-01-09 12:16:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2025-01-09 12:16:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 148 states have (on average 1.195945945945946) internal successors, (177), 148 states have internal predecessors, (177), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 12:16:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 337 transitions. [2025-01-09 12:16:19,471 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 337 transitions. Word has length 130 [2025-01-09 12:16:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:16:19,472 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 337 transitions. [2025-01-09 12:16:19,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 12:16:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 337 transitions. [2025-01-09 12:16:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 12:16:19,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:16:19,476 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:16:19,486 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 (5)] Ended with exit code 0 [2025-01-09 12:16:19,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-01-09 12:16:19,679 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:16:19,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:16:19,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1041477423, now seen corresponding path program 1 times [2025-01-09 12:16:19,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:16:19,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163443586] [2025-01-09 12:16:19,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:16:19,680 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-01-09 12:16:19,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:16:19,682 INFO L229 MonitoredProcess]: Starting monitored process 6 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-01-09 12:16:19,684 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 (6)] Waiting until timeout for monitored process [2025-01-09 12:16:19,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 12:16:19,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 12:16:19,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:16:19,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:16:19,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 12:16:20,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:16:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 434 proven. 36 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-09 12:16:20,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:16:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 117 proven. 45 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-01-09 12:16:21,645 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:16:21,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163443586] [2025-01-09 12:16:21,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163443586] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:16:21,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:16:21,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2025-01-09 12:16:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741215751] [2025-01-09 12:16:21,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:16:21,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 12:16:21,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:16:21,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 12:16:21,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-01-09 12:16:21,646 INFO L87 Difference]: Start difference. First operand 237 states and 337 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 4 states have call successors, (27), 4 states have call predecessors, (27), 10 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 12:16:24,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 12:16:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:16:26,497 INFO L93 Difference]: Finished difference Result 546 states and 726 transitions. [2025-01-09 12:16:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 12:16:26,498 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 4 states have call successors, (27), 4 states have call predecessors, (27), 10 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 131 [2025-01-09 12:16:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:16:26,500 INFO L225 Difference]: With dead ends: 546 [2025-01-09 12:16:26,500 INFO L226 Difference]: Without dead ends: 426 [2025-01-09 12:16:26,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=620, Invalid=1830, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 12:16:26,502 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 270 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:16:26,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 458 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-09 12:16:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-01-09 12:16:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 310. [2025-01-09 12:16:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 196 states have (on average 1.1377551020408163) internal successors, (223), 197 states have internal predecessors, (223), 92 states have call successors, (92), 21 states have call predecessors, (92), 21 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 12:16:26,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 407 transitions. [2025-01-09 12:16:26,540 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 407 transitions. Word has length 131 [2025-01-09 12:16:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:16:26,541 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 407 transitions. [2025-01-09 12:16:26,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 4 states have call successors, (27), 4 states have call predecessors, (27), 10 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-01-09 12:16:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 407 transitions. [2025-01-09 12:16:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 12:16:26,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:16:26,544 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:16:26,554 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 (6)] Ended with exit code 0 [2025-01-09 12:16:26,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-01-09 12:16:26,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:16:26,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:16:26,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1275109832, now seen corresponding path program 1 times [2025-01-09 12:16:26,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:16:26,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275310857] [2025-01-09 12:16:26,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:16:26,746 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-01-09 12:16:26,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:16:26,751 INFO L229 MonitoredProcess]: Starting monitored process 7 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-01-09 12:16:26,753 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 (7)] Waiting until timeout for monitored process [2025-01-09 12:16:26,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 12:16:27,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 12:16:27,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:16:27,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:16:27,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 12:16:27,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:16:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 46 proven. 384 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-01-09 12:16:29,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:16:30,014 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:16:30,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275310857] [2025-01-09 12:16:30,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275310857] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:16:30,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [360270511] [2025-01-09 12:16:30,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:16:30,015 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 12:16:30,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 12:16:30,018 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 12:16:30,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-01-09 12:16:30,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 12:16:30,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 12:16:30,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:16:30,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:16:30,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 12:16:30,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:17:12,834 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)