./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.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 2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:16:08,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:16:08,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:16:08,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:16:08,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:16:08,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:16:08,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:16:08,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:16:08,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:16:08,819 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:16:08,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:16:08,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:16:08,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:16:08,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:16:08,820 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:16:08,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:16:08,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:16:08,820 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:16:08,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:16:08,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:16:08,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:16:08,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:16:08,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:16:08,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:16:08,823 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:16:08,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:16:08,823 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:16:08,823 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:16:08,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:16:08,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:16:08,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:16:08,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:16:08,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:08,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:16:08,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:16:08,825 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:16:08,825 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:16:08,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:08,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:16:08,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:16:08,825 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:16:08,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:16:08,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:16:08,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:16:08,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:16:08,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:16:08,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:16:08,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:16:08,826 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 -> 2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18 [2025-01-09 15:16:09,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:16:09,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:16:09,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:16:09,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:16:09,132 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:16:09,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i [2025-01-09 15:16:10,446 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec2b27f3b/6cbbb34a5bee4451b8dade31a25be2b5/FLAG7c09e32ca [2025-01-09 15:16:10,682 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:16:10,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i [2025-01-09 15:16:10,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec2b27f3b/6cbbb34a5bee4451b8dade31a25be2b5/FLAG7c09e32ca [2025-01-09 15:16:10,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec2b27f3b/6cbbb34a5bee4451b8dade31a25be2b5 [2025-01-09 15:16:10,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:16:10,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:16:10,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:16:10,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:16:10,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:16:10,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:10,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13491ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10, skipping insertion in model container [2025-01-09 15:16:10,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:10,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:16:10,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i[913,926] [2025-01-09 15:16:10,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:16:10,901 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:16:10,914 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i[913,926] [2025-01-09 15:16:10,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:16:10,966 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:16:10,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10 WrapperNode [2025-01-09 15:16:10,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:16:10,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:16:10,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:16:10,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:16:10,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:10,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:11,002 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2025-01-09 15:16:11,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:16:11,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:16:11,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:16:11,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:16:11,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:11,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:11,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:11,023 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 15:16:11,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:11,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:11,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:11,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:11,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:11,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:11,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:11,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:16:11,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:16:11,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:16:11,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:16:11,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (1/1) ... [2025-01-09 15:16:11,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:11,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:16:11,066 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 15:16:11,070 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 15:16:11,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:16:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:16:11,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:16:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:16:11,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:16:11,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:16:11,165 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:16:11,167 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:16:11,425 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 15:16:11,425 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:16:11,434 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:16:11,434 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:16:11,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:11 BoogieIcfgContainer [2025-01-09 15:16:11,434 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:16:11,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:16:11,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:16:11,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:16:11,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:16:10" (1/3) ... [2025-01-09 15:16:11,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5833097c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:16:11, skipping insertion in model container [2025-01-09 15:16:11,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:10" (2/3) ... [2025-01-09 15:16:11,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5833097c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:16:11, skipping insertion in model container [2025-01-09 15:16:11,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:11" (3/3) ... [2025-01-09 15:16:11,443 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-88.i [2025-01-09 15:16:11,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:16:11,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-88.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:16:11,507 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:16:11,517 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;@73c61278, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:16:11,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:16:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:16:11,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:16:11,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:11,532 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:11,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:11,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:11,539 INFO L85 PathProgramCache]: Analyzing trace with hash -161736597, now seen corresponding path program 1 times [2025-01-09 15:16:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:16:11,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27854441] [2025-01-09 15:16:11,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:11,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:16:11,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:16:11,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:16:11,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:11,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 15:16:11,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:16:11,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27854441] [2025-01-09 15:16:11,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27854441] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:16:11,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010639839] [2025-01-09 15:16:11,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:11,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:16:11,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:16:11,839 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 15:16:11,842 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 15:16:11,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:16:11,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:16:11,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:11,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:11,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:16:11,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:16:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 15:16:12,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:16:12,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010639839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:16:12,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:16:12,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:16:12,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722659198] [2025-01-09 15:16:12,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:16:12,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:16:12,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:16:12,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:16:12,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:16:12,038 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:16:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:16:12,062 INFO L93 Difference]: Finished difference Result 108 states and 180 transitions. [2025-01-09 15:16:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:16:12,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2025-01-09 15:16:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:16:12,071 INFO L225 Difference]: With dead ends: 108 [2025-01-09 15:16:12,072 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 15:16:12,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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 15:16:12,080 INFO L435 NwaCegarLoop]: 79 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, 79 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 15:16:12,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:16:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 15:16:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-09 15:16:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:16:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2025-01-09 15:16:12,137 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 111 [2025-01-09 15:16:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:16:12,138 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2025-01-09 15:16:12,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:16:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2025-01-09 15:16:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 15:16:12,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:12,142 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:12,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:16:12,342 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 15:16:12,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:12,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:12,343 INFO L85 PathProgramCache]: Analyzing trace with hash 21719533, now seen corresponding path program 1 times [2025-01-09 15:16:12,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:16:12,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283113801] [2025-01-09 15:16:12,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:16:12,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 15:16:12,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 15:16:12,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:12,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:13,165 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:16:13,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:16:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283113801] [2025-01-09 15:16:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283113801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:16:13,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:16:13,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:16:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425387278] [2025-01-09 15:16:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:16:13,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:16:13,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:16:13,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:16:13,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:16:13,170 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:16:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:16:13,454 INFO L93 Difference]: Finished difference Result 157 states and 232 transitions. [2025-01-09 15:16:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:16:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 111 [2025-01-09 15:16:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:16:13,458 INFO L225 Difference]: With dead ends: 157 [2025-01-09 15:16:13,460 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 15:16:13,461 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 15:16:13,461 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:16:13,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 202 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:16:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 15:16:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2025-01-09 15:16:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:16:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2025-01-09 15:16:13,503 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 111 [2025-01-09 15:16:13,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:16:13,505 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2025-01-09 15:16:13,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:16:13,505 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2025-01-09 15:16:13,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 15:16:13,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:13,508 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:13,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:16:13,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:13,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:13,509 INFO L85 PathProgramCache]: Analyzing trace with hash 802021855, now seen corresponding path program 1 times [2025-01-09 15:16:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:16:13,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594488899] [2025-01-09 15:16:13,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:13,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:16:13,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 15:16:13,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 15:16:13,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:13,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:16:13,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:16:13,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594488899] [2025-01-09 15:16:13,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594488899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:16:13,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:16:13,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:16:13,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713062185] [2025-01-09 15:16:13,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:16:13,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:16:13,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:16:13,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:16:13,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:16:13,789 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:16:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:16:13,958 INFO L93 Difference]: Finished difference Result 165 states and 243 transitions. [2025-01-09 15:16:13,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:16:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 113 [2025-01-09 15:16:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:16:13,960 INFO L225 Difference]: With dead ends: 165 [2025-01-09 15:16:13,960 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 15:16:13,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 15:16:13,961 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:16:13,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 206 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:16:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 15:16:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2025-01-09 15:16:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 61 states have internal predecessors, (76), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:16:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2025-01-09 15:16:13,996 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 113 [2025-01-09 15:16:13,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:16:13,996 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2025-01-09 15:16:13,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:16:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2025-01-09 15:16:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:16:13,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:13,999 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:13,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:16:14,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:14,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:14,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2080746573, now seen corresponding path program 1 times [2025-01-09 15:16:14,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:16:14,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125606838] [2025-01-09 15:16:14,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:14,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:16:14,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:16:14,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:16:14,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:14,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:16:14,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:16:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125606838] [2025-01-09 15:16:14,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125606838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:16:14,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:16:14,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:16:14,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165159651] [2025-01-09 15:16:14,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:16:14,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:16:14,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:16:14,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:16:14,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:16:14,367 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:16:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:16:14,684 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2025-01-09 15:16:14,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:16:14,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 115 [2025-01-09 15:16:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:16:14,687 INFO L225 Difference]: With dead ends: 193 [2025-01-09 15:16:14,687 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 15:16:14,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:16:14,689 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 108 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:16:14,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 365 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:16:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 15:16:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 99. [2025-01-09 15:16:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:16:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2025-01-09 15:16:14,720 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 115 [2025-01-09 15:16:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:16:14,720 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2025-01-09 15:16:14,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:16:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2025-01-09 15:16:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 15:16:14,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:14,722 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:14,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:16:14,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:14,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:14,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1956055285, now seen corresponding path program 1 times [2025-01-09 15:16:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:16:14,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341333885] [2025-01-09 15:16:14,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:14,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:16:14,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:16:14,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:16:14,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:14,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:16:14,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:16:14,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 15:16:14,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 15:16:14,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:14,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:16:14,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:16:14,965 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:16:14,966 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:16:14,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:16:14,972 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 15:16:15,059 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:16:15,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:16:15 BoogieIcfgContainer [2025-01-09 15:16:15,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:16:15,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:16:15,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:16:15,066 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:16:15,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:11" (3/4) ... [2025-01-09 15:16:15,068 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:16:15,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:16:15,070 INFO L158 Benchmark]: Toolchain (without parser) took 4366.25ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 78.4MB in the end (delta: 33.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2025-01-09 15:16:15,071 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:16:15,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.28ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 99.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:16:15,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.73ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:16:15,073 INFO L158 Benchmark]: Boogie Preprocessor took 31.48ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:16:15,073 INFO L158 Benchmark]: RCFGBuilder took 398.75ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 78.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:16:15,073 INFO L158 Benchmark]: TraceAbstraction took 3627.42ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 78.5MB in the end (delta: -853.6kB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2025-01-09 15:16:15,073 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 78.4MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:16:15,074 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.31ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.28ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 99.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.73ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 97.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.48ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 398.75ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 78.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3627.42ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 78.5MB in the end (delta: -853.6kB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 78.4MB 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 103, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of bitwiseOr at line 44, overapproximation of bitwiseOr at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -8; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_7 = -1; [L26] signed char var_1_8 = -50; [L27] signed char var_1_9 = 100; [L28] unsigned long int var_1_10 = 25; [L29] unsigned long int var_1_11 = 2568920345; [L30] unsigned long int var_1_12 = 1191097264; [L31] unsigned long int var_1_13 = 1801344522; [L32] signed long int var_1_14 = 64; [L33] signed short int var_1_15 = -16; [L34] float var_1_16 = 1000000.5; [L35] float var_1_17 = 4.5; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 128; [L38] unsigned long int last_1_var_1_10 = 25; [L39] signed short int last_1_var_1_15 = -16; [L40] unsigned char last_1_var_1_18 = 0; VAL [isInitial=0, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L107] isInitial = 1 [L108] FCALL initially() [L110] CALL updateLastVariables() [L98] last_1_var_1_10 = var_1_10 [L99] last_1_var_1_15 = var_1_15 [L100] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L110] RET updateLastVariables() [L111] CALL updateVariables() [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L72] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L73] var_1_6 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_7=-1, var_1_8=-50, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L75] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=-1, var_1_8=-50, var_1_9=100] [L76] var_1_7 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L77] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L78] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L78] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=100] [L79] var_1_9 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L80] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L81] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L81] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=2568920345, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L82] var_1_11 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L83] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L84] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L84] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=1191097264, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L85] var_1_12 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L86] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L87] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L87] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=1801344522, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L88] var_1_13 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_13 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L89] RET assume_abort_if_not(var_1_13 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L90] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L90] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_17=9/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L91] var_1_17 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L92] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=128, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L93] var_1_19 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L94] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L95] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L95] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L111] RET updateVariables() [L112] CALL step() [L44] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=-8, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L44] COND FALSE !(((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && var_1_5) [L51] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L53] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=64, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L56] COND TRUE var_1_12 <= var_1_8 [L57] var_1_14 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=-16, var_1_16=2000001/2, var_1_18=0, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L59] var_1_15 = 2 [L60] var_1_16 = var_1_17 [L61] var_1_18 = var_1_19 [L62] unsigned char stepLocal_0 = var_1_8 < var_1_1; VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, stepLocal_0=1, var_1_10=25, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L63] COND TRUE stepLocal_0 && (((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8))) == var_1_7) [L64] var_1_10 = (var_1_11 - (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - 1u)) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=2147483648, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR last_1_var_1_15 | last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=2147483648, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L103-L104] return (((((((((last_1_var_1_15 | last_1_var_1_10) > last_1_var_1_18) && var_1_5) ? ((var_1_5 && var_1_6) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : (var_1_1 == ((signed char) var_1_7))) && (var_1_5 ? (var_1_8 == ((signed char) ((((var_1_7) > (var_1_9)) ? (var_1_7) : (var_1_9))))) : 1)) && (((var_1_8 < var_1_1) && (((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8))) == var_1_7)) ? (var_1_10 == ((unsigned long int) (var_1_11 - (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) - 1u)))) : (var_1_10 == ((unsigned long int) (var_1_11 - var_1_13))))) && ((var_1_12 <= var_1_8) ? (var_1_14 == ((signed long int) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1)) && (var_1_15 == ((signed short int) 2))) && (var_1_16 == ((float) var_1_17))) && (var_1_18 == ((unsigned char) var_1_19)) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=2147483648, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=25, last_1_var_1_15=-16, last_1_var_1_18=0, var_1_10=2147483648, var_1_11=4294967294, var_1_12=2147483647, var_1_13=2147483645, var_1_14=50, var_1_15=2, var_1_16=4294967300, var_1_17=4294967300, var_1_18=254, var_1_19=254, var_1_1=126, var_1_5=0, var_1_6=1, var_1_7=126, var_1_8=-50, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 852 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 559 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 293 mSDtfsCounter, 192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 54 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 676 NumberOfCodeBlocks, 676 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 1637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 277 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 2688/2720 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 15:16:15,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.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 2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:16:17,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:16:17,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:16:17,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:16:17,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:16:17,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:16:17,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:16:17,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:16:17,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:16:17,476 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:16:17,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:16:17,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:16:17,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:16:17,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:16:17,479 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:16:17,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:16:17,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:16:17,480 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:16:17,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:16:17,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:16:17,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:16:17,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:16:17,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:16:17,481 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:16:17,481 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:16:17,481 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:16:17,481 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:16:17,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:16:17,481 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:16:17,481 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:16:17,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:16:17,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:16:17,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:16:17,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:16:17,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:17,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:16:17,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:16:17,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:16:17,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:16:17,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:17,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:16:17,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:16:17,484 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:16:17,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:16:17,484 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:16:17,484 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:16:17,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:16:17,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:16:17,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:16:17,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:16:17,485 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 -> 2006370b8a49dd66a2beda35abd40d48d399599f38c6eecda60f9b7dc037aa18 [2025-01-09 15:16:17,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:16:17,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:16:17,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:16:17,784 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:16:17,784 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:16:17,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i [2025-01-09 15:16:19,183 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd3a1e348/64f6eda9098649e4bcb18856d4df7686/FLAGa8199c690 [2025-01-09 15:16:19,439 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:16:19,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i [2025-01-09 15:16:19,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd3a1e348/64f6eda9098649e4bcb18856d4df7686/FLAGa8199c690 [2025-01-09 15:16:19,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd3a1e348/64f6eda9098649e4bcb18856d4df7686 [2025-01-09 15:16:19,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:16:19,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:16:19,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:16:19,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:16:19,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:16:19,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733e37e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19, skipping insertion in model container [2025-01-09 15:16:19,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:16:19,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i[913,926] [2025-01-09 15:16:19,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:16:19,712 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:16:19,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-88.i[913,926] [2025-01-09 15:16:19,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:16:19,774 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:16:19,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19 WrapperNode [2025-01-09 15:16:19,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:16:19,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:16:19,779 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:16:19,779 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:16:19,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,832 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-01-09 15:16:19,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:16:19,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:16:19,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:16:19,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:16:19,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,868 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 15:16:19,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,882 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:16:19,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:16:19,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:16:19,906 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:16:19,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (1/1) ... [2025-01-09 15:16:19,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:16:19,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:16:19,942 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 15:16:19,950 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 15:16:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:16:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:16:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:16:19,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:16:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:16:19,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:16:20,049 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:16:20,051 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:16:20,267 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 15:16:20,268 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:16:20,277 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:16:20,277 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:16:20,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:20 BoogieIcfgContainer [2025-01-09 15:16:20,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:16:20,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:16:20,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:16:20,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:16:20,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:16:19" (1/3) ... [2025-01-09 15:16:20,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a2827e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:16:20, skipping insertion in model container [2025-01-09 15:16:20,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:16:19" (2/3) ... [2025-01-09 15:16:20,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a2827e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:16:20, skipping insertion in model container [2025-01-09 15:16:20,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:16:20" (3/3) ... [2025-01-09 15:16:20,287 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-88.i [2025-01-09 15:16:20,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:16:20,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-88.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:16:20,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:16:20,357 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;@7d977cd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:16:20,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:16:20,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:16:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:16:20,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:20,368 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:20,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:20,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1609203601, now seen corresponding path program 1 times [2025-01-09 15:16:20,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:16:20,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777710490] [2025-01-09 15:16:20,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:20,381 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 15:16:20,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:16:20,383 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 15:16:20,385 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 15:16:20,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:16:20,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:16:20,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:20,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:20,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:16:20,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:16:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-01-09 15:16:20,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:16:20,600 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:16:20,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777710490] [2025-01-09 15:16:20,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777710490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:16:20,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:16:20,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:16:20,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276752939] [2025-01-09 15:16:20,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:16:20,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:16:20,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:16:20,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:16:20,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:16:20,626 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:16:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:16:20,657 INFO L93 Difference]: Finished difference Result 94 states and 158 transitions. [2025-01-09 15:16:20,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:16:20,659 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2025-01-09 15:16:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:16:20,664 INFO L225 Difference]: With dead ends: 94 [2025-01-09 15:16:20,664 INFO L226 Difference]: Without dead ends: 47 [2025-01-09 15:16:20,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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 15:16:20,671 INFO L435 NwaCegarLoop]: 68 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, 68 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 15:16:20,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:16:20,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-01-09 15:16:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-01-09 15:16:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:16:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-01-09 15:16:20,704 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 108 [2025-01-09 15:16:20,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:16:20,705 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-01-09 15:16:20,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:16:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2025-01-09 15:16:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:16:20,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:20,711 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:20,716 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 15:16:20,911 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 15:16:20,912 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:20,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1235653075, now seen corresponding path program 1 times [2025-01-09 15:16:20,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:16:20,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240049792] [2025-01-09 15:16:20,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:20,913 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 15:16:20,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:16:20,915 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 15:16:20,916 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 15:16:20,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:16:21,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:16:21,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:21,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:21,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:16:21,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:16:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:16:21,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:16:21,396 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:16:21,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240049792] [2025-01-09 15:16:21,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240049792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:16:21,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:16:21,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:16:21,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468988173] [2025-01-09 15:16:21,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:16:21,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:16:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:16:21,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:16:21,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:16:21,400 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:16:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:16:21,602 INFO L93 Difference]: Finished difference Result 158 states and 226 transitions. [2025-01-09 15:16:21,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:16:21,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-01-09 15:16:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:16:21,605 INFO L225 Difference]: With dead ends: 158 [2025-01-09 15:16:21,605 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 15:16:21,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:16:21,607 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 84 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:16:21,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 254 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:16:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 15:16:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 81. [2025-01-09 15:16:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:16:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2025-01-09 15:16:21,638 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 108 [2025-01-09 15:16:21,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:16:21,638 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2025-01-09 15:16:21,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 15:16:21,638 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2025-01-09 15:16:21,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 15:16:21,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:16:21,640 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:21,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:16:21,840 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 15:16:21,841 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:16:21,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:16:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2044999701, now seen corresponding path program 1 times [2025-01-09 15:16:21,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:16:21,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702432661] [2025-01-09 15:16:21,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:16:21,842 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 15:16:21,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:16:21,844 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 15:16:21,845 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 15:16:21,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 15:16:21,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 15:16:21,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:16:21,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:16:21,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 15:16:21,957 INFO L279 TraceCheckSpWp]: Computing forward predicates...