./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b312eda665aa6a7743b472ccd0d872513aa8f8bd6d7b4c09e44e7debd98dca1f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:54:25,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:54:25,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:54:25,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:54:25,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:54:25,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:54:25,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:54:25,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:54:25,459 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:54:25,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:54:25,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:54:25,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:54:25,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:54:25,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:54:25,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:54:25,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:54:25,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:54:25,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:54:25,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:54:25,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:54:25,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:54:25,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:54:25,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:54:25,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:54:25,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:54:25,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:54:25,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:54:25,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:54:25,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:54:25,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:54:25,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:54:25,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:54:25,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:54:25,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:54:25,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:54:25,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:54:25,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:54:25,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:54:25,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:54:25,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:54:25,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:54:25,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:54:25,471 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b312eda665aa6a7743b472ccd0d872513aa8f8bd6d7b4c09e44e7debd98dca1f [2024-11-09 00:54:25,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:54:25,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:54:25,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:54:25,725 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:54:25,725 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:54:25,726 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-83.i [2024-11-09 00:54:27,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:54:27,207 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:54:27,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-83.i [2024-11-09 00:54:27,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0412b5a80/2d8ce516fb7149589b8d7f6f0f666807/FLAGc431e80cd [2024-11-09 00:54:27,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0412b5a80/2d8ce516fb7149589b8d7f6f0f666807 [2024-11-09 00:54:27,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:54:27,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:54:27,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:54:27,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:54:27,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:54:27,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6388bffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27, skipping insertion in model container [2024-11-09 00:54:27,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:54:27,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-83.i[915,928] [2024-11-09 00:54:27,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:54:27,548 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:54:27,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-83.i[915,928] [2024-11-09 00:54:27,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:54:27,605 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:54:27,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27 WrapperNode [2024-11-09 00:54:27,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:54:27,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:54:27,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:54:27,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:54:27,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,654 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-11-09 00:54:27,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:54:27,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:54:27,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:54:27,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:54:27,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,702 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:54:27,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:54:27,735 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:54:27,735 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:54:27,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:54:27,736 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (1/1) ... [2024-11-09 00:54:27,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:54:27,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:54:27,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:54:27,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:54:27,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:54:27,814 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:54:27,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:54:27,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:54:27,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:54:27,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:54:27,867 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:54:27,869 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:54:28,048 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:54:28,048 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:54:28,058 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:54:28,058 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:54:28,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:28 BoogieIcfgContainer [2024-11-09 00:54:28,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:54:28,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:54:28,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:54:28,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:54:28,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:54:27" (1/3) ... [2024-11-09 00:54:28,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415c7cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:54:28, skipping insertion in model container [2024-11-09 00:54:28,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:27" (2/3) ... [2024-11-09 00:54:28,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415c7cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:54:28, skipping insertion in model container [2024-11-09 00:54:28,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:28" (3/3) ... [2024-11-09 00:54:28,069 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-83.i [2024-11-09 00:54:28,082 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:54:28,083 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:54:28,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:54:28,144 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;@1c8c85bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:54:28,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:54:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 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-11-09 00:54:28,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:54:28,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:28,157 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, 1, 1, 1, 1, 1] [2024-11-09 00:54:28,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:28,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:28,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1148746169, now seen corresponding path program 1 times [2024-11-09 00:54:28,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:54:28,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845457157] [2024-11-09 00:54:28,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:28,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:54:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:54:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:54:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:54:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:54:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:54:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:54:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:54:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:54:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:54:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:54:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 00:54:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:54:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 00:54:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:54:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 00:54:28,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:54:28,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845457157] [2024-11-09 00:54:28,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845457157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:54:28,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:54:28,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:54:28,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717284482] [2024-11-09 00:54:28,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:54:28,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:54:28,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:54:28,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:54:28,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:54:28,477 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-11-09 00:54:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:54:28,494 INFO L93 Difference]: Finished difference Result 83 states and 139 transitions. [2024-11-09 00:54:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:54:28,496 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 94 [2024-11-09 00:54:28,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:54:28,502 INFO L225 Difference]: With dead ends: 83 [2024-11-09 00:54:28,502 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 00:54:28,505 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-11-09 00:54:28,508 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:54:28,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:54:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 00:54:28,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 00:54:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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-11-09 00:54:28,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-11-09 00:54:28,540 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 94 [2024-11-09 00:54:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:54:28,540 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-11-09 00:54:28,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-11-09 00:54:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-11-09 00:54:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:54:28,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:28,543 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, 1, 1, 1, 1, 1] [2024-11-09 00:54:28,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:54:28,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:28,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:28,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2115167039, now seen corresponding path program 1 times [2024-11-09 00:54:28,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:54:28,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923714659] [2024-11-09 00:54:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:28,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:54:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:54:28,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243288420] [2024-11-09 00:54:28,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:28,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:54:28,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:54:28,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:54:28,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:54:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:54:28,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:54:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:54:28,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:54:28,880 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:54:28,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:54:28,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 00:54:29,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:54:29,091 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 00:54:29,144 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:54:29,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:54:29 BoogieIcfgContainer [2024-11-09 00:54:29,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:54:29,149 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:54:29,150 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:54:29,150 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:54:29,151 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:28" (3/4) ... [2024-11-09 00:54:29,153 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:54:29,153 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:54:29,154 INFO L158 Benchmark]: Toolchain (without parser) took 1916.32ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 55.0MB in the end (delta: 51.2MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-11-09 00:54:29,154 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory was 134.4MB in the beginning and 134.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:54:29,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.28ms. Allocated memory is still 176.2MB. Free memory was 105.8MB in the beginning and 144.0MB in the end (delta: -38.2MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-09 00:54:29,155 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.60ms. Allocated memory is still 176.2MB. Free memory was 144.0MB in the beginning and 140.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:54:29,155 INFO L158 Benchmark]: Boogie Preprocessor took 75.66ms. Allocated memory is still 176.2MB. Free memory was 140.7MB in the beginning and 135.6MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:54:29,156 INFO L158 Benchmark]: RCFGBuilder took 324.09ms. Allocated memory is still 176.2MB. Free memory was 134.7MB in the beginning and 116.7MB in the end (delta: 17.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 00:54:29,156 INFO L158 Benchmark]: TraceAbstraction took 1088.52ms. Allocated memory is still 176.2MB. Free memory was 116.7MB in the beginning and 55.9MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-11-09 00:54:29,156 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 176.2MB. Free memory was 55.9MB in the beginning and 55.0MB in the end (delta: 904.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:54:29,159 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.15ms. Allocated memory is still 176.2MB. Free memory was 134.4MB in the beginning and 134.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.28ms. Allocated memory is still 176.2MB. Free memory was 105.8MB in the beginning and 144.0MB in the end (delta: -38.2MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.60ms. Allocated memory is still 176.2MB. Free memory was 144.0MB in the beginning and 140.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.66ms. Allocated memory is still 176.2MB. Free memory was 140.7MB in the beginning and 135.6MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 324.09ms. Allocated memory is still 176.2MB. Free memory was 134.7MB in the beginning and 116.7MB in the end (delta: 17.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1088.52ms. Allocated memory is still 176.2MB. Free memory was 116.7MB in the beginning and 55.9MB in the end (delta: 60.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 176.2MB. Free memory was 55.9MB in the beginning and 55.0MB in the end (delta: 904.3kB). 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 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 25; [L25] unsigned char var_1_4 = 4; [L26] double var_1_8 = 49.8; [L27] double var_1_9 = 127.8; [L28] double var_1_10 = 7.2; [L29] signed char var_1_11 = -1; [L30] signed char var_1_12 = 2; [L31] signed char var_1_13 = 4; [L32] signed char var_1_14 = 16; [L33] unsigned short int var_1_15 = 0; VAL [isInitial=0, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] FCALL updateLastVariables() [L91] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L58] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L58] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L59] var_1_3 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L60] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L61] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L61] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L64] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L64] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_8=249/5, var_1_9=639/5] [L65] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5, var_1_9=639/5] [L65] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5, var_1_9=639/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L68] var_1_10 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L69] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L70] var_1_12 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L71] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L72] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L72] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L73] var_1_13 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L74] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L75] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L75] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L76] var_1_14 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L78] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L78] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L91] RET updateVariables() [L92] CALL step() [L37] var_1_11 = ((var_1_12 + var_1_13) - ((((25) < (var_1_14)) ? (25) : (var_1_14)))) [L38] var_1_15 = var_1_14 [L39] signed long int stepLocal_0 = var_1_3 / var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L40] COND TRUE \read(var_1_2) [L41] var_1_1 = (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=-257, var_1_8=249/5] [L49] COND TRUE var_1_11 >= ((var_1_3 / var_1_4) + (var_1_1 * var_1_11)) [L50] var_1_8 = (var_1_9 + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=-257] [L92] RET step() [L93] CALL, EXPR property() [L83-L84] return (((var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((var_1_15 * var_1_15)) < (var_1_11)) ? ((var_1_15 * var_1_15)) : (var_1_11)))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) 5)))) && ((var_1_11 >= ((var_1_3 / var_1_4) + (var_1_1 * var_1_11))) ? (var_1_8 == ((double) (var_1_9 + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))) : (var_1_8 == ((double) var_1_9)))) && (var_1_11 == ((signed char) ((var_1_12 + var_1_13) - ((((25) < (var_1_14)) ? (25) : (var_1_14))))))) && (var_1_15 == ((unsigned short int) var_1_14)) ; VAL [\result=0, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=-257] [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=-257] [L19] reach_error() VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=254, var_1_2=1, var_1_3=-196354, var_1_4=-257] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 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, 58 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 58 mSDtfsCounter, 0 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=45occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 93 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-11-09 00:54:29,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b312eda665aa6a7743b472ccd0d872513aa8f8bd6d7b4c09e44e7debd98dca1f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:54:31,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:54:31,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:54:31,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:54:31,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:54:31,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:54:31,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:54:31,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:54:31,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:54:31,278 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:54:31,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:54:31,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:54:31,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:54:31,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:54:31,280 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:54:31,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:54:31,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:54:31,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:54:31,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:54:31,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:54:31,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:54:31,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:54:31,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:54:31,284 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:54:31,284 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:54:31,284 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:54:31,285 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:54:31,285 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:54:31,285 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:54:31,285 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:54:31,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:54:31,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:54:31,286 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:54:31,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:54:31,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:54:31,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:54:31,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:54:31,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:54:31,287 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:54:31,287 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:54:31,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:54:31,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:54:31,289 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:54:31,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:54:31,289 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b312eda665aa6a7743b472ccd0d872513aa8f8bd6d7b4c09e44e7debd98dca1f [2024-11-09 00:54:31,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:54:31,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:54:31,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:54:31,603 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:54:31,603 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:54:31,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-83.i [2024-11-09 00:54:33,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:54:33,268 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:54:33,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-83.i [2024-11-09 00:54:33,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4eea6db4/c0acd6cfe5e143c683a73e03c6bf3f9d/FLAGea349fa9a [2024-11-09 00:54:33,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4eea6db4/c0acd6cfe5e143c683a73e03c6bf3f9d [2024-11-09 00:54:33,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:54:33,297 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:54:33,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:54:33,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:54:33,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:54:33,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8b7b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33, skipping insertion in model container [2024-11-09 00:54:33,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:54:33,487 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-83.i[915,928] [2024-11-09 00:54:33,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:54:33,540 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:54:33,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-83.i[915,928] [2024-11-09 00:54:33,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:54:33,592 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:54:33,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33 WrapperNode [2024-11-09 00:54:33,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:54:33,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:54:33,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:54:33,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:54:33,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,635 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2024-11-09 00:54:33,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:54:33,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:54:33,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:54:33,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:54:33,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,659 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:54:33,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:54:33,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:54:33,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:54:33,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:54:33,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (1/1) ... [2024-11-09 00:54:33,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:54:33,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:54:33,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:54:33,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:54:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:54:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:54:33,761 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:54:33,761 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:54:33,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:54:33,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:54:33,821 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:54:33,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:54:34,550 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:54:34,551 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:54:34,565 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:54:34,565 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:54:34,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:34 BoogieIcfgContainer [2024-11-09 00:54:34,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:54:34,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:54:34,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:54:34,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:54:34,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:54:33" (1/3) ... [2024-11-09 00:54:34,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164d3c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:54:34, skipping insertion in model container [2024-11-09 00:54:34,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:54:33" (2/3) ... [2024-11-09 00:54:34,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164d3c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:54:34, skipping insertion in model container [2024-11-09 00:54:34,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:54:34" (3/3) ... [2024-11-09 00:54:34,575 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-83.i [2024-11-09 00:54:34,589 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:54:34,590 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:54:34,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:54:34,659 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;@6ae36fd1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:54:34,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:54:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 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-11-09 00:54:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:54:34,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:34,674 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, 1, 1, 1, 1, 1] [2024-11-09 00:54:34,674 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:34,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:34,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1148746169, now seen corresponding path program 1 times [2024-11-09 00:54:34,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:54:34,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476311613] [2024-11-09 00:54:34,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:34,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:54:34,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:54:34,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:54:34,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:54:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:34,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:54:34,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:54:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-09 00:54:34,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:54:34,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:54:34,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476311613] [2024-11-09 00:54:34,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476311613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:54:34,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:54:34,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:54:34,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850122077] [2024-11-09 00:54:34,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:54:34,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:54:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:54:34,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:54:34,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:54:34,936 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:54:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:54:34,954 INFO L93 Difference]: Finished difference Result 83 states and 139 transitions. [2024-11-09 00:54:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:54:34,956 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-11-09 00:54:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:54:34,962 INFO L225 Difference]: With dead ends: 83 [2024-11-09 00:54:34,962 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 00:54:34,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:54:34,967 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:54:34,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:54:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 00:54:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 00:54:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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-11-09 00:54:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-11-09 00:54:35,003 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 94 [2024-11-09 00:54:35,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:54:35,004 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-11-09 00:54:35,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:54:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-11-09 00:54:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 00:54:35,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:54:35,007 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, 1, 1, 1, 1, 1] [2024-11-09 00:54:35,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 00:54:35,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:54:35,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:54:35,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:54:35,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2115167039, now seen corresponding path program 1 times [2024-11-09 00:54:35,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:54:35,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684837815] [2024-11-09 00:54:35,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:54:35,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:54:35,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:54:35,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:54:35,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:54:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:54:35,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 00:54:35,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:55:04,097 WARN L286 SmtUtils]: Spent 13.26s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)