./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 5fdfeb035fc720c7508db6c2fc50925f9388f49a7099d6826b0d08b54f402c28 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:57:46,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:57:47,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:57:47,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:57:47,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:57:47,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:57:47,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:57:47,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:57:47,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:57:47,055 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:57:47,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:57:47,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:57:47,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:57:47,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:57:47,059 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:57:47,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:57:47,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:57:47,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:57:47,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:57:47,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:57:47,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:57:47,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:57:47,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:57:47,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:57:47,066 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:57:47,066 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:57:47,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:57:47,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:57:47,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:57:47,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:57:47,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:57:47,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:57:47,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:57:47,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:57:47,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:57:47,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:57:47,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:57:47,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:57:47,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:57:47,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:57:47,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:57:47,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:57:47,072 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/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/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 -> 5fdfeb035fc720c7508db6c2fc50925f9388f49a7099d6826b0d08b54f402c28 [2024-11-08 23:57:47,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:57:47,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:57:47,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:57:47,370 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:57:47,372 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:57:47,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i [2024-11-08 23:57:48,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:57:49,115 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:57:49,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i [2024-11-08 23:57:49,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10509dde4/4aa0fdff962145cfabc90560b7b6f279/FLAG15e11fd7a [2024-11-08 23:57:49,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10509dde4/4aa0fdff962145cfabc90560b7b6f279 [2024-11-08 23:57:49,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:57:49,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:57:49,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:57:49,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:57:49,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:57:49,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:49,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2cdd1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49, skipping insertion in model container [2024-11-08 23:57:49,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:49,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:57:49,744 WARN L250 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_loopvsstraightlinecode_25-while_file-89.i[915,928] [2024-11-08 23:57:49,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:57:49,825 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:57:49,839 WARN L250 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_loopvsstraightlinecode_25-while_file-89.i[915,928] [2024-11-08 23:57:49,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:57:49,901 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:57:49,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49 WrapperNode [2024-11-08 23:57:49,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:57:49,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:57:49,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:57:49,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:57:49,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:49,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:49,967 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-11-08 23:57:49,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:57:49,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:57:49,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:57:49,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:57:49,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:49,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:49,991 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:50,017 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-11-08 23:57:50,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:50,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:50,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:50,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:50,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:50,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:50,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:57:50,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:57:50,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:57:50,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:57:50,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (1/1) ... [2024-11-08 23:57:50,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:57:50,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:57:50,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:57:50,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:57:50,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:57:50,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:57:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:57:50,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:57:50,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:57:50,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:57:50,297 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:57:50,299 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:57:50,571 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 23:57:50,571 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:57:50,584 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:57:50,585 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:57:50,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:50 BoogieIcfgContainer [2024-11-08 23:57:50,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:57:50,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:57:50,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:57:50,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:57:50,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:57:49" (1/3) ... [2024-11-08 23:57:50,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417b8e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:57:50, skipping insertion in model container [2024-11-08 23:57:50,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:49" (2/3) ... [2024-11-08 23:57:50,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417b8e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:57:50, skipping insertion in model container [2024-11-08 23:57:50,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:50" (3/3) ... [2024-11-08 23:57:50,596 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-89.i [2024-11-08 23:57:50,611 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:57:50,612 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:57:50,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:57:50,673 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;@402d668d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:57:50,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:57:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 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-11-08 23:57:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:57:50,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:50,692 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:57:50,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:50,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:50,697 INFO L85 PathProgramCache]: Analyzing trace with hash -616309307, now seen corresponding path program 1 times [2024-11-08 23:57:50,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:50,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201556802] [2024-11-08 23:57:50,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:50,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:50,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:50,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:50,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:50,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:57:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:50,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:57:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:57:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:57:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:57:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:57:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:57:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:57:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:57:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:57:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:57:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:57:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:57:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-08 23:57:51,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:51,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201556802] [2024-11-08 23:57:51,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201556802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:57:51,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:57:51,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:57:51,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149542014] [2024-11-08 23:57:51,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:57:51,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:57:51,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:51,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:57:51,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:57:51,132 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-11-08 23:57:51,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:51,164 INFO L93 Difference]: Finished difference Result 101 states and 169 transitions. [2024-11-08 23:57:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:57:51,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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 120 [2024-11-08 23:57:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:51,175 INFO L225 Difference]: With dead ends: 101 [2024-11-08 23:57:51,175 INFO L226 Difference]: Without dead ends: 50 [2024-11-08 23:57:51,179 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-11-08 23:57:51,186 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:51,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:57:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-08 23:57:51,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-08 23:57:51,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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-11-08 23:57:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2024-11-08 23:57:51,247 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 120 [2024-11-08 23:57:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:51,248 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2024-11-08 23:57:51,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-11-08 23:57:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2024-11-08 23:57:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:57:51,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:51,253 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:57:51,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:57:51,254 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:51,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1833128139, now seen corresponding path program 1 times [2024-11-08 23:57:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:51,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166752229] [2024-11-08 23:57:51,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:57:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:57:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:57:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:57:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 23:57:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:57:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 23:57:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:51,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:57:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:57:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:57:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 23:57:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:57:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 23:57:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 23:57:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 23:57:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 23:57:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 23:57:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 23:57:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:57:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-08 23:57:52,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:57:52,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166752229] [2024-11-08 23:57:52,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166752229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:57:52,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213604303] [2024-11-08 23:57:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:52,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:57:52,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:57:52,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:57:52,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:57:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:57:52,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 23:57:52,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:57:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 27 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-11-08 23:57:52,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:57:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-08 23:57:52,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213604303] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:57:52,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:57:52,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-08 23:57:52,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251660325] [2024-11-08 23:57:52,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:57:52,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 23:57:52,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:57:52,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 23:57:52,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:57:52,787 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 23:57:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:57:53,027 INFO L93 Difference]: Finished difference Result 103 states and 144 transitions. [2024-11-08 23:57:53,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:57:53,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 120 [2024-11-08 23:57:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:57:53,031 INFO L225 Difference]: With dead ends: 103 [2024-11-08 23:57:53,032 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 23:57:53,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 273 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:57:53,034 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:57:53,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 137 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:57:53,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 23:57:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2024-11-08 23:57:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 23:57:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-08 23:57:53,063 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 120 [2024-11-08 23:57:53,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:57:53,064 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-08 23:57:53,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 23:57:53,065 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-08 23:57:53,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:57:53,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:57:53,068 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:57:53,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:57:53,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:57:53,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:57:53,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:57:53,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1831281097, now seen corresponding path program 1 times [2024-11-08 23:57:53,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:57:53,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265279230] [2024-11-08 23:57:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:53,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:57:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:57:53,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1765554064] [2024-11-08 23:57:53,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:57:53,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:57:53,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:57:53,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:57:53,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:57:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:57:53,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:57:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:57:53,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:57:53,590 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:57:53,592 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:57:53,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:57:53,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-08 23:57:53,797 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 23:57:53,870 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:57:53,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:57:53 BoogieIcfgContainer [2024-11-08 23:57:53,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:57:53,875 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:57:53,875 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:57:53,875 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:57:53,875 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:50" (3/4) ... [2024-11-08 23:57:53,878 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:57:53,879 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:57:53,880 INFO L158 Benchmark]: Toolchain (without parser) took 4371.95ms. Allocated memory is still 188.7MB. Free memory was 120.1MB in the beginning and 98.6MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-08 23:57:53,882 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 104.9MB. Free memory was 75.8MB in the beginning and 75.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:57:53,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.26ms. Allocated memory is still 188.7MB. Free memory was 120.1MB in the beginning and 105.6MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 23:57:53,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.63ms. Allocated memory is still 188.7MB. Free memory was 105.6MB in the beginning and 102.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:57:53,885 INFO L158 Benchmark]: Boogie Preprocessor took 71.14ms. Allocated memory is still 188.7MB. Free memory was 102.6MB in the beginning and 99.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:57:53,885 INFO L158 Benchmark]: RCFGBuilder took 544.58ms. Allocated memory is still 188.7MB. Free memory was 99.2MB in the beginning and 144.2MB in the end (delta: -45.0MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-08 23:57:53,885 INFO L158 Benchmark]: TraceAbstraction took 3286.10ms. Allocated memory is still 188.7MB. Free memory was 143.7MB in the beginning and 99.7MB in the end (delta: 44.0MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-11-08 23:57:53,886 INFO L158 Benchmark]: Witness Printer took 5.22ms. Allocated memory is still 188.7MB. Free memory was 99.7MB in the beginning and 98.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:57:53,888 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 104.9MB. Free memory was 75.8MB in the beginning and 75.7MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.26ms. Allocated memory is still 188.7MB. Free memory was 120.1MB in the beginning and 105.6MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.63ms. Allocated memory is still 188.7MB. Free memory was 105.6MB in the beginning and 102.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.14ms. Allocated memory is still 188.7MB. Free memory was 102.6MB in the beginning and 99.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 544.58ms. Allocated memory is still 188.7MB. Free memory was 99.2MB in the beginning and 144.2MB in the end (delta: -45.0MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3286.10ms. Allocated memory is still 188.7MB. Free memory was 143.7MB in the beginning and 99.7MB in the end (delta: 44.0MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 5.22ms. Allocated memory is still 188.7MB. Free memory was 99.7MB in the beginning and 98.6MB in the end (delta: 1.0MB). 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 someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someUnaryDOUBLEoperation at line 31, overapproximation of someBinaryArithmeticDOUBLEoperation at line 52. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 5; [L24] unsigned char var_1_3 = 4; [L25] signed long int var_1_4 = -256; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] double var_1_9 = 9.5; [L31] double var_1_10 = -0.4; [L32] double var_1_11 = 31.5; [L33] double var_1_12 = 16.25; [L34] double var_1_13 = 127.5; [L35] double var_1_14 = 100000.5; VAL [isInitial=0, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_2=5, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L59] var_1_3 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L60] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L63] var_1_4 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L64] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L67] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L70] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_8=0, var_1_9=19/2] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_8=0, var_1_9=19/2] [L74] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L74] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L75] var_1_8 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_9=19/2] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_9=19/2] [L77] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L77] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L78] var_1_10 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L79] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L80] var_1_12 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L81] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L82] var_1_13 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L83] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L84] var_1_14 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L85] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L98] RET updateVariables() [L99] CALL step() [L39] COND TRUE (var_1_2 / var_1_3) >= var_1_4 [L40] var_1_1 = (var_1_5 && var_1_6) VAL [isInitial=1, var_1_11=63/2, var_1_1=1, var_1_2=-251, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L44] unsigned char stepLocal_0 = (var_1_6 && var_1_8) || (var_1_2 >= 5); VAL [isInitial=1, stepLocal_0=1, var_1_11=63/2, var_1_1=1, var_1_2=-251, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=19/2] [L45] COND TRUE stepLocal_0 && (var_1_3 < var_1_4) [L46] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=63/2, var_1_1=1, var_1_2=-251, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=2] [L50] unsigned char stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_1=-255, var_1_10=2, var_1_11=63/2, var_1_1=1, var_1_2=-251, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=2] [L51] COND TRUE (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || stepLocal_1 [L52] var_1_11 = (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14) VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=-251, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=2] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return ((((var_1_2 / var_1_3) >= var_1_4) ? (var_1_1 == ((unsigned char) (var_1_5 && var_1_6))) : (var_1_1 == ((unsigned char) ((var_1_3 >= var_1_2) && (var_1_7 || var_1_8))))) && ((((var_1_6 && var_1_8) || (var_1_2 >= 5)) && (var_1_3 < var_1_4)) ? (var_1_9 == ((double) var_1_10)) : (var_1_9 == ((double) var_1_10)))) && (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || var_1_6) ? (var_1_11 == ((double) (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=2, var_1_1=1, var_1_2=-251, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=2] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=-251, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=-251, var_1_3=1, var_1_4=2, var_1_5=1, var_1_6=-255, var_1_7=0, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 208 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 115 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 332 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 600 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 476 ConstructedInterpolants, 0 QuantifiedInterpolants, 938 SizeOfPredicates, 1 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 2655/2736 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-11-08 23:57:53,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 5fdfeb035fc720c7508db6c2fc50925f9388f49a7099d6826b0d08b54f402c28 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:57:56,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:57:56,254 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:57:56,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:57:56,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:57:56,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:57:56,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:57:56,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:57:56,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:57:56,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:57:56,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:57:56,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:57:56,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:57:56,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:57:56,295 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:57:56,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:57:56,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:57:56,296 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:57:56,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:57:56,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:57:56,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:57:56,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:57:56,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:57:56,302 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:57:56,303 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:57:56,303 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:57:56,303 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:57:56,304 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:57:56,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:57:56,304 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:57:56,304 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:57:56,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:57:56,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:57:56,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:57:56,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:57:56,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:57:56,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:57:56,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:57:56,323 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:57:56,323 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:57:56,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:57:56,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:57:56,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:57:56,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:57:56,324 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/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/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 -> 5fdfeb035fc720c7508db6c2fc50925f9388f49a7099d6826b0d08b54f402c28 [2024-11-08 23:57:56,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:57:56,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:57:56,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:57:56,696 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:57:56,697 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:57:56,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i [2024-11-08 23:57:58,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:57:58,455 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:57:58,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i [2024-11-08 23:57:58,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4eb6d69/123c62c4df29416cbd666c176b9b4b5c/FLAGe28d36977 [2024-11-08 23:57:58,486 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4eb6d69/123c62c4df29416cbd666c176b9b4b5c [2024-11-08 23:57:58,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:57:58,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:57:58,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:57:58,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:57:58,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:57:58,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:58,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789ea36d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58, skipping insertion in model container [2024-11-08 23:57:58,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:58,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:57:58,725 WARN L250 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_loopvsstraightlinecode_25-while_file-89.i[915,928] [2024-11-08 23:57:58,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:57:58,810 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:57:58,822 WARN L250 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_loopvsstraightlinecode_25-while_file-89.i[915,928] [2024-11-08 23:57:58,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:57:58,880 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:57:58,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58 WrapperNode [2024-11-08 23:57:58,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:57:58,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:57:58,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:57:58,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:57:58,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:58,911 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:58,947 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-08 23:57:58,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:57:58,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:57:58,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:57:58,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:57:58,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:58,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:58,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:58,997 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-11-08 23:57:58,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:58,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:59,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:59,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:59,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:59,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:59,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:57:59,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:57:59,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:57:59,017 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:57:59,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (1/1) ... [2024-11-08 23:57:59,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:57:59,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:57:59,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:57:59,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:57:59,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:57:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:57:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:57:59,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:57:59,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:57:59,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:57:59,220 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:57:59,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:57:59,922 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 23:57:59,923 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:57:59,941 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:57:59,943 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:57:59,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:59 BoogieIcfgContainer [2024-11-08 23:57:59,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:57:59,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:57:59,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:57:59,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:57:59,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:57:58" (1/3) ... [2024-11-08 23:57:59,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e63d99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:57:59, skipping insertion in model container [2024-11-08 23:57:59,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:57:58" (2/3) ... [2024-11-08 23:57:59,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e63d99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:57:59, skipping insertion in model container [2024-11-08 23:57:59,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:57:59" (3/3) ... [2024-11-08 23:57:59,956 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-89.i [2024-11-08 23:57:59,975 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:57:59,975 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:58:00,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:58:00,071 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;@2c6a008b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:58:00,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:58:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 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-11-08 23:58:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:58:00,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:58:00,092 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:58:00,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:58:00,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:58:00,099 INFO L85 PathProgramCache]: Analyzing trace with hash -616309307, now seen corresponding path program 1 times [2024-11-08 23:58:00,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:58:00,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626567920] [2024-11-08 23:58:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:58:00,116 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-11-08 23:58:00,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:58:00,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-11-08 23:58:00,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 23:58:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:58:00,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:58:00,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:58:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-11-08 23:58:00,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:58:00,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:58:00,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626567920] [2024-11-08 23:58:00,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626567920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:58:00,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:58:00,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:58:00,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641683525] [2024-11-08 23:58:00,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:58:00,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:58:00,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:58:00,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:58:00,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:58:00,490 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-11-08 23:58:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:58:00,515 INFO L93 Difference]: Finished difference Result 101 states and 169 transitions. [2024-11-08 23:58:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:58:00,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (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 120 [2024-11-08 23:58:00,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:58:00,525 INFO L225 Difference]: With dead ends: 101 [2024-11-08 23:58:00,526 INFO L226 Difference]: Without dead ends: 50 [2024-11-08 23:58:00,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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-11-08 23:58:00,533 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:58:00,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:58:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-08 23:58:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-08 23:58:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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-11-08 23:58:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2024-11-08 23:58:00,590 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 120 [2024-11-08 23:58:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:58:00,590 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2024-11-08 23:58:00,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (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-11-08 23:58:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2024-11-08 23:58:00,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:58:00,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:58:00,597 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:58:00,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 23:58:00,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-11-08 23:58:00,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:58:00,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:58:00,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1833128139, now seen corresponding path program 1 times [2024-11-08 23:58:00,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:58:00,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354714673] [2024-11-08 23:58:00,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:58:00,803 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-11-08 23:58:00,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:58:00,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-11-08 23:58:00,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 23:58:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:58:01,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 23:58:01,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:58:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 371 proven. 48 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-08 23:58:01,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:58:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-08 23:58:01,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:58:01,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354714673] [2024-11-08 23:58:01,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354714673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:58:01,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:58:01,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-08 23:58:01,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709336916] [2024-11-08 23:58:01,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:58:01,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:58:01,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:58:01,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:58:01,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:58:01,903 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-08 23:58:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:58:03,053 INFO L93 Difference]: Finished difference Result 107 states and 147 transitions. [2024-11-08 23:58:03,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 23:58:03,067 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 120 [2024-11-08 23:58:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:58:03,069 INFO L225 Difference]: With dead ends: 107 [2024-11-08 23:58:03,069 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 23:58:03,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-11-08 23:58:03,072 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 45 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:58:03,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 204 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 23:58:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 23:58:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-11-08 23:58:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-08 23:58:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-11-08 23:58:03,086 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 120 [2024-11-08 23:58:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:58:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-11-08 23:58:03,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-08 23:58:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-11-08 23:58:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 23:58:03,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:58:03,090 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:58:03,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 23:58:03,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-11-08 23:58:03,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:58:03,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:58:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1831281097, now seen corresponding path program 1 times [2024-11-08 23:58:03,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:58:03,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550677075] [2024-11-08 23:58:03,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:58:03,297 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-11-08 23:58:03,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:58:03,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-11-08 23:58:03,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 23:58:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:58:03,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 23:58:03,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:58:56,627 WARN L286 SmtUtils]: Spent 21.30s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)