./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-5.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_operatoramount_amount50_file-5.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 a1339bde4f8f30972d3a87175db437e9cccf706eaf44c9e594286067623f4bc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:58:30,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:58:30,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:58:30,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:58:30,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:58:30,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:58:30,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:58:30,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:58:30,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:58:30,421 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:58:30,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:58:30,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:58:30,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:58:30,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:58:30,423 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:58:30,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:58:30,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:58:30,423 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:58:30,424 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:58:30,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:58:30,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:58:30,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:58:30,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:58:30,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:58:30,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:58:30,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:58:30,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:58:30,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:58:30,426 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:58:30,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:58:30,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:58:30,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:58:30,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:58:30,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:58:30,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:58:30,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:58:30,426 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 -> a1339bde4f8f30972d3a87175db437e9cccf706eaf44c9e594286067623f4bc8 [2025-01-09 14:58:30,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:58:30,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:58:30,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:58:30,665 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:58:30,665 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:58:30,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-5.i [2025-01-09 14:58:31,816 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25f129a47/bb3b5738d4f14440a7613d3569e87285/FLAGd09f6b70a [2025-01-09 14:58:32,092 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:58:32,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-5.i [2025-01-09 14:58:32,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25f129a47/bb3b5738d4f14440a7613d3569e87285/FLAGd09f6b70a [2025-01-09 14:58:32,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25f129a47/bb3b5738d4f14440a7613d3569e87285 [2025-01-09 14:58:32,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:58:32,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:58:32,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:58:32,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:58:32,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:58:32,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753ce39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32, skipping insertion in model container [2025-01-09 14:58:32,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:58:32,540 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_operatoramount_amount50_file-5.i[914,927] [2025-01-09 14:58:32,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:58:32,610 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:58:32,619 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_operatoramount_amount50_file-5.i[914,927] [2025-01-09 14:58:32,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:58:32,662 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:58:32,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32 WrapperNode [2025-01-09 14:58:32,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:58:32,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:58:32,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:58:32,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:58:32,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,714 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-01-09 14:58:32,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:58:32,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:58:32,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:58:32,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:58:32,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,750 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 14:58:32,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:58:32,778 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:58:32,778 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:58:32,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:58:32,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (1/1) ... [2025-01-09 14:58:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:58:32,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:58:32,806 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 14:58:32,808 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 14:58:32,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:58:32,824 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:58:32,824 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:58:32,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:58:32,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:58:32,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:58:32,879 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:58:32,881 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:58:33,115 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 14:58:33,115 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:58:33,121 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:58:33,122 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:58:33,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:33 BoogieIcfgContainer [2025-01-09 14:58:33,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:58:33,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:58:33,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:58:33,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:58:33,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:58:32" (1/3) ... [2025-01-09 14:58:33,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c38eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:58:33, skipping insertion in model container [2025-01-09 14:58:33,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:32" (2/3) ... [2025-01-09 14:58:33,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c38eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:58:33, skipping insertion in model container [2025-01-09 14:58:33,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:33" (3/3) ... [2025-01-09 14:58:33,137 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-5.i [2025-01-09 14:58:33,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:58:33,162 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-5.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:58:33,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:58:33,235 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;@8cc98b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:58:33,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:58:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 14:58:33,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 14:58:33,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:58:33,248 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:33,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:58:33,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:58:33,253 INFO L85 PathProgramCache]: Analyzing trace with hash -612399866, now seen corresponding path program 1 times [2025-01-09 14:58:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:58:33,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118642784] [2025-01-09 14:58:33,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:33,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:58:33,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:58:33,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:58:33,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:33,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:58:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 14:58:33,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:58:33,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118642784] [2025-01-09 14:58:33,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118642784] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:58:33,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378750983] [2025-01-09 14:58:33,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:33,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:58:33,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:58:33,502 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 14:58:33,504 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 14:58:33,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:58:33,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:58:33,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:33,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:58:33,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:58:33,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:58:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 14:58:33,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:58:33,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378750983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:58:33,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:58:33,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:58:33,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755504976] [2025-01-09 14:58:33,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:58:33,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:58:33,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:58:33,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:58:33,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:58:33,632 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 14:58:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:58:33,645 INFO L93 Difference]: Finished difference Result 100 states and 164 transitions. [2025-01-09 14:58:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:58:33,647 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2025-01-09 14:58:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:58:33,651 INFO L225 Difference]: With dead ends: 100 [2025-01-09 14:58:33,652 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 14:58:33,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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 14:58:33,656 INFO L435 NwaCegarLoop]: 71 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, 71 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 14:58:33,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:58:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 14:58:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 14:58:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 14:58:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-01-09 14:58:33,682 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 102 [2025-01-09 14:58:33,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:58:33,682 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-01-09 14:58:33,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 14:58:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-01-09 14:58:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 14:58:33,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:58:33,685 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:33,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:58:33,886 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 14:58:33,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:58:33,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:58:33,887 INFO L85 PathProgramCache]: Analyzing trace with hash 918306942, now seen corresponding path program 1 times [2025-01-09 14:58:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:58:33,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592156438] [2025-01-09 14:58:33,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:58:33,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:58:34,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:58:34,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:34,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:58:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 66 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-01-09 14:58:35,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:58:35,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592156438] [2025-01-09 14:58:35,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592156438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:58:35,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934540276] [2025-01-09 14:58:35,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:35,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:58:35,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:58:35,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:58:35,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:58:35,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:58:35,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:58:35,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:35,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:58:35,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 14:58:35,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:58:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 171 proven. 90 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-01-09 14:58:36,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:58:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 69 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2025-01-09 14:58:37,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934540276] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:58:37,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:58:37,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 27 [2025-01-09 14:58:37,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124503064] [2025-01-09 14:58:37,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:58:37,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 14:58:37,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:58:37,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 14:58:37,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2025-01-09 14:58:37,363 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 25 states have internal predecessors, (92), 11 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (45), 8 states have call predecessors, (45), 11 states have call successors, (45) [2025-01-09 14:58:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:58:38,378 INFO L93 Difference]: Finished difference Result 193 states and 256 transitions. [2025-01-09 14:58:38,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 14:58:38,379 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 25 states have internal predecessors, (92), 11 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (45), 8 states have call predecessors, (45), 11 states have call successors, (45) Word has length 102 [2025-01-09 14:58:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:58:38,381 INFO L225 Difference]: With dead ends: 193 [2025-01-09 14:58:38,381 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 14:58:38,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=483, Invalid=1497, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 14:58:38,382 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 178 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:58:38,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 497 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:58:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 14:58:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2025-01-09 14:58:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 81 states have internal predecessors, (97), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 14:58:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2025-01-09 14:58:38,401 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 102 [2025-01-09 14:58:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:58:38,401 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2025-01-09 14:58:38,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 25 states have internal predecessors, (92), 11 states have call successors, (45), 5 states have call predecessors, (45), 9 states have return successors, (45), 8 states have call predecessors, (45), 11 states have call successors, (45) [2025-01-09 14:58:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2025-01-09 14:58:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 14:58:38,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:58:38,403 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:38,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:58:38,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:58:38,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:58:38,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:58:38,604 INFO L85 PathProgramCache]: Analyzing trace with hash 238248572, now seen corresponding path program 1 times [2025-01-09 14:58:38,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:58:38,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422672580] [2025-01-09 14:58:38,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:38,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:58:38,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:58:38,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:58:38,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:38,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:58:38,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978614760] [2025-01-09 14:58:38,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:38,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:58:38,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:58:38,690 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:58:38,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:58:38,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:58:38,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:58:38,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:38,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:58:38,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 14:58:38,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:58:38,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:58:38,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:38,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 14:58:39,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 14:58:39,028 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 14:58:39,029 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 14:58:39,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:58:39,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:58:39,238 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 14:58:39,290 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 14:58:39,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:58:39 BoogieIcfgContainer [2025-01-09 14:58:39,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 14:58:39,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 14:58:39,293 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 14:58:39,294 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 14:58:39,294 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:33" (3/4) ... [2025-01-09 14:58:39,296 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 14:58:39,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 14:58:39,297 INFO L158 Benchmark]: Toolchain (without parser) took 6894.76ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 131.4MB in the beginning and 61.6MB in the end (delta: 69.8MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. [2025-01-09 14:58:39,297 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 226.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:58:39,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.53ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 117.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:58:39,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.78ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 114.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:58:39,298 INFO L158 Benchmark]: Boogie Preprocessor took 62.73ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 107.9MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 14:58:39,298 INFO L158 Benchmark]: RCFGBuilder took 345.42ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 87.6MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 14:58:39,298 INFO L158 Benchmark]: TraceAbstraction took 6164.78ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 86.6MB in the beginning and 61.7MB in the end (delta: 24.9MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2025-01-09 14:58:39,298 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 209.7MB. Free memory was 61.7MB in the beginning and 61.6MB in the end (delta: 64.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 14:58:39,299 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.27ms. Allocated memory is still 226.5MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.53ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 117.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.78ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 114.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.73ms. Allocated memory is still 167.8MB. Free memory was 114.3MB in the beginning and 107.9MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 345.42ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 87.6MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6164.78ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 86.6MB in the beginning and 61.7MB in the end (delta: 24.9MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 209.7MB. Free memory was 61.7MB in the beginning and 61.6MB in the end (delta: 64.6kB). 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 someBinaryArithmeticDOUBLEoperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_4 = 128; [L24] unsigned char var_1_5 = 1; [L25] unsigned long int var_1_6 = 5; [L26] unsigned char var_1_9 = 0; [L27] unsigned char var_1_10 = 64; [L28] unsigned char var_1_11 = 64; [L29] unsigned short int var_1_12 = 25; [L30] unsigned short int var_1_14 = 31408; [L31] double var_1_15 = 64.375; [L32] double var_1_16 = 10.85; [L33] double var_1_17 = 128.8; [L34] double var_1_18 = 2.6; [L35] unsigned char var_1_19 = 0; [L36] unsigned char var_1_20 = 0; [L37] signed short int var_1_21 = -64; [L38] unsigned short int last_1_var_1_12 = 25; [L39] double last_1_var_1_15 = 64.375; VAL [isInitial=0, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L114] isInitial = 1 [L115] FCALL initially() [L117] CALL updateLastVariables() [L106] last_1_var_1_12 = var_1_12 [L107] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=128, var_1_5=1, var_1_6=5, var_1_9=0] [L117] RET updateLastVariables() [L118] CALL updateVariables() [L80] var_1_4 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=1, var_1_6=5, var_1_9=0] [L81] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=1, var_1_6=5, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=1, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=1, var_1_6=5, var_1_9=0] [L82] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=1, var_1_6=5, var_1_9=0] [L83] var_1_5 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_6=5, var_1_9=0] [L84] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_6=5, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L85] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=64, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L86] var_1_10 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L87] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L88] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L89] var_1_11 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_11 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L90] RET assume_abort_if_not(var_1_11 >= 64) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L91] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=31408, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L92] var_1_14 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L93] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L94] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_16=217/20, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L96] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_17=644/5, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L97] var_1_17 = __VERIFIER_nondet_double() [L98] 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_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L98] 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_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_18=13/5, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L99] var_1_18 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L100] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L101] var_1_20 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L102] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L103] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L118] RET updateVariables() [L119] CALL step() [L43] COND FALSE !(last_1_var_1_12 > var_1_4) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=10, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L48] COND FALSE !(((- 64) + var_1_6) == var_1_6) [L51] var_1_1 = (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L53] COND TRUE var_1_5 == (var_1_6 / var_1_4) [L54] var_1_9 = ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=-64, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L58] var_1_21 = var_1_10 [L59] unsigned long int stepLocal_0 = (((var_1_6) > (var_1_4)) ? (var_1_6) : (var_1_4)); VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_0=129, var_1_10=319, var_1_11=64, var_1_12=25, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L60] COND TRUE ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= stepLocal_0 [L61] var_1_12 = ((var_1_14 - var_1_5) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=16388, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L65] signed long int stepLocal_1 = ~ (var_1_5 * var_1_1); VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_1=-1, var_1_10=319, var_1_11=64, var_1_12=16388, var_1_14=-49153, var_1_15=515/8, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L66] COND TRUE stepLocal_1 <= var_1_12 [L67] var_1_15 = (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=16388, var_1_14=-49153, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L71] unsigned long int stepLocal_3 = var_1_6; [L72] unsigned char stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_2=129, stepLocal_3=5, var_1_10=319, var_1_11=64, var_1_12=16388, var_1_14=-49153, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L73] COND FALSE !(stepLocal_2 < var_1_1) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, stepLocal_3=5, var_1_10=319, var_1_11=64, var_1_12=16388, var_1_14=-49153, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L119] RET step() [L120] CALL, EXPR property() [L110-L111] return (((((((((- 64) + var_1_6) == var_1_6) ? (var_1_1 == ((unsigned char) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - var_1_5))) : (var_1_1 == ((unsigned char) (((((128) < (var_1_4)) ? (128) : (var_1_4))) - 64)))) && ((last_1_var_1_12 > var_1_4) ? (((- last_1_var_1_15) < last_1_var_1_15) ? (var_1_6 == ((unsigned long int) 10u)) : 1) : 1)) && ((var_1_5 == (var_1_6 / var_1_4)) ? (var_1_9 == ((unsigned char) ((((var_1_5) < (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) ? (var_1_5) : (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))))) : (var_1_9 == ((unsigned char) ((var_1_10 + var_1_11) - var_1_5))))) && ((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= ((((var_1_6) > (var_1_4)) ? (var_1_6) : (var_1_4)))) ? (var_1_12 == ((unsigned short int) ((var_1_14 - var_1_5) + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))) : (var_1_12 == ((unsigned short int) var_1_6)))) && (((~ (var_1_5 * var_1_1)) <= var_1_12) ? (var_1_15 == ((double) (((((5.25 - var_1_16)) > (var_1_17)) ? ((5.25 - var_1_16)) : (var_1_17))))) : (var_1_15 == ((double) ((((((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) < (var_1_18)) ? (((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16)))) : (var_1_18))))))) && ((var_1_4 < var_1_1) ? ((var_1_6 > var_1_21) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_21 == ((signed short int) var_1_10)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=16388, var_1_14=-49153, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=16388, var_1_14=-49153, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=25, last_1_var_1_15=515/8, var_1_10=319, var_1_11=64, var_1_12=16388, var_1_14=-49153, var_1_15=2, var_1_17=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=63, var_1_4=129, var_1_5=0, var_1_6=5, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 568 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 446 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 703 IncrementalHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 122 mSDtfsCounter, 703 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=2, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 27 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 612 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 3587 SizeOfPredicates, 6 NumberOfNonLiveVariables, 496 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1847/2100 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 14:58:39,340 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_operatoramount_amount50_file-5.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 a1339bde4f8f30972d3a87175db437e9cccf706eaf44c9e594286067623f4bc8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:58:41,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:58:41,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 14:58:41,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:58:41,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:58:41,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:58:41,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:58:41,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:58:41,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:58:41,393 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:58:41,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:58:41,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:58:41,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:58:41,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:58:41,395 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:58:41,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:58:41,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:58:41,395 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:58:41,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:58:41,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:58:41,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:58:41,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:58:41,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:58:41,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 14:58:41,396 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 14:58:41,396 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 14:58:41,396 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:58:41,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:58:41,396 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:58:41,396 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:58:41,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:58:41,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:58:41,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:58:41,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:58:41,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:58:41,397 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:58:41,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:58:41,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:58:41,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:58:41,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:58:41,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:58:41,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:58:41,398 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:58:41,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:58:41,398 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 14:58:41,399 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 14:58:41,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:58:41,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:58:41,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:58:41,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:58:41,399 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 -> a1339bde4f8f30972d3a87175db437e9cccf706eaf44c9e594286067623f4bc8 [2025-01-09 14:58:41,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:58:41,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:58:41,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:58:41,666 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:58:41,666 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:58:41,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-5.i [2025-01-09 14:58:42,803 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/53254885b/3a8a41a9c3894f41ae244a0f96da4abe/FLAG820384644 [2025-01-09 14:58:43,026 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:58:43,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-5.i [2025-01-09 14:58:43,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/53254885b/3a8a41a9c3894f41ae244a0f96da4abe/FLAG820384644 [2025-01-09 14:58:43,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/53254885b/3a8a41a9c3894f41ae244a0f96da4abe [2025-01-09 14:58:43,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:58:43,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:58:43,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:58:43,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:58:43,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:58:43,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c82afcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43, skipping insertion in model container [2025-01-09 14:58:43,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:58:43,202 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_operatoramount_amount50_file-5.i[914,927] [2025-01-09 14:58:43,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:58:43,274 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:58:43,286 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_operatoramount_amount50_file-5.i[914,927] [2025-01-09 14:58:43,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:58:43,345 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:58:43,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43 WrapperNode [2025-01-09 14:58:43,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:58:43,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:58:43,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:58:43,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:58:43,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,387 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-01-09 14:58:43,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:58:43,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:58:43,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:58:43,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:58:43,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,417 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 14:58:43,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,432 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:58:43,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:58:43,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:58:43,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:58:43,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (1/1) ... [2025-01-09 14:58:43,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:58:43,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:58:43,480 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 14:58:43,486 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 14:58:43,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:58:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 14:58:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:58:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:58:43,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:58:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:58:43,573 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:58:43,575 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:58:44,151 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 14:58:44,152 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:58:44,160 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:58:44,161 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:58:44,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:44 BoogieIcfgContainer [2025-01-09 14:58:44,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:58:44,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:58:44,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:58:44,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:58:44,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:58:43" (1/3) ... [2025-01-09 14:58:44,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c086ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:58:44, skipping insertion in model container [2025-01-09 14:58:44,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:58:43" (2/3) ... [2025-01-09 14:58:44,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c086ab1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:58:44, skipping insertion in model container [2025-01-09 14:58:44,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:58:44" (3/3) ... [2025-01-09 14:58:44,169 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-5.i [2025-01-09 14:58:44,179 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:58:44,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-5.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:58:44,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:58:44,235 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;@3df0c0e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:58:44,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:58:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 14:58:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 14:58:44,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:58:44,249 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:44,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:58:44,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:58:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -612399866, now seen corresponding path program 1 times [2025-01-09 14:58:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:58:44,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386333842] [2025-01-09 14:58:44,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:44,261 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 14:58:44,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:58:44,263 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 14:58:44,265 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 14:58:44,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:58:44,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:58:44,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:44,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:58:44,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:58:44,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:58:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-01-09 14:58:44,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:58:44,487 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:58:44,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386333842] [2025-01-09 14:58:44,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386333842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:58:44,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:58:44,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 14:58:44,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549908830] [2025-01-09 14:58:44,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:58:44,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:58:44,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:58:44,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:58:44,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:58:44,504 INFO L87 Difference]: Start difference. First operand has 53 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 14:58:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:58:44,517 INFO L93 Difference]: Finished difference Result 100 states and 164 transitions. [2025-01-09 14:58:44,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:58:44,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2025-01-09 14:58:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:58:44,521 INFO L225 Difference]: With dead ends: 100 [2025-01-09 14:58:44,522 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 14:58:44,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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 14:58:44,525 INFO L435 NwaCegarLoop]: 71 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, 71 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 14:58:44,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:58:44,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 14:58:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 14:58:44,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 14:58:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-01-09 14:58:44,548 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 102 [2025-01-09 14:58:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:58:44,549 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-01-09 14:58:44,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 14:58:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-01-09 14:58:44,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 14:58:44,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:58:44,550 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:44,558 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 14:58:44,755 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 14:58:44,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:58:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:58:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash 918306942, now seen corresponding path program 1 times [2025-01-09 14:58:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:58:44,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002304528] [2025-01-09 14:58:44,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:44,757 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 14:58:44,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:58:44,759 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 14:58:44,761 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 14:58:44,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:58:44,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:58:44,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:44,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:58:44,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 14:58:44,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:58:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 66 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 14:58:45,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:58:46,349 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 14:58:46,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002304528] [2025-01-09 14:58:46,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002304528] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:58:46,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1326672523] [2025-01-09 14:58:46,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:46,350 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 14:58:46,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 14:58:46,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 14:58:46,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 14:58:46,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:58:46,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:58:46,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:46,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:58:46,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 14:58:46,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:58:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 66 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 14:58:47,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:58:47,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1326672523] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:58:47,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:58:47,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-01-09 14:58:47,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142433265] [2025-01-09 14:58:47,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:58:47,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 14:58:47,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 14:58:47,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 14:58:47,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:58:47,791 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 14:58:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:58:48,780 INFO L93 Difference]: Finished difference Result 156 states and 217 transitions. [2025-01-09 14:58:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 14:58:48,789 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 102 [2025-01-09 14:58:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:58:48,791 INFO L225 Difference]: With dead ends: 156 [2025-01-09 14:58:48,791 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 14:58:48,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:58:48,792 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 42 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:58:48,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 270 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:58:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 14:58:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2025-01-09 14:58:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 68 states have internal predecessors, (83), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 14:58:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2025-01-09 14:58:48,811 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 102 [2025-01-09 14:58:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:58:48,812 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2025-01-09 14:58:48,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 14:58:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2025-01-09 14:58:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 14:58:48,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:58:48,813 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:58:48,820 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 14:58:49,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:58:49,215 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 14:58:49,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:58:49,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:58:49,217 INFO L85 PathProgramCache]: Analyzing trace with hash 238248572, now seen corresponding path program 1 times [2025-01-09 14:58:49,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 14:58:49,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649452470] [2025-01-09 14:58:49,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:58:49,218 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 14:58:49,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 14:58:49,219 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 14:58:49,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 14:58:49,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 14:58:49,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 14:58:49,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:58:49,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:58:49,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 14:58:49,392 INFO L279 TraceCheckSpWp]: Computing forward predicates...