./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_amount10_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:18:52,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:18:52,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:18:52,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:18:52,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:18:52,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:18:52,795 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:18:52,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:18:52,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:18:52,798 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:18:52,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:18:52,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:18:52,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:18:52,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:18:52,800 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:18:52,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:18:52,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:18:52,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:18:52,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:18:52,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:18:52,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:18:52,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:18:52,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:18:52,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:18:52,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:18:52,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:18:52,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:18:52,807 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:18:52,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:18:52,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:18:52,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:18:52,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:18:52,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:18:52,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:18:52,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:18:52,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:18:52,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:18:52,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:18:52,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:18:52,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:18:52,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:18:52,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:18:52,819 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 [2024-10-11 12:18:53,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:18:53,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:18:53,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:18:53,129 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:18:53,129 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:18:53,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2024-10-11 12:18:54,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:18:54,892 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:18:54,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2024-10-11 12:18:54,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f8b72f037/3f0d690a677543c99c2983bd50cf47d4/FLAG5e6366291 [2024-10-11 12:18:54,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f8b72f037/3f0d690a677543c99c2983bd50cf47d4 [2024-10-11 12:18:54,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:18:54,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:18:54,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:18:54,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:18:54,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:18:54,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:18:54" (1/1) ... [2024-10-11 12:18:54,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463a88e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:54, skipping insertion in model container [2024-10-11 12:18:54,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:18:54" (1/1) ... [2024-10-11 12:18:54,961 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:18:55,143 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_amount10_file-26.i[915,928] [2024-10-11 12:18:55,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:18:55,187 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:18:55,199 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_amount10_file-26.i[915,928] [2024-10-11 12:18:55,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:18:55,233 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:18:55,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55 WrapperNode [2024-10-11 12:18:55,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:18:55,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:18:55,235 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:18:55,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:18:55,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (1/1) ... [2024-10-11 12:18:55,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (1/1) ... [2024-10-11 12:18:55,273 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-10-11 12:18:55,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:18:55,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:18:55,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:18:55,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:18:55,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (1/1) ... [2024-10-11 12:18:55,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (1/1) ... [2024-10-11 12:18:55,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (1/1) ... [2024-10-11 12:18:55,298 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:18:55,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (1/1) ... [2024-10-11 12:18:55,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (1/1) ... [2024-10-11 12:18:55,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (1/1) ... [2024-10-11 12:18:55,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (1/1) ... [2024-10-11 12:18:55,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (1/1) ... [2024-10-11 12:18:55,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (1/1) ... [2024-10-11 12:18:55,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:18:55,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:18:55,315 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:18:55,315 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:18:55,316 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (1/1) ... [2024-10-11 12:18:55,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:18:55,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:18:55,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:18:55,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:18:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:18:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:18:55,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:18:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:18:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:18:55,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:18:55,489 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:18:55,491 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:18:55,723 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:18:55,723 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:18:55,809 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:18:55,809 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:18:55,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:18:55 BoogieIcfgContainer [2024-10-11 12:18:55,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:18:55,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:18:55,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:18:55,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:18:55,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:18:54" (1/3) ... [2024-10-11 12:18:55,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d0a3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:18:55, skipping insertion in model container [2024-10-11 12:18:55,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:18:55" (2/3) ... [2024-10-11 12:18:55,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d0a3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:18:55, skipping insertion in model container [2024-10-11 12:18:55,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:18:55" (3/3) ... [2024-10-11 12:18:55,823 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-26.i [2024-10-11 12:18:55,865 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:18:55,865 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:18:55,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:18:55,963 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;@2d0b9ee5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:18:55,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:18:55,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 12:18:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 12:18:55,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:18:55,984 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:18:55,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:18:55,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:18:55,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1590931931, now seen corresponding path program 1 times [2024-10-11 12:18:56,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:18:56,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208172995] [2024-10-11 12:18:56,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:18:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:18:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:18:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:18:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:18:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:18:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:18:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:18:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:18:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:18:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:18:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:18:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:18:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:18:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:18:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:18:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:18:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:18:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 12:18:56,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:18:56,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208172995] [2024-10-11 12:18:56,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208172995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:18:56,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:18:56,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:18:56,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807420649] [2024-10-11 12:18:56,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:18:56,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:18:56,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:18:56,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:18:56,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:18:56,450 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:18:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:18:56,498 INFO L93 Difference]: Finished difference Result 71 states and 123 transitions. [2024-10-11 12:18:56,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:18:56,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 89 [2024-10-11 12:18:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:18:56,514 INFO L225 Difference]: With dead ends: 71 [2024-10-11 12:18:56,514 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 12:18:56,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:18:56,523 INFO L432 NwaCegarLoop]: 47 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, 47 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:18:56,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:18:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 12:18:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 12:18:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 12:18:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2024-10-11 12:18:56,575 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 89 [2024-10-11 12:18:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:18:56,576 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2024-10-11 12:18:56,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:18:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2024-10-11 12:18:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 12:18:56,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:18:56,582 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:18:56,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:18:56,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:18:56,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:18:56,583 INFO L85 PathProgramCache]: Analyzing trace with hash 2141560935, now seen corresponding path program 1 times [2024-10-11 12:18:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:18:56,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892577916] [2024-10-11 12:18:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:18:56,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:18:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:18:56,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:18:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:18:56,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:18:56,891 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:18:56,892 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:18:56,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:18:56,898 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 12:18:56,985 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:18:56,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:18:56 BoogieIcfgContainer [2024-10-11 12:18:56,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:18:56,993 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:18:56,993 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:18:56,993 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:18:56,994 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:18:55" (3/4) ... [2024-10-11 12:18:56,996 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:18:56,997 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:18:56,998 INFO L158 Benchmark]: Toolchain (without parser) took 2078.58ms. Allocated memory was 123.7MB in the beginning and 165.7MB in the end (delta: 41.9MB). Free memory was 70.9MB in the beginning and 82.2MB in the end (delta: -11.3MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2024-10-11 12:18:57,000 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:18:57,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.37ms. Allocated memory is still 123.7MB. Free memory was 70.9MB in the beginning and 57.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:18:57,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.97ms. Allocated memory is still 123.7MB. Free memory was 57.9MB in the beginning and 56.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:18:57,001 INFO L158 Benchmark]: Boogie Preprocessor took 39.49ms. Allocated memory is still 123.7MB. Free memory was 56.2MB in the beginning and 54.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:18:57,002 INFO L158 Benchmark]: RCFGBuilder took 495.52ms. Allocated memory is still 123.7MB. Free memory was 54.2MB in the beginning and 37.9MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:18:57,003 INFO L158 Benchmark]: TraceAbstraction took 1177.48ms. Allocated memory was 123.7MB in the beginning and 165.7MB in the end (delta: 41.9MB). Free memory was 36.9MB in the beginning and 83.2MB in the end (delta: -46.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:18:57,005 INFO L158 Benchmark]: Witness Printer took 4.81ms. Allocated memory is still 165.7MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:18:57,011 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 123.7MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.37ms. Allocated memory is still 123.7MB. Free memory was 70.9MB in the beginning and 57.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.97ms. Allocated memory is still 123.7MB. Free memory was 57.9MB in the beginning and 56.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.49ms. Allocated memory is still 123.7MB. Free memory was 56.2MB in the beginning and 54.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 495.52ms. Allocated memory is still 123.7MB. Free memory was 54.2MB in the beginning and 37.9MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1177.48ms. Allocated memory was 123.7MB in the beginning and 165.7MB in the end (delta: 41.9MB). Free memory was 36.9MB in the beginning and 83.2MB in the end (delta: -46.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.81ms. Allocated memory is still 165.7MB. Free memory is still 82.2MB. 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 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] unsigned long int var_1_3 = 4; [L25] unsigned long int var_1_4 = 64; [L26] unsigned long int var_1_5 = 32; [L27] unsigned long int var_1_6 = 1908995780; [L28] unsigned long int var_1_7 = 0; [L29] double var_1_8 = 1.7; [L30] double var_1_9 = 1.7; [L31] signed short int var_1_10 = -32; [L32] signed short int var_1_11 = -16; [L76] isInitial = 1 [L77] FCALL initially() [L78] COND TRUE 1 [L79] FCALL updateLastVariables() [L80] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L48] var_1_3 = __VERIFIER_nondet_ulong() [L49] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L49] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L50] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L50] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=64, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L51] var_1_4 = __VERIFIER_nondet_ulong() [L52] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L52] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L53] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L53] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=32, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L54] var_1_5 = __VERIFIER_nondet_ulong() [L55] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L55] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=1908995780, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L57] var_1_6 = __VERIFIER_nondet_ulong() [L58] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L58] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=0, var_1_8=17/10, var_1_9=17/10] [L60] var_1_7 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_8=17/10, var_1_9=17/10] [L61] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_8=17/10, var_1_9=17/10] [L62] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10, var_1_9=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10, var_1_9=17/10] [L62] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10, var_1_9=17/10] [L63] var_1_9 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10] [L64] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-32, var_1_11=-16, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10] [L65] var_1_11 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_11 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=0, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=0, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10] [L66] RET assume_abort_if_not(var_1_11 >= -32767) VAL [isInitial=1, var_1_10=-32, var_1_11=0, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10] [L67] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=0, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-32, var_1_11=0, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10] [L67] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, var_1_10=-32, var_1_11=0, var_1_1=32, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10] [L80] RET updateVariables() [L81] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) VAL [isInitial=1, var_1_10=-32, var_1_11=0, var_1_1=4294967294, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=17/10] [L41] var_1_8 = var_1_9 [L42] var_1_10 = var_1_11 [L81] RET step() [L82] CALL, EXPR property() [L72-L73] return ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))))) : (var_1_1 == ((unsigned long int) (3164264966u - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7)))))))) && (var_1_8 == ((double) var_1_9))) && (var_1_10 == ((signed short int) var_1_11)) ; [L82] RET, EXPR property() [L82] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_1=4294967294, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=5368709124, var_1_9=5368709124] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_1=4294967294, var_1_2=1, var_1_3=4294967294, var_1_4=-2147483649, var_1_5=-3221225472, var_1_6=2147483647, var_1_7=5368709119, var_1_8=5368709124, var_1_9=5368709124] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 15, 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, 47 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, 47 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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.3s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:18:57,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:18:59,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:18:59,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:18:59,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:18:59,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:18:59,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:18:59,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:18:59,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:18:59,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:18:59,577 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:18:59,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:18:59,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:18:59,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:18:59,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:18:59,581 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:18:59,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:18:59,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:18:59,582 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:18:59,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:18:59,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:18:59,587 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:18:59,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:18:59,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:18:59,588 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:18:59,588 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:18:59,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:18:59,588 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:18:59,589 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:18:59,589 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:18:59,590 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:18:59,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:18:59,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:18:59,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:18:59,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:18:59,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:18:59,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:18:59,600 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:18:59,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:18:59,600 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:18:59,600 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:18:59,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:18:59,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:18:59,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:18:59,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:18:59,601 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:18:59,601 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 08ef4c3a1699c030822612f64a82179d2ef28481e12c6ce62efbc901639eabc5 [2024-10-11 12:18:59,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:19:00,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:19:00,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:19:00,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:19:00,014 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:19:00,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2024-10-11 12:19:01,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:19:01,815 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:19:01,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-26.i [2024-10-11 12:19:01,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fe5d7996b/ab3cfa4a5bbc4385b644cc11d26d49d5/FLAG25264fd77 [2024-10-11 12:19:01,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fe5d7996b/ab3cfa4a5bbc4385b644cc11d26d49d5 [2024-10-11 12:19:01,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:19:01,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:19:01,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:19:01,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:19:01,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:19:01,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:19:01" (1/1) ... [2024-10-11 12:19:01,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f267b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:01, skipping insertion in model container [2024-10-11 12:19:01,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:19:01" (1/1) ... [2024-10-11 12:19:01,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:19:02,090 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_amount10_file-26.i[915,928] [2024-10-11 12:19:02,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:19:02,158 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:19:02,173 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_amount10_file-26.i[915,928] [2024-10-11 12:19:02,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:19:02,223 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:19:02,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02 WrapperNode [2024-10-11 12:19:02,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:19:02,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:19:02,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:19:02,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:19:02,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (1/1) ... [2024-10-11 12:19:02,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (1/1) ... [2024-10-11 12:19:02,282 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-10-11 12:19:02,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:19:02,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:19:02,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:19:02,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:19:02,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (1/1) ... [2024-10-11 12:19:02,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (1/1) ... [2024-10-11 12:19:02,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (1/1) ... [2024-10-11 12:19:02,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-10-11 12:19:02,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (1/1) ... [2024-10-11 12:19:02,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (1/1) ... [2024-10-11 12:19:02,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (1/1) ... [2024-10-11 12:19:02,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (1/1) ... [2024-10-11 12:19:02,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (1/1) ... [2024-10-11 12:19:02,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (1/1) ... [2024-10-11 12:19:02,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:19:02,364 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:19:02,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:19:02,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:19:02,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (1/1) ... [2024-10-11 12:19:02,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:19:02,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:19:02,400 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:19:02,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:19:02,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:19:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:19:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:19:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:19:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:19:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:19:02,548 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:19:02,550 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:19:02,798 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:19:02,798 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:19:02,880 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:19:02,881 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:19:02,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:02 BoogieIcfgContainer [2024-10-11 12:19:02,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:19:02,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:19:02,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:19:02,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:19:02,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:19:01" (1/3) ... [2024-10-11 12:19:02,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5daa3187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:19:02, skipping insertion in model container [2024-10-11 12:19:02,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:02" (2/3) ... [2024-10-11 12:19:02,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5daa3187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:19:02, skipping insertion in model container [2024-10-11 12:19:02,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:02" (3/3) ... [2024-10-11 12:19:02,892 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-26.i [2024-10-11 12:19:02,908 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:19:02,908 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:19:02,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:19:02,989 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;@fe0ca4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:19:02,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:19:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 12:19:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 12:19:03,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:03,009 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:19:03,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:03,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1590931931, now seen corresponding path program 1 times [2024-10-11 12:19:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:19:03,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232082724] [2024-10-11 12:19:03,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:03,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:03,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:19:03,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:19:03,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:19:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:03,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:19:03,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:19:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-11 12:19:03,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:19:03,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:19:03,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232082724] [2024-10-11 12:19:03,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232082724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:19:03,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:19:03,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:19:03,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520984542] [2024-10-11 12:19:03,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:19:03,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:19:03,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:19:03,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:19:03,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:19:03,295 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:19:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:19:03,346 INFO L93 Difference]: Finished difference Result 71 states and 123 transitions. [2024-10-11 12:19:03,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:19:03,350 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 89 [2024-10-11 12:19:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:19:03,357 INFO L225 Difference]: With dead ends: 71 [2024-10-11 12:19:03,357 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 12:19:03,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:19:03,368 INFO L432 NwaCegarLoop]: 47 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, 47 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:19:03,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:19:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 12:19:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 12:19:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 12:19:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2024-10-11 12:19:03,432 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 89 [2024-10-11 12:19:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:19:03,432 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2024-10-11 12:19:03,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 12:19:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2024-10-11 12:19:03,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 12:19:03,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:03,439 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:19:03,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 12:19:03,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:03,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:03,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2141560935, now seen corresponding path program 1 times [2024-10-11 12:19:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:19:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301831436] [2024-10-11 12:19:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:03,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:03,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:19:03,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:19:03,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:19:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:03,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 12:19:03,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:19:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 104 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-11 12:19:06,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:19:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 12:19:07,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:19:07,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301831436] [2024-10-11 12:19:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301831436] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:19:07,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:19:07,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-11 12:19:07,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911257429] [2024-10-11 12:19:07,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:19:07,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 12:19:07,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:19:07,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 12:19:07,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 12:19:07,618 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-10-11 12:19:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:19:09,041 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2024-10-11 12:19:09,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 12:19:09,044 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 89 [2024-10-11 12:19:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:19:09,046 INFO L225 Difference]: With dead ends: 47 [2024-10-11 12:19:09,046 INFO L226 Difference]: Without dead ends: 45 [2024-10-11 12:19:09,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-10-11 12:19:09,047 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:19:09,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 130 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 12:19:09,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-11 12:19:09,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2024-10-11 12:19:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 12:19:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-10-11 12:19:09,061 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 89 [2024-10-11 12:19:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:19:09,062 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-10-11 12:19:09,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-10-11 12:19:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-10-11 12:19:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 12:19:09,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:09,066 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:19:09,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 12:19:09,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:09,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:09,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2141620517, now seen corresponding path program 1 times [2024-10-11 12:19:09,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:19:09,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519850308] [2024-10-11 12:19:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:09,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:09,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:19:09,273 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:19:09,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 12:19:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:09,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 12:19:09,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:19:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 104 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2024-10-11 12:19:10,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:19:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-11 12:19:11,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:19:11,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519850308] [2024-10-11 12:19:11,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519850308] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:19:11,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 12:19:11,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-10-11 12:19:11,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083387030] [2024-10-11 12:19:11,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 12:19:11,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 12:19:11,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:19:11,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 12:19:11,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-11 12:19:11,652 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-10-11 12:19:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:19:12,732 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-10-11 12:19:12,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 12:19:12,734 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 89 [2024-10-11 12:19:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:19:12,735 INFO L225 Difference]: With dead ends: 45 [2024-10-11 12:19:12,735 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 12:19:12,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-10-11 12:19:12,737 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 12:19:12,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 90 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 12:19:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 12:19:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 12:19:12,742 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-11 12:19:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 12:19:12,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2024-10-11 12:19:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:19:12,743 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 12:19:12,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2024-10-11 12:19:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 12:19:12,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 12:19:12,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:19:12,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 12:19:12,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:12,956 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 12:19:12,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 12:19:13,669 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:19:13,681 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:13,682 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:13,682 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:13,682 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:13,683 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:19:13,683 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:13,686 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:19:13,687 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:13,688 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:19:13,688 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-11 12:19:13,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:19:13 BoogieIcfgContainer [2024-10-11 12:19:13,691 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:19:13,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:19:13,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:19:13,693 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:19:13,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:02" (3/4) ... [2024-10-11 12:19:13,696 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 12:19:13,699 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 12:19:13,706 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 12:19:13,706 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 12:19:13,707 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 12:19:13,707 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 12:19:13,822 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 12:19:13,822 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 12:19:13,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:19:13,823 INFO L158 Benchmark]: Toolchain (without parser) took 11972.80ms. Allocated memory was 65.0MB in the beginning and 278.9MB in the end (delta: 213.9MB). Free memory was 31.0MB in the beginning and 178.3MB in the end (delta: -147.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2024-10-11 12:19:13,823 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 52.4MB. Free memory is still 27.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:19:13,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.50ms. Allocated memory is still 65.0MB. Free memory was 30.7MB in the beginning and 33.0MB in the end (delta: -2.3MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-10-11 12:19:13,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.58ms. Allocated memory is still 65.0MB. Free memory was 33.0MB in the beginning and 31.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:19:13,825 INFO L158 Benchmark]: Boogie Preprocessor took 79.67ms. Allocated memory is still 65.0MB. Free memory was 31.1MB in the beginning and 44.3MB in the end (delta: -13.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:19:13,828 INFO L158 Benchmark]: RCFGBuilder took 517.25ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 44.3MB in the beginning and 57.0MB in the end (delta: -12.7MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-10-11 12:19:13,829 INFO L158 Benchmark]: TraceAbstraction took 10807.80ms. Allocated memory was 79.7MB in the beginning and 278.9MB in the end (delta: 199.2MB). Free memory was 56.6MB in the beginning and 183.5MB in the end (delta: -126.9MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2024-10-11 12:19:13,830 INFO L158 Benchmark]: Witness Printer took 129.77ms. Allocated memory is still 278.9MB. Free memory was 183.5MB in the beginning and 178.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 12:19:13,832 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.28ms. Allocated memory is still 52.4MB. Free memory is still 27.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.50ms. Allocated memory is still 65.0MB. Free memory was 30.7MB in the beginning and 33.0MB in the end (delta: -2.3MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.58ms. Allocated memory is still 65.0MB. Free memory was 33.0MB in the beginning and 31.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.67ms. Allocated memory is still 65.0MB. Free memory was 31.1MB in the beginning and 44.3MB in the end (delta: -13.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 517.25ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 44.3MB in the beginning and 57.0MB in the end (delta: -12.7MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10807.80ms. Allocated memory was 79.7MB in the beginning and 278.9MB in the end (delta: 199.2MB). Free memory was 56.6MB in the beginning and 183.5MB in the end (delta: -126.9MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Witness Printer took 129.77ms. Allocated memory is still 278.9MB. Free memory was 183.5MB in the beginning and 178.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - 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: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 267 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 394 IncrementalHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 105 mSDtfsCounter, 394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 454 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=2, InterpolantAutomatonStates: 24, 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, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 440 ConstructedInterpolants, 1 QuantifiedInterpolants, 2069 SizeOfPredicates, 38 NumberOfNonLiveVariables, 438 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1880/2100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (0 != cond) RESULT: Ultimate proved your program to be correct! [2024-10-11 12:19:13,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Writing output log to file Ultimate.log Result: TRUE