./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-51.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 8881431080bff9c322b0e4eff72d7ca44eac9c56f32aea07a4797c61348c368a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 11:52:18,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 11:52:19,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 11:52:19,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 11:52:19,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 11:52:19,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 11:52:19,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 11:52:19,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 11:52:19,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 11:52:19,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 11:52:19,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 11:52:19,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 11:52:19,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 11:52:19,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 11:52:19,073 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 11:52:19,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 11:52:19,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 11:52:19,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 11:52:19,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 11:52:19,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 11:52:19,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 11:52:19,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 11:52:19,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 11:52:19,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 11:52:19,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 11:52:19,079 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 11:52:19,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 11:52:19,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 11:52:19,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 11:52:19,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 11:52:19,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 11:52:19,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 11:52:19,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:52:19,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 11:52:19,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 11:52:19,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 11:52:19,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 11:52:19,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 11:52:19,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 11:52:19,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 11:52:19,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 11:52:19,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 11:52:19,088 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 -> 8881431080bff9c322b0e4eff72d7ca44eac9c56f32aea07a4797c61348c368a [2024-11-22 11:52:19,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 11:52:19,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 11:52:19,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 11:52:19,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 11:52:19,313 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 11:52:19,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-51.i [2024-11-22 11:52:20,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 11:52:20,863 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 11:52:20,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-51.i [2024-11-22 11:52:20,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515ad5ee3/c978181c100e45e780472b9e9a1f7276/FLAGd05eccfef [2024-11-22 11:52:20,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/515ad5ee3/c978181c100e45e780472b9e9a1f7276 [2024-11-22 11:52:20,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 11:52:20,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 11:52:20,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 11:52:20,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 11:52:20,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 11:52:20,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:52:20" (1/1) ... [2024-11-22 11:52:20,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b39a265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:20, skipping insertion in model container [2024-11-22 11:52:20,891 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:52:20" (1/1) ... [2024-11-22 11:52:20,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 11:52:21,064 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-51.i[915,928] [2024-11-22 11:52:21,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:52:21,139 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 11:52:21,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-51.i[915,928] [2024-11-22 11:52:21,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:52:21,204 INFO L204 MainTranslator]: Completed translation [2024-11-22 11:52:21,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21 WrapperNode [2024-11-22 11:52:21,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 11:52:21,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 11:52:21,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 11:52:21,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 11:52:21,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (1/1) ... [2024-11-22 11:52:21,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (1/1) ... [2024-11-22 11:52:21,291 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-22 11:52:21,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 11:52:21,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 11:52:21,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 11:52:21,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 11:52:21,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (1/1) ... [2024-11-22 11:52:21,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (1/1) ... [2024-11-22 11:52:21,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (1/1) ... [2024-11-22 11:52:21,319 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 11:52:21,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (1/1) ... [2024-11-22 11:52:21,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (1/1) ... [2024-11-22 11:52:21,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (1/1) ... [2024-11-22 11:52:21,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (1/1) ... [2024-11-22 11:52:21,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (1/1) ... [2024-11-22 11:52:21,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (1/1) ... [2024-11-22 11:52:21,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 11:52:21,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 11:52:21,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 11:52:21,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 11:52:21,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (1/1) ... [2024-11-22 11:52:21,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:52:21,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:52:21,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 11:52:21,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 11:52:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 11:52:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 11:52:21,414 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 11:52:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 11:52:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 11:52:21,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 11:52:21,474 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 11:52:21,478 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 11:52:21,696 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-22 11:52:21,697 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 11:52:21,710 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 11:52:21,711 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 11:52:21,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:52:21 BoogieIcfgContainer [2024-11-22 11:52:21,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 11:52:21,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 11:52:21,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 11:52:21,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 11:52:21,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:52:20" (1/3) ... [2024-11-22 11:52:21,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe0b7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:52:21, skipping insertion in model container [2024-11-22 11:52:21,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:21" (2/3) ... [2024-11-22 11:52:21,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe0b7b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:52:21, skipping insertion in model container [2024-11-22 11:52:21,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:52:21" (3/3) ... [2024-11-22 11:52:21,720 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-51.i [2024-11-22 11:52:21,734 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 11:52:21,734 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 11:52:21,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 11:52:21,804 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;@4ae2291d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 11:52:21,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 11:52:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 11:52:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-22 11:52:21,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:52:21,818 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:52:21,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:52:21,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:52:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2079178925, now seen corresponding path program 1 times [2024-11-22 11:52:21,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:52:21,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489985227] [2024-11-22 11:52:21,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:52:21,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:52:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:52:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-22 11:52:22,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:52:22,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489985227] [2024-11-22 11:52:22,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489985227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 11:52:22,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697255123] [2024-11-22 11:52:22,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:52:22,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:52:22,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:52:22,047 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:52:22,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 11:52:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:52:22,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 11:52:22,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:52:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-11-22 11:52:22,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:52:22,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697255123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:52:22,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 11:52:22,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 11:52:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741361698] [2024-11-22 11:52:22,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:52:22,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 11:52:22,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:52:22,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 11:52:22,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:52:22,207 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 11:52:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:52:22,223 INFO L93 Difference]: Finished difference Result 81 states and 132 transitions. [2024-11-22 11:52:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 11:52:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2024-11-22 11:52:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:52:22,230 INFO L225 Difference]: With dead ends: 81 [2024-11-22 11:52:22,230 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 11:52:22,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:52:22,234 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:52:22,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:52:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 11:52:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-22 11:52:22,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 11:52:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-11-22 11:52:22,272 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 80 [2024-11-22 11:52:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:52:22,273 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-11-22 11:52:22,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 11:52:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-11-22 11:52:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-22 11:52:22,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:52:22,276 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:52:22,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 11:52:22,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 11:52:22,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:52:22,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:52:22,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1174052721, now seen corresponding path program 1 times [2024-11-22 11:52:22,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:52:22,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084651689] [2024-11-22 11:52:22,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:52:22,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:52:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 11:52:22,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063304327] [2024-11-22 11:52:22,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:52:22,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:52:22,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:52:22,602 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:52:22,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 11:52:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 11:52:22,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 11:52:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 11:52:22,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 11:52:22,818 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 11:52:22,819 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 11:52:22,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 11:52:23,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-22 11:52:23,027 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-22 11:52:23,123 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 11:52:23,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:52:23 BoogieIcfgContainer [2024-11-22 11:52:23,136 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 11:52:23,136 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 11:52:23,136 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 11:52:23,136 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 11:52:23,137 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:52:21" (3/4) ... [2024-11-22 11:52:23,139 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 11:52:23,144 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 11:52:23,144 INFO L158 Benchmark]: Toolchain (without parser) took 2260.15ms. Allocated memory is still 174.1MB. Free memory was 108.6MB in the beginning and 65.1MB in the end (delta: 43.5MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2024-11-22 11:52:23,145 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:52:23,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.67ms. Allocated memory is still 174.1MB. Free memory was 108.4MB in the beginning and 94.7MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 11:52:23,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.04ms. Allocated memory is still 174.1MB. Free memory was 94.6MB in the beginning and 145.5MB in the end (delta: -50.9MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-22 11:52:23,147 INFO L158 Benchmark]: Boogie Preprocessor took 47.12ms. Allocated memory is still 174.1MB. Free memory was 145.5MB in the beginning and 143.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 11:52:23,148 INFO L158 Benchmark]: RCFGBuilder took 371.60ms. Allocated memory is still 174.1MB. Free memory was 143.4MB in the beginning and 128.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 11:52:23,149 INFO L158 Benchmark]: TraceAbstraction took 1422.29ms. Allocated memory is still 174.1MB. Free memory was 127.3MB in the beginning and 65.8MB in the end (delta: 61.5MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-22 11:52:23,153 INFO L158 Benchmark]: Witness Printer took 7.54ms. Allocated memory is still 174.1MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:52:23,155 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.14ms. Allocated memory is still 109.1MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.67ms. Allocated memory is still 174.1MB. Free memory was 108.4MB in the beginning and 94.7MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.04ms. Allocated memory is still 174.1MB. Free memory was 94.6MB in the beginning and 145.5MB in the end (delta: -50.9MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.12ms. Allocated memory is still 174.1MB. Free memory was 145.5MB in the beginning and 143.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.60ms. Allocated memory is still 174.1MB. Free memory was 143.4MB in the beginning and 128.0MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1422.29ms. Allocated memory is still 174.1MB. Free memory was 127.3MB in the beginning and 65.8MB in the end (delta: 61.5MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Witness Printer took 7.54ms. Allocated memory is still 174.1MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10.8; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_5 = -16; [L25] double var_1_6 = 100.01; [L26] unsigned short int var_1_7 = 50; [L27] signed short int var_1_8 = 5; [L28] unsigned short int var_1_9 = 256; [L29] signed long int var_1_10 = -100; [L30] unsigned long int var_1_12 = 10000000; [L31] unsigned short int var_1_13 = 2; [L32] unsigned short int var_1_14 = 4; [L33] double var_1_15 = 4.5; VAL [isInitial=0, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] FCALL updateLastVariables() [L93] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L66] var_1_5 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L67] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L68] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L68] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L69] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L69] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L70] var_1_6 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=5, var_1_9=256] [L71] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=5, var_1_9=256] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=256] [L73] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=256] [L74] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=256] [L74] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=256] [L75] var_1_9 = __VERIFIER_nondet_ushort() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767] [L77] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=-32771] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=-32771] [L77] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=-32771] [L78] var_1_14 = __VERIFIER_nondet_ushort() [L79] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=-32771] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=-32771] [L79] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=-32771] [L80] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=-32771] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=-32771] [L80] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=50, var_1_8=32767, var_1_9=-32771] [L93] RET updateVariables() [L94] CALL step() [L37] COND TRUE ! (var_1_5 >= ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))) [L38] var_1_7 = (var_1_9 + 1) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_7=32766, var_1_8=32767, var_1_9=-32771] [L40] var_1_12 = var_1_9 [L41] var_1_13 = var_1_14 [L42] var_1_15 = var_1_6 [L43] unsigned long int stepLocal_0 = var_1_12; VAL [isInitial=1, stepLocal_0=32765, var_1_10=-100, var_1_12=32765, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=54/5, var_1_2=0, var_1_5=32766, var_1_6=2, var_1_7=32766, var_1_8=32767, var_1_9=-32771] [L44] COND FALSE !(\read(var_1_2)) [L51] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=32765, var_1_10=-100, var_1_12=32765, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=32766, var_1_6=2, var_1_7=32766, var_1_8=32767, var_1_9=-32771] [L53] unsigned char stepLocal_1 = (var_1_6 * var_1_15) >= var_1_1; VAL [isInitial=1, stepLocal_0=32765, stepLocal_1=0, var_1_10=-100, var_1_12=32765, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=32766, var_1_6=2, var_1_7=32766, var_1_8=32767, var_1_9=-32771] [L54] COND FALSE !(stepLocal_1 || var_1_2) [L59] var_1_10 = -1 VAL [isInitial=1, stepLocal_0=32765, var_1_10=-1, var_1_12=32765, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=32766, var_1_6=2, var_1_7=32766, var_1_8=32767, var_1_9=-32771] [L94] RET step() [L95] CALL, EXPR property() [L85-L86] return (((((var_1_2 ? ((var_1_12 >= (var_1_12 / var_1_5)) ? (var_1_1 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) : (var_1_1 == ((double) var_1_6))) : (var_1_1 == ((double) var_1_6))) && ((! (var_1_5 >= ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_7 == ((unsigned short int) (var_1_9 + 1))) : 1)) && ((((var_1_6 * var_1_15) >= var_1_1) || var_1_2) ? ((var_1_6 <= var_1_1) ? (var_1_10 == ((signed long int) var_1_9)) : 1) : (var_1_10 == ((signed long int) -1)))) && (var_1_12 == ((unsigned long int) var_1_9))) && (var_1_13 == ((unsigned short int) var_1_14))) && (var_1_15 == ((double) var_1_6)) ; VAL [\result=0, isInitial=1, var_1_10=-1, var_1_12=32765, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=32766, var_1_6=2, var_1_7=32766, var_1_8=32767, var_1_9=-32771] [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-1, var_1_12=32765, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=32766, var_1_6=2, var_1_7=32766, var_1_8=32767, var_1_9=-32771] [L19] reach_error() VAL [isInitial=1, var_1_10=-1, var_1_12=32765, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=32766, var_1_6=2, var_1_7=32766, var_1_8=32767, var_1_9=-32771] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 12, 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, 56 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 56 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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.1s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 204 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 506/528 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 11:52:23,175 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 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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-51.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 8881431080bff9c322b0e4eff72d7ca44eac9c56f32aea07a4797c61348c368a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 11:52:25,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 11:52:25,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 11:52:25,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 11:52:25,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 11:52:25,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 11:52:25,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 11:52:25,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 11:52:25,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 11:52:25,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 11:52:25,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 11:52:25,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 11:52:25,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 11:52:25,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 11:52:25,116 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 11:52:25,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 11:52:25,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 11:52:25,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 11:52:25,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 11:52:25,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 11:52:25,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 11:52:25,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 11:52:25,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 11:52:25,118 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 11:52:25,119 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 11:52:25,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 11:52:25,119 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 11:52:25,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 11:52:25,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 11:52:25,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 11:52:25,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 11:52:25,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 11:52:25,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 11:52:25,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 11:52:25,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:52:25,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 11:52:25,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 11:52:25,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 11:52:25,123 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 11:52:25,123 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 11:52:25,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 11:52:25,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 11:52:25,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 11:52:25,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 11:52:25,125 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 -> 8881431080bff9c322b0e4eff72d7ca44eac9c56f32aea07a4797c61348c368a [2024-11-22 11:52:25,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 11:52:25,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 11:52:25,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 11:52:25,382 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 11:52:25,382 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 11:52:25,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-51.i [2024-11-22 11:52:26,706 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 11:52:26,903 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 11:52:26,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-51.i [2024-11-22 11:52:26,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b68b5a715/b8ae5284f5fc4ac1b85de7258a8ac19a/FLAG83ad3449e [2024-11-22 11:52:26,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b68b5a715/b8ae5284f5fc4ac1b85de7258a8ac19a [2024-11-22 11:52:26,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 11:52:26,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 11:52:26,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 11:52:26,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 11:52:26,938 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 11:52:26,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:52:26" (1/1) ... [2024-11-22 11:52:26,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@171d2d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:26, skipping insertion in model container [2024-11-22 11:52:26,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:52:26" (1/1) ... [2024-11-22 11:52:26,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 11:52:27,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-51.i[915,928] [2024-11-22 11:52:27,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:52:27,143 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 11:52:27,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-51.i[915,928] [2024-11-22 11:52:27,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:52:27,196 INFO L204 MainTranslator]: Completed translation [2024-11-22 11:52:27,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27 WrapperNode [2024-11-22 11:52:27,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 11:52:27,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 11:52:27,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 11:52:27,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 11:52:27,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (1/1) ... [2024-11-22 11:52:27,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (1/1) ... [2024-11-22 11:52:27,241 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2024-11-22 11:52:27,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 11:52:27,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 11:52:27,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 11:52:27,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 11:52:27,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (1/1) ... [2024-11-22 11:52:27,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (1/1) ... [2024-11-22 11:52:27,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (1/1) ... [2024-11-22 11:52:27,279 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 11:52:27,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (1/1) ... [2024-11-22 11:52:27,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (1/1) ... [2024-11-22 11:52:27,288 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (1/1) ... [2024-11-22 11:52:27,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (1/1) ... [2024-11-22 11:52:27,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (1/1) ... [2024-11-22 11:52:27,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (1/1) ... [2024-11-22 11:52:27,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 11:52:27,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 11:52:27,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 11:52:27,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 11:52:27,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (1/1) ... [2024-11-22 11:52:27,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:52:27,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:52:27,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 11:52:27,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 11:52:27,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 11:52:27,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 11:52:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 11:52:27,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 11:52:27,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 11:52:27,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 11:52:27,445 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 11:52:27,447 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 11:52:32,168 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-22 11:52:32,168 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 11:52:32,178 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 11:52:32,178 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 11:52:32,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:52:32 BoogieIcfgContainer [2024-11-22 11:52:32,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 11:52:32,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 11:52:32,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 11:52:32,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 11:52:32,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:52:26" (1/3) ... [2024-11-22 11:52:32,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13090eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:52:32, skipping insertion in model container [2024-11-22 11:52:32,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:52:27" (2/3) ... [2024-11-22 11:52:32,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13090eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:52:32, skipping insertion in model container [2024-11-22 11:52:32,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:52:32" (3/3) ... [2024-11-22 11:52:32,185 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-51.i [2024-11-22 11:52:32,198 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 11:52:32,198 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 11:52:32,242 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 11:52:32,250 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;@7fc8d2d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 11:52:32,250 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 11:52:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 11:52:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-22 11:52:32,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:52:32,262 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:52:32,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:52:32,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:52:32,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2079178925, now seen corresponding path program 1 times [2024-11-22 11:52:32,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:52:32,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69550667] [2024-11-22 11:52:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:52:32,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:52:32,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:52:32,288 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 11:52:32,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 11:52:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:52:32,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 11:52:32,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:52:32,636 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-22 11:52:32,636 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:52:32,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:52:32,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69550667] [2024-11-22 11:52:32,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69550667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:52:32,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:52:32,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 11:52:32,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458855607] [2024-11-22 11:52:32,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:52:32,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 11:52:32,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:52:32,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 11:52:32,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:52:32,660 INFO L87 Difference]: Start difference. First operand has 44 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 11:52:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:52:32,676 INFO L93 Difference]: Finished difference Result 81 states and 132 transitions. [2024-11-22 11:52:32,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 11:52:32,678 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2024-11-22 11:52:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:52:32,682 INFO L225 Difference]: With dead ends: 81 [2024-11-22 11:52:32,683 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 11:52:32,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:52:32,687 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:52:32,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:52:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 11:52:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-22 11:52:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-22 11:52:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-11-22 11:52:32,716 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 80 [2024-11-22 11:52:32,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:52:32,716 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-11-22 11:52:32,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-22 11:52:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-11-22 11:52:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-22 11:52:32,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:52:32,719 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 11:52:32,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 11:52:32,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:52:32,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:52:32,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:52:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1174052721, now seen corresponding path program 1 times [2024-11-22 11:52:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:52:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786354219] [2024-11-22 11:52:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:52:32,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:52:32,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:52:32,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 11:52:32,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 11:52:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:52:33,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 11:52:33,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:53:12,388 WARN L286 SmtUtils]: Spent 8.76s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-22 11:53:52,750 WARN L286 SmtUtils]: Spent 9.61s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)