./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-88.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 f47940496008161a782f20a4338b252b7e8441d88b3ef3882a191d3af1981916 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:40:29,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:40:29,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:40:29,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:40:29,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:40:29,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:40:29,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:40:29,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:40:29,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:40:29,640 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:40:29,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:40:29,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:40:29,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:40:29,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:40:29,644 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:40:29,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:40:29,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:40:29,645 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:40:29,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:40:29,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:40:29,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:40:29,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:40:29,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:40:29,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:40:29,651 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:40:29,651 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:40:29,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:40:29,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:40:29,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:40:29,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:40:29,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:40:29,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:40:29,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:40:29,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:40:29,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:40:29,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:40:29,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:40:29,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:40:29,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:40:29,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:40:29,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:40:29,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:40:29,665 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 -> f47940496008161a782f20a4338b252b7e8441d88b3ef3882a191d3af1981916 [2024-10-24 10:40:29,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:40:29,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:40:29,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:40:29,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:40:29,965 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:40:29,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-88.i [2024-10-24 10:40:31,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:40:31,592 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:40:31,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-88.i [2024-10-24 10:40:31,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7080c1761/a4e3b173ed3b4fad87a80576772e526e/FLAG7d4f5aead [2024-10-24 10:40:31,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7080c1761/a4e3b173ed3b4fad87a80576772e526e [2024-10-24 10:40:31,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:40:31,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:40:31,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:40:31,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:40:31,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:40:31,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:31,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30aff9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:31, skipping insertion in model container [2024-10-24 10:40:31,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:40:31" (1/1) ... [2024-10-24 10:40:32,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:40:32,178 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-88.i[915,928] [2024-10-24 10:40:32,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:40:32,223 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:40:32,234 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-88.i[915,928] [2024-10-24 10:40:32,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:40:32,266 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:40:32,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32 WrapperNode [2024-10-24 10:40:32,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:40:32,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:40:32,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:40:32,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:40:32,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (1/1) ... [2024-10-24 10:40:32,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (1/1) ... [2024-10-24 10:40:32,308 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-24 10:40:32,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:40:32,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:40:32,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:40:32,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:40:32,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (1/1) ... [2024-10-24 10:40:32,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (1/1) ... [2024-10-24 10:40:32,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (1/1) ... [2024-10-24 10:40:32,341 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:40:32,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (1/1) ... [2024-10-24 10:40:32,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (1/1) ... [2024-10-24 10:40:32,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (1/1) ... [2024-10-24 10:40:32,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (1/1) ... [2024-10-24 10:40:32,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (1/1) ... [2024-10-24 10:40:32,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (1/1) ... [2024-10-24 10:40:32,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:40:32,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:40:32,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:40:32,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:40:32,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (1/1) ... [2024-10-24 10:40:32,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:40:32,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:40:32,400 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-10-24 10:40:32,403 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-10-24 10:40:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:40:32,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:40:32,449 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:40:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:40:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:40:32,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:40:32,514 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:40:32,516 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:40:32,750 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 10:40:32,751 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:40:32,802 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:40:32,803 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:40:32,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:32 BoogieIcfgContainer [2024-10-24 10:40:32,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:40:32,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:40:32,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:40:32,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:40:32,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:40:31" (1/3) ... [2024-10-24 10:40:32,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd7a5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:40:32, skipping insertion in model container [2024-10-24 10:40:32,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:32" (2/3) ... [2024-10-24 10:40:32,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd7a5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:40:32, skipping insertion in model container [2024-10-24 10:40:32,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:32" (3/3) ... [2024-10-24 10:40:32,816 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-88.i [2024-10-24 10:40:32,832 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:40:32,832 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:40:32,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:40:32,895 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;@4b3d8758, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:40:32,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:40:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 10:40:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 10:40:32,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:32,910 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:32,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:32,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:32,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1574968744, now seen corresponding path program 1 times [2024-10-24 10:40:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899099019] [2024-10-24 10:40:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:32,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:33,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:40:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:33,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:40:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:33,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:40:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:33,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:40:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:33,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:40:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:33,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:40:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:33,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:40:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:33,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:40:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:33,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:40:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 10:40:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:33,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:40:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 10:40:33,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:40:33,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899099019] [2024-10-24 10:40:33,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899099019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:33,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:33,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:40:33,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537778346] [2024-10-24 10:40:33,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:33,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:40:33,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:40:33,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:40:33,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:40:33,276 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 29 states have internal predecessors, (41), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 10:40:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:33,315 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2024-10-24 10:40:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:40:33,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2024-10-24 10:40:33,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:33,326 INFO L225 Difference]: With dead ends: 81 [2024-10-24 10:40:33,327 INFO L226 Difference]: Without dead ends: 40 [2024-10-24 10:40:33,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:40:33,333 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:33,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:40:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-24 10:40:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-24 10:40:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 10:40:33,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2024-10-24 10:40:33,373 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 72 [2024-10-24 10:40:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:33,374 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2024-10-24 10:40:33,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 10:40:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2024-10-24 10:40:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 10:40:33,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:33,379 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:33,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:40:33,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:33,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:33,382 INFO L85 PathProgramCache]: Analyzing trace with hash 576414038, now seen corresponding path program 1 times [2024-10-24 10:40:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:40:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701855237] [2024-10-24 10:40:33,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:33,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:40:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:40:33,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:40:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:40:33,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:40:33,756 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:40:33,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:40:33,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:40:33,763 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 10:40:33,835 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:40:33,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:40:33 BoogieIcfgContainer [2024-10-24 10:40:33,842 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:40:33,843 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:40:33,843 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:40:33,843 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:40:33,844 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:32" (3/4) ... [2024-10-24 10:40:33,846 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:40:33,847 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:40:33,850 INFO L158 Benchmark]: Toolchain (without parser) took 1878.41ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 126.9MB in the beginning and 212.8MB in the end (delta: -85.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:40:33,850 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:40:33,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.60ms. Allocated memory is still 184.5MB. Free memory was 126.5MB in the beginning and 113.0MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:40:33,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.71ms. Allocated memory is still 184.5MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:40:33,853 INFO L158 Benchmark]: Boogie Preprocessor took 51.77ms. Allocated memory is still 184.5MB. Free memory was 110.9MB in the beginning and 108.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:40:33,853 INFO L158 Benchmark]: RCFGBuilder took 441.51ms. Allocated memory is still 184.5MB. Free memory was 108.4MB in the beginning and 90.4MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 10:40:33,853 INFO L158 Benchmark]: TraceAbstraction took 1034.47ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 90.0MB in the beginning and 212.8MB in the end (delta: -122.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:40:33,856 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 257.9MB. Free memory is still 212.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:40:33,858 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.60ms. Allocated memory is still 184.5MB. Free memory was 126.5MB in the beginning and 113.0MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.71ms. Allocated memory is still 184.5MB. Free memory was 113.0MB in the beginning and 110.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.77ms. Allocated memory is still 184.5MB. Free memory was 110.9MB in the beginning and 108.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 441.51ms. Allocated memory is still 184.5MB. Free memory was 108.4MB in the beginning and 90.4MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1034.47ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 90.0MB in the beginning and 212.8MB in the end (delta: -122.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 257.9MB. Free memory is still 212.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of bitwiseOr at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -8; [L23] signed char var_1_10 = -64; [L24] unsigned char var_1_11 = 0; [L25] unsigned char var_1_12 = 0; [L26] unsigned char var_1_13 = 1; [L27] unsigned char var_1_14 = 0; [L28] unsigned char var_1_15 = 0; [L29] signed long int var_1_16 = -16; [L30] float var_1_17 = 3.5; [L31] float var_1_18 = 128.45; [L32] unsigned long int var_1_19 = 50; [L33] unsigned long int var_1_20 = 25; [L84] isInitial = 1 [L85] FCALL initially() [L86] COND TRUE 1 [L87] FCALL updateLastVariables() [L88] CALL updateVariables() [L59] var_1_10 = __VERIFIER_nondet_char() [L60] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L60] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L61] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L61] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L62] var_1_12 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L63] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L64] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L64] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L65] var_1_14 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L66] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L67] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L67] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L68] var_1_15 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L69] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L70] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L70] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_18=2569/20, var_1_19=50, var_1_1=-8, var_1_20=25] [L71] var_1_18 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=25] [L72] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=25] [L73] var_1_20 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8] [L74] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8] [L75] CALL assume_abort_if_not(var_1_20 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=4294967294] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=4294967294] [L75] RET assume_abort_if_not(var_1_20 <= 4294967294) VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=7/2, var_1_19=50, var_1_1=-8, var_1_20=4294967294] [L88] RET updateVariables() [L89] CALL step() [L37] var_1_13 = (var_1_14 && var_1_15) [L38] var_1_17 = var_1_18 [L39] var_1_19 = var_1_20 VAL [isInitial=1, var_1_10=126, var_1_11=0, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=-8, var_1_20=4294967294] [L40] COND TRUE (- (var_1_17 + var_1_17)) > var_1_17 [L41] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-16, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=-8, var_1_20=4294967294] [L43] var_1_16 = var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=-8, var_1_20=4294967294] [L44] EXPR var_1_16 | var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=-8, var_1_20=4294967294] [L44] COND FALSE !(((var_1_16 | var_1_19) > var_1_16) && var_1_11) [L55] var_1_1 = var_1_10 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=126, var_1_20=4294967294] [L89] RET step() [L90] CALL, EXPR property() [L80] EXPR var_1_16 | var_1_19 VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=126, var_1_20=4294967294] [L80-L81] return ((((((((var_1_16 | var_1_19) > var_1_16) && var_1_11) ? (((var_1_19 != -16) && (var_1_17 <= (var_1_17 + var_1_17))) ? ((var_1_17 > var_1_17) ? (var_1_1 == ((signed char) var_1_10)) : (var_1_1 == ((signed char) var_1_10))) : (var_1_1 == ((signed char) var_1_10))) : (var_1_1 == ((signed char) var_1_10))) && (((- (var_1_17 + var_1_17)) > var_1_17) ? (var_1_11 == ((unsigned char) var_1_12)) : 1)) && (var_1_13 == ((unsigned char) (var_1_14 && var_1_15)))) && (var_1_16 == ((signed long int) var_1_19))) && (var_1_17 == ((float) var_1_18))) && (var_1_19 == ((unsigned long int) var_1_20)) ; [L90] RET, EXPR property() [L90] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=126, var_1_20=4294967294] [L19] reach_error() VAL [isInitial=1, var_1_10=126, var_1_11=-256, var_1_12=-256, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=-2, var_1_17=4294967299, var_1_18=4294967299, var_1_19=4294967294, var_1_1=126, var_1_20=4294967294] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 55 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 71 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:40:33,902 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-88.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 f47940496008161a782f20a4338b252b7e8441d88b3ef3882a191d3af1981916 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:40:36,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:40:36,264 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:40:36,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:40:36,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:40:36,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:40:36,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:40:36,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:40:36,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:40:36,311 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:40:36,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:40:36,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:40:36,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:40:36,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:40:36,315 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:40:36,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:40:36,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:40:36,316 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:40:36,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:40:36,319 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:40:36,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:40:36,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:40:36,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:40:36,320 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:40:36,324 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:40:36,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:40:36,325 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:40:36,325 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:40:36,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:40:36,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:40:36,326 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:40:36,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:40:36,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:40:36,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:40:36,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:40:36,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:40:36,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:40:36,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:40:36,327 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:40:36,328 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:40:36,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:40:36,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:40:36,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:40:36,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:40:36,329 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:40:36,330 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 -> f47940496008161a782f20a4338b252b7e8441d88b3ef3882a191d3af1981916 [2024-10-24 10:40:36,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:40:36,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:40:36,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:40:36,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:40:36,706 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:40:36,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-88.i [2024-10-24 10:40:38,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:40:38,549 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:40:38,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-88.i [2024-10-24 10:40:38,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3898005d/b02a0b75e95c4fc793e70ff9272b1477/FLAGdb4289c1c [2024-10-24 10:40:38,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3898005d/b02a0b75e95c4fc793e70ff9272b1477 [2024-10-24 10:40:38,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:40:38,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:40:38,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:40:38,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:40:38,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:40:38,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:38,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65af0bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38, skipping insertion in model container [2024-10-24 10:40:38,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:38,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:40:38,782 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-88.i[915,928] [2024-10-24 10:40:38,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:40:38,865 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:40:38,881 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-88.i[915,928] [2024-10-24 10:40:38,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:40:38,923 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:40:38,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38 WrapperNode [2024-10-24 10:40:38,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:40:38,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:40:38,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:40:38,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:40:38,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:38,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:38,961 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-10-24 10:40:38,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:40:38,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:40:38,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:40:38,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:40:38,973 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:38,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:38,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:38,993 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:40:38,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:38,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:39,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:39,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:39,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:39,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:39,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:40:39,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:40:39,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:40:39,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:40:39,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (1/1) ... [2024-10-24 10:40:39,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:40:39,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:40:39,052 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-10-24 10:40:39,054 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-10-24 10:40:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:40:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:40:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:40:39,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:40:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:40:39,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:40:39,156 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:40:39,159 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:40:39,557 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:40:39,557 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:40:39,633 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:40:39,634 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:40:39,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:39 BoogieIcfgContainer [2024-10-24 10:40:39,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:40:39,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:40:39,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:40:39,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:40:39,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:40:38" (1/3) ... [2024-10-24 10:40:39,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295fbdd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:40:39, skipping insertion in model container [2024-10-24 10:40:39,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:40:38" (2/3) ... [2024-10-24 10:40:39,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295fbdd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:40:39, skipping insertion in model container [2024-10-24 10:40:39,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:39" (3/3) ... [2024-10-24 10:40:39,648 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-88.i [2024-10-24 10:40:39,664 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:40:39,664 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:40:39,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:40:39,773 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;@120fd7a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:40:39,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:40:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 10:40:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 10:40:39,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:39,789 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:39,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:39,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:39,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1794176218, now seen corresponding path program 1 times [2024-10-24 10:40:39,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:40:39,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558366297] [2024-10-24 10:40:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:39,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:40:39,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:40:39,815 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-10-24 10:40:39,817 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-10-24 10:40:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:39,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:40:39,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:40:40,035 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-24 10:40:40,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:40:40,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:40:40,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558366297] [2024-10-24 10:40:40,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558366297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:40:40,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:40:40,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:40:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927140459] [2024-10-24 10:40:40,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:40,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:40:40,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:40:40,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:40:40,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:40:40,076 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 10:40:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:40,147 INFO L93 Difference]: Finished difference Result 67 states and 113 transitions. [2024-10-24 10:40:40,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:40:40,153 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 69 [2024-10-24 10:40:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:40,160 INFO L225 Difference]: With dead ends: 67 [2024-10-24 10:40:40,161 INFO L226 Difference]: Without dead ends: 33 [2024-10-24 10:40:40,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:40:40,169 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:40,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:40:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-24 10:40:40,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-24 10:40:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 10:40:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-10-24 10:40:40,217 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 69 [2024-10-24 10:40:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:40,218 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-10-24 10:40:40,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 10:40:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-10-24 10:40:40,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 10:40:40,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:40,222 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:40,229 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-10-24 10:40:40,423 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-10-24 10:40:40,423 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:40,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash 191366812, now seen corresponding path program 1 times [2024-10-24 10:40:40,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:40:40,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605860085] [2024-10-24 10:40:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:40,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:40:40,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:40:40,429 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-10-24 10:40:40,431 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-10-24 10:40:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:40,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 10:40:40,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:40:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-24 10:40:43,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:40:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 10:40:48,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:40:48,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605860085] [2024-10-24 10:40:48,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605860085] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 10:40:48,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 10:40:48,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-10-24 10:40:48,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783606872] [2024-10-24 10:40:48,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:40:48,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:40:48,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:40:48,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:40:48,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-24 10:40:48,028 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 10:40:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:40:49,755 INFO L93 Difference]: Finished difference Result 82 states and 110 transitions. [2024-10-24 10:40:49,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 10:40:49,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 69 [2024-10-24 10:40:49,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:40:49,759 INFO L225 Difference]: With dead ends: 82 [2024-10-24 10:40:49,759 INFO L226 Difference]: Without dead ends: 50 [2024-10-24 10:40:49,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-10-24 10:40:49,761 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:40:49,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 109 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 10:40:49,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-24 10:40:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-10-24 10:40:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 10:40:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-10-24 10:40:49,776 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 69 [2024-10-24 10:40:49,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:40:49,777 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-10-24 10:40:49,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 10:40:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-10-24 10:40:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 10:40:49,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:40:49,779 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:40:49,786 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-24 10:40:49,980 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-10-24 10:40:49,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:40:49,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:40:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash 248625114, now seen corresponding path program 1 times [2024-10-24 10:40:49,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:40:49,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285289812] [2024-10-24 10:40:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:49,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:40:49,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:40:49,985 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-10-24 10:40:49,986 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-10-24 10:40:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:50,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 10:40:50,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:40:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 149 proven. 24 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-24 10:40:52,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:40:56,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:40:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285289812] [2024-10-24 10:40:56,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285289812] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:40:56,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [73762359] [2024-10-24 10:40:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:40:56,913 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 10:40:56,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 10:40:56,915 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 10:40:56,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-24 10:40:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:40:57,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 10:40:57,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:41:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 158 proven. 30 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 10:41:01,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:41:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-24 10:41:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [73762359] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:41:07,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 10:41:07,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22, 10] total 40 [2024-10-24 10:41:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318120286] [2024-10-24 10:41:07,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 10:41:07,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-24 10:41:07,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:41:07,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-24 10:41:07,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1654, Unknown=0, NotChecked=0, Total=1980 [2024-10-24 10:41:07,438 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 38 states have internal predecessors, (74), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2024-10-24 10:41:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:41:19,499 INFO L93 Difference]: Finished difference Result 170 states and 193 transitions. [2024-10-24 10:41:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-24 10:41:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 38 states have internal predecessors, (74), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) Word has length 69 [2024-10-24 10:41:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:41:19,501 INFO L225 Difference]: With dead ends: 170 [2024-10-24 10:41:19,501 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:41:19,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2909 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=1855, Invalid=8045, Unknown=0, NotChecked=0, Total=9900 [2024-10-24 10:41:19,506 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 96 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-24 10:41:19,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 282 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-24 10:41:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:41:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:41:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 10:41:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:41:19,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2024-10-24 10:41:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:41:19,509 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:41:19,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 38 states have internal predecessors, (74), 10 states have call successors, (28), 9 states have call predecessors, (28), 13 states have return successors, (29), 10 states have call predecessors, (29), 10 states have call successors, (29) [2024-10-24 10:41:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:41:19,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:41:19,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:41:19,520 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 (4)] Ended with exit code 0 [2024-10-24 10:41:19,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-10-24 10:41:19,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 10:41:19,920 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 10:41:19,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:41:30,678 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:41:30,692 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,693 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,693 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,693 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,693 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-24 10:41:30,693 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-24 10:41:30,694 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,694 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,694 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:41:30,715 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-24 10:41:30,716 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-24 10:41:30,717 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-24 10:41:30,717 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,717 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,717 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:41:30,718 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-24 10:41:30,719 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,719 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:41:30,720 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,721 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:41:30,721 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-24 10:41:30,721 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-24 10:41:30,721 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-24 10:41:30,722 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,722 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,722 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:41:30,722 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-10-24 10:41:30,724 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,725 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:41:30,725 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:41:30,725 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:41:30,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:41:30 BoogieIcfgContainer [2024-10-24 10:41:30,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:41:30,733 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:41:30,733 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:41:30,733 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:41:30,734 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:40:39" (3/4) ... [2024-10-24 10:41:30,736 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:41:30,740 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:41:30,746 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 10:41:30,747 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-24 10:41:30,747 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:41:30,748 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:41:30,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:41:30,854 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:41:30,854 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:41:30,855 INFO L158 Benchmark]: Toolchain (without parser) took 52283.12ms. Allocated memory was 79.7MB in the beginning and 159.4MB in the end (delta: 79.7MB). Free memory was 45.8MB in the beginning and 106.1MB in the end (delta: -60.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 10:41:30,855 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 79.7MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:41:30,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.29ms. Allocated memory is still 79.7MB. Free memory was 45.6MB in the beginning and 56.9MB in the end (delta: -11.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-10-24 10:41:30,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.82ms. Allocated memory is still 79.7MB. Free memory was 56.9MB in the beginning and 55.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:41:30,856 INFO L158 Benchmark]: Boogie Preprocessor took 55.08ms. Allocated memory is still 79.7MB. Free memory was 55.3MB in the beginning and 52.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:41:30,857 INFO L158 Benchmark]: RCFGBuilder took 616.84ms. Allocated memory is still 79.7MB. Free memory was 52.5MB in the beginning and 34.9MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 10:41:30,857 INFO L158 Benchmark]: TraceAbstraction took 51093.01ms. Allocated memory was 79.7MB in the beginning and 159.4MB in the end (delta: 79.7MB). Free memory was 34.3MB in the beginning and 111.4MB in the end (delta: -77.1MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. [2024-10-24 10:41:30,857 INFO L158 Benchmark]: Witness Printer took 121.68ms. Allocated memory is still 159.4MB. Free memory was 111.4MB in the beginning and 106.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:41:30,859 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.29ms. Allocated memory is still 79.7MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.29ms. Allocated memory is still 79.7MB. Free memory was 45.6MB in the beginning and 56.9MB in the end (delta: -11.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.82ms. Allocated memory is still 79.7MB. Free memory was 56.9MB in the beginning and 55.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.08ms. Allocated memory is still 79.7MB. Free memory was 55.3MB in the beginning and 52.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 616.84ms. Allocated memory is still 79.7MB. Free memory was 52.5MB in the beginning and 34.9MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 51093.01ms. Allocated memory was 79.7MB in the beginning and 159.4MB in the end (delta: 79.7MB). Free memory was 34.3MB in the beginning and 111.4MB in the end (delta: -77.1MB). Peak memory consumption was 71.7MB. Max. memory is 16.1GB. * Witness Printer took 121.68ms. Allocated memory is still 159.4MB. Free memory was 111.4MB in the beginning and 106.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.2s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 434 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 298 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 909 IncrementalHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 136 mSDtfsCounter, 909 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 487 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2947 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=2, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 24.7s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 3453 SizeOfPredicates, 47 NumberOfNonLiveVariables, 478 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1254/1320 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((0 == var_1_11) && (var_1_12 <= 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((0 == var_1_11) || ((0 == var_1_11) && (var_1_12 <= 0))) || ((((((var_1_15 <= 1) && (0 == var_1_11)) && (var_1_14 >= 1)) && (var_1_14 <= 1)) && (var_1_12 <= 0)) && (var_1_15 >= 1))) Ensures: (((0 != cond) && (((0 == var_1_11) || ((0 == var_1_11) && (var_1_12 <= 0))) || ((((((var_1_15 <= 1) && (0 == var_1_11)) && (var_1_14 >= 1)) && (var_1_14 <= 1)) && (var_1_12 <= 0)) && (var_1_15 >= 1)))) && (((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (var_1_20 == \old(var_1_20)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:41:30,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE