./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-67.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6785fbfa62719e2a16cb785f0dae7409fe6adec2e9b8c35426d44b08716a9a3e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:38:18,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:38:18,467 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:38:18,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:38:18,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:38:18,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:38:18,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:38:18,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:38:18,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:38:18,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:38:18,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:38:18,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:38:18,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:38:18,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:38:18,505 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:38:18,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:38:18,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:38:18,506 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:38:18,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:38:18,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:38:18,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:38:18,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:38:18,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:38:18,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:38:18,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:38:18,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:38:18,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:38:18,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:38:18,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:38:18,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:38:18,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:38:18,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:38:18,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:38:18,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:38:18,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:38:18,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:38:18,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:38:18,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:38:18,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:38:18,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:38:18,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:38:18,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:38:18,513 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 6785fbfa62719e2a16cb785f0dae7409fe6adec2e9b8c35426d44b08716a9a3e [2024-10-11 12:38:18,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:38:18,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:38:18,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:38:18,793 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:38:18,793 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:38:18,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-67.i [2024-10-11 12:38:20,277 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:38:20,424 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:38:20,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-67.i [2024-10-11 12:38:20,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6762d2bec/a40c34a5122747e9b7e0b13dd8d8a00d/FLAG4a9c9a0e3 [2024-10-11 12:38:20,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6762d2bec/a40c34a5122747e9b7e0b13dd8d8a00d [2024-10-11 12:38:20,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:38:20,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:38:20,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:38:20,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:38:20,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:38:20,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5802c82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20, skipping insertion in model container [2024-10-11 12:38:20,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:38:20,622 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-67.i[915,928] [2024-10-11 12:38:20,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:38:20,660 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:38:20,670 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-67.i[915,928] [2024-10-11 12:38:20,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:38:20,705 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:38:20,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20 WrapperNode [2024-10-11 12:38:20,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:38:20,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:38:20,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:38:20,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:38:20,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,764 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-10-11 12:38:20,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:38:20,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:38:20,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:38:20,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:38:20,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,789 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]. [2024-10-11 12:38:20,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:38:20,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:38:20,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:38:20,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:38:20,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (1/1) ... [2024-10-11 12:38:20,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:38:20,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:38:20,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:38:20,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:38:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:38:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:38:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:38:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:38:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:38:20,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:38:20,935 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:38:20,937 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:38:21,267 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 12:38:21,268 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:38:21,371 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:38:21,372 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:38:21,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:38:21 BoogieIcfgContainer [2024-10-11 12:38:21,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:38:21,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:38:21,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:38:21,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:38:21,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:38:20" (1/3) ... [2024-10-11 12:38:21,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c8a849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:38:21, skipping insertion in model container [2024-10-11 12:38:21,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:20" (2/3) ... [2024-10-11 12:38:21,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c8a849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:38:21, skipping insertion in model container [2024-10-11 12:38:21,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:38:21" (3/3) ... [2024-10-11 12:38:21,381 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-67.i [2024-10-11 12:38:21,395 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:38:21,396 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:38:21,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:38:21,479 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;@42e8e50c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:38:21,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:38:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 12:38:21,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 12:38:21,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:21,497 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:38:21,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:21,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:21,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1682392043, now seen corresponding path program 1 times [2024-10-11 12:38:21,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:38:21,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113461739] [2024-10-11 12:38:21,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:21,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:38:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:38:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:38:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:38:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:38:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:38:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:38:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:38:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:38:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:38:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:38:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:38:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:38:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:38:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:38:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:38:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 12:38:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:38:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 12:38:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:38:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 12:38:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:38:21,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113461739] [2024-10-11 12:38:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113461739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:38:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:38:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:38:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565872683] [2024-10-11 12:38:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:38:21,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:38:21,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:38:21,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:38:21,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:38:21,900 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 12:38:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:38:21,950 INFO L93 Difference]: Finished difference Result 89 states and 161 transitions. [2024-10-11 12:38:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:38:21,956 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 112 [2024-10-11 12:38:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:38:21,966 INFO L225 Difference]: With dead ends: 89 [2024-10-11 12:38:21,966 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 12:38:21,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:38:21,973 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:38:21,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:38:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 12:38:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 12:38:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 12:38:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2024-10-11 12:38:22,018 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 112 [2024-10-11 12:38:22,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:38:22,018 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2024-10-11 12:38:22,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 12:38:22,018 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2024-10-11 12:38:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 12:38:22,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:22,025 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:38:22,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:38:22,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:22,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1278455191, now seen corresponding path program 1 times [2024-10-11 12:38:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:38:22,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736176509] [2024-10-11 12:38:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:22,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:38:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:38:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:38:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:38:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:38:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:38:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:38:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 12:38:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:38:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 12:38:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:38:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:38:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:38:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 12:38:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:38:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 12:38:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 12:38:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 12:38:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 12:38:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 12:38:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 12:38:22,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:38:22,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736176509] [2024-10-11 12:38:22,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736176509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:38:22,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:38:22,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:38:22,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403582474] [2024-10-11 12:38:22,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:38:22,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:38:22,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:38:22,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:38:22,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:38:22,540 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 12:38:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:38:22,815 INFO L93 Difference]: Finished difference Result 180 states and 273 transitions. [2024-10-11 12:38:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:38:22,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 112 [2024-10-11 12:38:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:38:22,818 INFO L225 Difference]: With dead ends: 180 [2024-10-11 12:38:22,818 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 12:38:22,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:38:22,820 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 74 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:38:22,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 260 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:38:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 12:38:22,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 86. [2024-10-11 12:38:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 12:38:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-10-11 12:38:22,847 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 112 [2024-10-11 12:38:22,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:38:22,848 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-10-11 12:38:22,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 12:38:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-10-11 12:38:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 12:38:22,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:22,849 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:38:22,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:38:22,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:22,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:22,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1276608149, now seen corresponding path program 1 times [2024-10-11 12:38:22,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:38:22,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804094106] [2024-10-11 12:38:22,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:22,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:38:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:38:22,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [190216343] [2024-10-11 12:38:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:22,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:38:22,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:38:22,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:38:22,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:38:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:38:23,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:38:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:38:23,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:38:23,102 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:38:23,103 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:38:23,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 12:38:23,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:38:23,309 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 12:38:23,445 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:38:23,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:38:23 BoogieIcfgContainer [2024-10-11 12:38:23,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:38:23,449 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:38:23,449 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:38:23,449 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:38:23,450 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:38:21" (3/4) ... [2024-10-11 12:38:23,452 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:38:23,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:38:23,453 INFO L158 Benchmark]: Toolchain (without parser) took 3003.71ms. Allocated memory was 163.6MB in the beginning and 232.8MB in the end (delta: 69.2MB). Free memory was 124.1MB in the beginning and 201.3MB in the end (delta: -77.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:38:23,454 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:38:23,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.77ms. Allocated memory is still 163.6MB. Free memory was 124.1MB in the beginning and 110.0MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:38:23,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.18ms. Allocated memory is still 163.6MB. Free memory was 110.0MB in the beginning and 107.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:38:23,454 INFO L158 Benchmark]: Boogie Preprocessor took 38.88ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 104.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:38:23,455 INFO L158 Benchmark]: RCFGBuilder took 566.82ms. Allocated memory is still 163.6MB. Free memory was 104.2MB in the beginning and 119.4MB in the end (delta: -15.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 12:38:23,455 INFO L158 Benchmark]: TraceAbstraction took 2075.06ms. Allocated memory was 163.6MB in the beginning and 232.8MB in the end (delta: 69.2MB). Free memory was 118.7MB in the beginning and 201.3MB in the end (delta: -82.6MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2024-10-11 12:38:23,455 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 232.8MB. Free memory is still 201.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:38:23,457 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.13ms. Allocated memory is still 109.1MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.77ms. Allocated memory is still 163.6MB. Free memory was 124.1MB in the beginning and 110.0MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.18ms. Allocated memory is still 163.6MB. Free memory was 110.0MB in the beginning and 107.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.88ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 104.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 566.82ms. Allocated memory is still 163.6MB. Free memory was 104.2MB in the beginning and 119.4MB in the end (delta: -15.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2075.06ms. Allocated memory was 163.6MB in the beginning and 232.8MB in the end (delta: 69.2MB). Free memory was 118.7MB in the beginning and 201.3MB in the end (delta: -82.6MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 232.8MB. Free memory is still 201.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] signed short int var_1_4 = -64; [L24] signed short int var_1_5 = 256; [L25] unsigned short int var_1_6 = 128; [L26] signed short int var_1_7 = -128; [L27] unsigned short int var_1_8 = 16; [L28] unsigned short int var_1_9 = 256; [L29] signed long int var_1_10 = 128; [L30] unsigned short int var_1_11 = 47512; [L31] unsigned char var_1_12 = 16; [L32] unsigned char var_1_13 = 1; [L33] float var_1_14 = 5.5; [L34] float var_1_15 = 24.5; [L35] signed short int last_1_var_1_1 = 2; [L36] unsigned short int last_1_var_1_6 = 128; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] last_1_var_1_1 = var_1_1 [L95] last_1_var_1_6 = var_1_6 [L105] RET updateLastVariables() [L106] CALL updateVariables() [L64] var_1_4 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L65] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L66] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L66] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=256, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L67] var_1_5 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L68] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L69] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L69] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=-128, var_1_8=16, var_1_9=256] [L70] var_1_7 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_7 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L71] RET assume_abort_if_not(var_1_7 >= -32768) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L72] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L72] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L73] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L73] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=16, var_1_9=256] [L74] var_1_8 = __VERIFIER_nondet_ushort() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_9=256] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_9=256] [L76] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=256] [L76] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=256] [L77] var_1_9 = __VERIFIER_nondet_ushort() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=47512, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L80] var_1_11 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_11 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_11 <= 65535) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=16, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L83] var_1_12 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_12 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_12 <= 255) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L87] var_1_13 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_15=49/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L90] var_1_15 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L106] RET updateVariables() [L107] CALL step() [L40] signed long int stepLocal_1 = last_1_var_1_6; [L41] signed long int stepLocal_0 = last_1_var_1_6; VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_0=128, stepLocal_1=128, var_1_10=128, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L42] COND FALSE !(stepLocal_0 >= (var_1_11 - var_1_8)) [L53] var_1_10 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L55] COND FALSE !(! (var_1_10 <= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=128, var_1_7=3, var_1_8=0, var_1_9=0] [L58] COND TRUE var_1_4 > (var_1_10 / var_1_7) [L59] var_1_6 = (var_1_8 + var_1_9) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, stepLocal_1=128, var_1_10=2, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=11/2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=0, var_1_9=0] [L61] var_1_14 = var_1_15 [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((! (var_1_10 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && ((var_1_4 > (var_1_10 / var_1_7)) ? (var_1_6 == ((unsigned short int) (var_1_8 + var_1_9))) : 1)) && ((last_1_var_1_6 >= (var_1_11 - var_1_8)) ? (((var_1_7 / var_1_12) <= last_1_var_1_6) ? (var_1_10 == ((signed long int) ((last_1_var_1_6 - var_1_8) + -32))) : (var_1_13 ? (var_1_10 == ((signed long int) ((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))))) : (var_1_10 == ((signed long int) var_1_5)))) : (var_1_10 == ((signed long int) last_1_var_1_1)))) && (var_1_14 == ((float) var_1_15)) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=2, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, var_1_10=2, var_1_11=32767, var_1_12=4, var_1_13=1, var_1_14=2, var_1_15=2, var_1_1=2, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 324 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76 IncrementalHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 178 mSDtfsCounter, 76 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 51 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 448 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:38:23,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-67.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6785fbfa62719e2a16cb785f0dae7409fe6adec2e9b8c35426d44b08716a9a3e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:38:25,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:38:25,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:38:25,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:38:25,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:38:25,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:38:25,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:38:25,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:38:25,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:38:25,688 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:38:25,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:38:25,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:38:25,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:38:25,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:38:25,690 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:38:25,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:38:25,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:38:25,690 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:38:25,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:38:25,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:38:25,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:38:25,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:38:25,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:38:25,692 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:38:25,693 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:38:25,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:38:25,693 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:38:25,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:38:25,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:38:25,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:38:25,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:38:25,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:38:25,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:38:25,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:38:25,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:38:25,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:38:25,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:38:25,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:38:25,696 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:38:25,696 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:38:25,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:38:25,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:38:25,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:38:25,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:38:25,697 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:38:25,697 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 6785fbfa62719e2a16cb785f0dae7409fe6adec2e9b8c35426d44b08716a9a3e [2024-10-11 12:38:25,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:38:25,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:38:25,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:38:25,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:38:25,979 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:38:25,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-67.i [2024-10-11 12:38:27,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:38:27,717 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:38:27,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-67.i [2024-10-11 12:38:27,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/509ce1a2b/6b78b1fe8445437098a2e5f8cf5c201a/FLAGb5f4be027 [2024-10-11 12:38:28,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/509ce1a2b/6b78b1fe8445437098a2e5f8cf5c201a [2024-10-11 12:38:28,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:38:28,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:38:28,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:38:28,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:38:28,111 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:38:28,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17c46677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28, skipping insertion in model container [2024-10-11 12:38:28,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:38:28,352 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-67.i[915,928] [2024-10-11 12:38:28,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:38:28,413 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:38:28,424 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-67.i[915,928] [2024-10-11 12:38:28,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:38:28,468 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:38:28,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28 WrapperNode [2024-10-11 12:38:28,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:38:28,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:38:28,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:38:28,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:38:28,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,516 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-10-11 12:38:28,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:38:28,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:38:28,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:38:28,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:38:28,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,573 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]. [2024-10-11 12:38:28,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:38:28,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:38:28,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:38:28,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:38:28,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (1/1) ... [2024-10-11 12:38:28,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:38:28,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:38:28,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:38:28,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:38:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:38:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:38:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:38:28,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:38:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:38:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:38:28,753 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:38:28,755 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:38:29,088 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 12:38:29,091 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:38:29,178 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:38:29,180 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:38:29,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:38:29 BoogieIcfgContainer [2024-10-11 12:38:29,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:38:29,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:38:29,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:38:29,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:38:29,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:38:28" (1/3) ... [2024-10-11 12:38:29,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665e1fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:38:29, skipping insertion in model container [2024-10-11 12:38:29,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:38:28" (2/3) ... [2024-10-11 12:38:29,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665e1fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:38:29, skipping insertion in model container [2024-10-11 12:38:29,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:38:29" (3/3) ... [2024-10-11 12:38:29,189 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-67.i [2024-10-11 12:38:29,203 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:38:29,203 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:38:29,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:38:29,271 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;@77e20ecf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:38:29,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:38:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 12:38:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 12:38:29,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:29,287 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:38:29,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:29,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1682392043, now seen corresponding path program 1 times [2024-10-11 12:38:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:38:29,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094938884] [2024-10-11 12:38:29,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:29,309 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 [2024-10-11 12:38:29,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:38:29,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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) [2024-10-11 12:38:29,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 12:38:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:29,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:38:29,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:38:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-10-11 12:38:29,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:38:29,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:38:29,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094938884] [2024-10-11 12:38:29,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094938884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:38:29,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:38:29,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:38:29,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482533543] [2024-10-11 12:38:29,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:38:29,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:38:29,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:38:29,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:38:29,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:38:29,636 INFO L87 Difference]: Start difference. First operand has 46 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 12:38:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:38:29,694 INFO L93 Difference]: Finished difference Result 89 states and 161 transitions. [2024-10-11 12:38:29,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:38:29,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 112 [2024-10-11 12:38:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:38:29,712 INFO L225 Difference]: With dead ends: 89 [2024-10-11 12:38:29,713 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 12:38:29,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:38:29,719 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:38:29,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:38:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 12:38:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 12:38:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 12:38:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2024-10-11 12:38:29,769 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 112 [2024-10-11 12:38:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:38:29,770 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2024-10-11 12:38:29,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 12:38:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2024-10-11 12:38:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 12:38:29,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:29,773 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:38:29,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 12:38:29,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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 [2024-10-11 12:38:29,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:29,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1278455191, now seen corresponding path program 1 times [2024-10-11 12:38:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:38:29,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492334102] [2024-10-11 12:38:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:29,980 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 [2024-10-11 12:38:29,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:38:29,984 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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) [2024-10-11 12:38:29,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 12:38:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:30,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 12:38:30,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:38:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 12:38:30,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:38:30,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:38:30,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492334102] [2024-10-11 12:38:30,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492334102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:38:30,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:38:30,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:38:30,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462624613] [2024-10-11 12:38:30,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:38:30,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:38:30,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:38:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:38:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:38:30,445 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 12:38:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:38:30,878 INFO L93 Difference]: Finished difference Result 180 states and 273 transitions. [2024-10-11 12:38:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:38:30,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 112 [2024-10-11 12:38:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:38:30,886 INFO L225 Difference]: With dead ends: 180 [2024-10-11 12:38:30,886 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 12:38:30,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:38:30,888 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 71 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:38:30,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 260 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:38:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 12:38:30,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 86. [2024-10-11 12:38:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 12:38:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 133 transitions. [2024-10-11 12:38:30,911 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 133 transitions. Word has length 112 [2024-10-11 12:38:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:38:30,911 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 133 transitions. [2024-10-11 12:38:30,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 12:38:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 133 transitions. [2024-10-11 12:38:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 12:38:30,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:38:30,913 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:38:30,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 12:38:31,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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 [2024-10-11 12:38:31,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:38:31,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:38:31,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1276608149, now seen corresponding path program 1 times [2024-10-11 12:38:31,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:38:31,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52769468] [2024-10-11 12:38:31,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:38:31,119 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 [2024-10-11 12:38:31,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:38:31,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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) [2024-10-11 12:38:31,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 12:38:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:38:31,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 12:38:31,248 INFO L278 TraceCheckSpWp]: Computing forward predicates...