./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_amount10_file-71.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 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:13:58,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:13:58,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:13:58,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:13:58,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:13:58,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:13:58,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:13:58,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:13:58,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:13:58,638 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:13:58,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:13:58,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:13:58,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:13:58,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:13:58,644 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:13:58,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:13:58,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:13:58,645 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:13:58,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:13:58,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:13:58,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:13:58,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:13:58,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:13:58,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:13:58,651 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:13:58,652 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:13:58,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:13:58,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:13:58,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:13:58,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:13:58,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:13:58,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:13:58,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:58,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:13:58,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:13:58,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:13:58,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:13:58,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:13:58,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:13:58,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:13:58,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:13:58,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:13:58,657 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 -> 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 [2024-11-12 06:13:58,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:13:58,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:13:58,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:13:58,941 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:13:58,942 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:13:58,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2024-11-12 06:14:00,477 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:14:00,683 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:14:00,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2024-11-12 06:14:00,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629b3027e/872a2c3916d541349c9a7adcbfffffdc/FLAG47ada810c [2024-11-12 06:14:00,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629b3027e/872a2c3916d541349c9a7adcbfffffdc [2024-11-12 06:14:00,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:14:00,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:14:00,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:00,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:14:00,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:14:00,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:00,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b58718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00, skipping insertion in model container [2024-11-12 06:14:00,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:00,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:14:00,910 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_amount10_file-71.i[915,928] [2024-11-12 06:14:00,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:00,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:14:00,960 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_amount10_file-71.i[915,928] [2024-11-12 06:14:00,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:00,989 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:14:00,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00 WrapperNode [2024-11-12 06:14:00,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:00,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:00,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:14:00,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:14:00,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:01,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:01,041 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-12 06:14:01,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:01,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:14:01,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:14:01,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:14:01,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:01,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:01,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:01,098 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-12 06:14:01,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:01,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:01,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:01,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:01,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:01,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:01,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:14:01,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:14:01,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:14:01,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:14:01,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (1/1) ... [2024-11-12 06:14:01,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:01,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:14:01,158 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-12 06:14:01,162 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-12 06:14:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:14:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:14:01,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:14:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:14:01,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:14:01,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:14:01,289 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:14:01,291 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:14:01,465 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 06:14:01,465 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:14:01,485 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:14:01,485 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:14:01,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:01 BoogieIcfgContainer [2024-11-12 06:14:01,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:14:01,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:14:01,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:14:01,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:14:01,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:14:00" (1/3) ... [2024-11-12 06:14:01,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64854e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:01, skipping insertion in model container [2024-11-12 06:14:01,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:00" (2/3) ... [2024-11-12 06:14:01,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64854e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:01, skipping insertion in model container [2024-11-12 06:14:01,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:01" (3/3) ... [2024-11-12 06:14:01,497 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-71.i [2024-11-12 06:14:01,520 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:14:01,520 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:14:01,577 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:14:01,584 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;@43b628d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:14:01,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:14:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:14:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 06:14:01,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:01,603 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:14:01,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:01,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:01,610 INFO L85 PathProgramCache]: Analyzing trace with hash 2017305078, now seen corresponding path program 1 times [2024-11-12 06:14:01,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:14:01,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755397521] [2024-11-12 06:14:01,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:01,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:14:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:14:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:14:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:14:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:14:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:14:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:14:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:14:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 06:14:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 06:14:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 06:14:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 06:14:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 06:14:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:14:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:14:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755397521] [2024-11-12 06:14:02,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755397521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:02,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:02,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:14:02,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551927481] [2024-11-12 06:14:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:02,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:14:02,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:14:02,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:14:02,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:14:02,716 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:14:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:02,862 INFO L93 Difference]: Finished difference Result 92 states and 146 transitions. [2024-11-12 06:14:02,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:14:02,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-11-12 06:14:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:02,874 INFO L225 Difference]: With dead ends: 92 [2024-11-12 06:14:02,874 INFO L226 Difference]: Without dead ends: 53 [2024-11-12 06:14:02,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:14:02,882 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 15 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:02,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 235 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 06:14:02,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-12 06:14:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2024-11-12 06:14:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:14:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2024-11-12 06:14:02,920 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 79 [2024-11-12 06:14:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:02,921 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2024-11-12 06:14:02,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:14:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2024-11-12 06:14:02,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 06:14:02,925 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:02,925 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:14:02,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:14:02,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:02,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:02,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2019152120, now seen corresponding path program 1 times [2024-11-12 06:14:02,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:14:02,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784636308] [2024-11-12 06:14:02,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:14:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:14:02,967 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:14:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:14:03,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:14:03,036 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:14:03,038 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:14:03,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:14:03,043 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 06:14:03,112 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:14:03,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:14:03 BoogieIcfgContainer [2024-11-12 06:14:03,117 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:14:03,118 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:14:03,118 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:14:03,118 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:14:03,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:01" (3/4) ... [2024-11-12 06:14:03,121 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:14:03,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:14:03,124 INFO L158 Benchmark]: Toolchain (without parser) took 2414.46ms. Allocated memory is still 182.5MB. Free memory was 114.4MB in the beginning and 111.8MB in the end (delta: 2.6MB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. [2024-11-12 06:14:03,124 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:14:03,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.47ms. Allocated memory is still 182.5MB. Free memory was 114.2MB in the beginning and 101.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:14:03,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.57ms. Allocated memory is still 182.5MB. Free memory was 101.0MB in the beginning and 153.5MB in the end (delta: -52.6MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-12 06:14:03,126 INFO L158 Benchmark]: Boogie Preprocessor took 68.59ms. Allocated memory is still 182.5MB. Free memory was 153.5MB in the beginning and 151.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:14:03,127 INFO L158 Benchmark]: RCFGBuilder took 373.90ms. Allocated memory is still 182.5MB. Free memory was 150.7MB in the beginning and 137.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:14:03,129 INFO L158 Benchmark]: TraceAbstraction took 1628.65ms. Allocated memory is still 182.5MB. Free memory was 136.8MB in the beginning and 112.8MB in the end (delta: 23.9MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-11-12 06:14:03,129 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 182.5MB. Free memory was 112.8MB in the beginning and 111.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:14:03,131 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.19ms. Allocated memory is still 109.1MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.47ms. Allocated memory is still 182.5MB. Free memory was 114.2MB in the beginning and 101.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.57ms. Allocated memory is still 182.5MB. Free memory was 101.0MB in the beginning and 153.5MB in the end (delta: -52.6MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.59ms. Allocated memory is still 182.5MB. Free memory was 153.5MB in the beginning and 151.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 373.90ms. Allocated memory is still 182.5MB. Free memory was 150.7MB in the beginning and 137.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1628.65ms. Allocated memory is still 182.5MB. Free memory was 136.8MB in the beginning and 112.8MB in the end (delta: 23.9MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 182.5MB. Free memory was 112.8MB in the beginning and 111.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 31.25; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 0.25; [L26] float var_1_5 = 10.5; [L27] unsigned char var_1_6 = 16; [L28] double var_1_7 = 10.75; [L29] double var_1_8 = 2.675; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 2; VAL [isInitial=0, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L73] isInitial = 1 [L74] FCALL initially() [L75] COND TRUE 1 [L76] FCALL updateLastVariables() [L77] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_uchar() [L46] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L46] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L47] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L47] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L48] var_1_3 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L49] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L50] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L50] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_4=1/4, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L51] var_1_4 = __VERIFIER_nondet_float() [L52] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L52] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_5=21/2, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L53] var_1_5 = __VERIFIER_nondet_float() [L54] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L54] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_7=43/4, var_1_8=107/40, var_1_9=128] [L55] var_1_7 = __VERIFIER_nondet_double() [L56] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_8=107/40, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_8=107/40, var_1_9=128] [L56] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_8=107/40, var_1_9=128] [L57] var_1_8 = __VERIFIER_nondet_double() [L58] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=128] [L58] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=128] [L59] var_1_9 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L60] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L61] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L61] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, var_1_10=2, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L62] var_1_10 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L63] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L64] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L64] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L77] RET updateVariables() [L78] CALL step() [L35] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L40] COND FALSE !((var_1_7 - var_1_8) >= (var_1_1 + var_1_4)) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L78] RET step() [L79] CALL, EXPR property() [L69-L70] return (var_1_2 ? (var_1_3 ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) : 1) && (((var_1_7 - var_1_8) >= (var_1_1 + var_1_4)) ? (var_1_6 == ((unsigned char) (var_1_9 - var_1_10))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L79] RET, EXPR property() [L79] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] [L19] reach_error() VAL [isInitial=1, var_1_10=-129, var_1_1=125/4, var_1_2=0, var_1_3=1, var_1_6=16, var_1_9=32895] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 2, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 235 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 184 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 51 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 264/264 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-12 06:14:03,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_amount10_file-71.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 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:14:05,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:14:05,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:14:05,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:14:05,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:14:05,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:14:05,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:14:05,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:14:05,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:14:05,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:14:05,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:14:05,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:14:05,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:14:05,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:14:05,575 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:14:05,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:14:05,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:14:05,576 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:14:05,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:14:05,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:14:05,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:14:05,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:14:05,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:14:05,581 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:14:05,581 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:14:05,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:14:05,582 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:14:05,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:14:05,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:14:05,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:14:05,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:14:05,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:14:05,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:14:05,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:14:05,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:05,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:14:05,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:14:05,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:14:05,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:14:05,589 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:14:05,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:14:05,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:14:05,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:14:05,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:14:05,592 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 -> 2fa446d8c93aa6747c2c2e323426d1b7be32d5c9dc6e4b183922bd1055e01248 [2024-11-12 06:14:05,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:14:05,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:14:05,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:14:05,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:14:05,936 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:14:05,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2024-11-12 06:14:07,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:14:07,731 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:14:07,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-71.i [2024-11-12 06:14:07,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7814f3a22/00f5da3b521d42fa921220cb600f56cf/FLAGa85441f78 [2024-11-12 06:14:07,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7814f3a22/00f5da3b521d42fa921220cb600f56cf [2024-11-12 06:14:07,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:14:07,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:14:07,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:07,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:14:07,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:14:07,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:07" (1/1) ... [2024-11-12 06:14:07,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c527d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:07, skipping insertion in model container [2024-11-12 06:14:07,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:07" (1/1) ... [2024-11-12 06:14:07,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:14:08,008 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_amount10_file-71.i[915,928] [2024-11-12 06:14:08,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:08,068 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:14:08,081 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_amount10_file-71.i[915,928] [2024-11-12 06:14:08,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:08,123 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:14:08,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08 WrapperNode [2024-11-12 06:14:08,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:08,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:08,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:14:08,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:14:08,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,168 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2024-11-12 06:14:08,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:08,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:14:08,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:14:08,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:14:08,181 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,212 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-12 06:14:08,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:14:08,230 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:14:08,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:14:08,230 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:14:08,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:08,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:14:08,268 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-12 06:14:08,274 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-12 06:14:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:14:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:14:08,323 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:14:08,323 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:14:08,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:14:08,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:14:08,410 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:14:08,414 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:14:11,609 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 06:14:11,610 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:14:11,622 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:14:11,622 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:14:11,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:11 BoogieIcfgContainer [2024-11-12 06:14:11,623 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:14:11,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:14:11,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:14:11,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:14:11,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:14:07" (1/3) ... [2024-11-12 06:14:11,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc5f114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:11, skipping insertion in model container [2024-11-12 06:14:11,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (2/3) ... [2024-11-12 06:14:11,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc5f114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:11, skipping insertion in model container [2024-11-12 06:14:11,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:11" (3/3) ... [2024-11-12 06:14:11,633 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-71.i [2024-11-12 06:14:11,648 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:14:11,649 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:14:11,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:14:11,729 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;@c184ac7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:14:11,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:14:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:14:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 06:14:11,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:11,745 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:14:11,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:11,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:11,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2017305078, now seen corresponding path program 1 times [2024-11-12 06:14:11,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:11,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974022507] [2024-11-12 06:14:11,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:11,772 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-12 06:14:11,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:11,775 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-12 06:14:11,777 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-12 06:14:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:12,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 06:14:12,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:14:16,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:14:16,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:16,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974022507] [2024-11-12 06:14:16,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974022507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:16,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:16,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:14:16,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974313725] [2024-11-12 06:14:16,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:16,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:14:16,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:14:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:14:16,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:14:16,943 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 28 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:14:18,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:14:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:19,101 INFO L93 Difference]: Finished difference Result 92 states and 146 transitions. [2024-11-12 06:14:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:14:19,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-11-12 06:14:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:19,112 INFO L225 Difference]: With dead ends: 92 [2024-11-12 06:14:19,113 INFO L226 Difference]: Without dead ends: 53 [2024-11-12 06:14:19,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:14:19,118 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 19 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:19,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 203 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 06:14:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-12 06:14:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2024-11-12 06:14:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:14:19,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2024-11-12 06:14:19,151 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 79 [2024-11-12 06:14:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:19,152 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2024-11-12 06:14:19,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:14:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2024-11-12 06:14:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 06:14:19,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:19,155 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:14:19,165 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-12 06:14:19,359 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-12 06:14:19,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:19,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2019152120, now seen corresponding path program 1 times [2024-11-12 06:14:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:19,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771885235] [2024-11-12 06:14:19,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:19,362 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-12 06:14:19,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:19,364 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-12 06:14:19,365 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-12 06:14:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:19,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 06:14:19,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:14:37,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:14:37,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:37,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771885235] [2024-11-12 06:14:37,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771885235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:37,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:37,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:14:37,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500282225] [2024-11-12 06:14:37,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:37,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 06:14:37,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:14:37,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 06:14:37,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 06:14:37,420 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:14:40,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:14:47,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:14:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:53,322 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2024-11-12 06:14:53,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 06:14:53,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-11-12 06:14:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:53,337 INFO L225 Difference]: With dead ends: 53 [2024-11-12 06:14:53,337 INFO L226 Difference]: Without dead ends: 51 [2024-11-12 06:14:53,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 06:14:53,338 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 16 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:53,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 197 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-12 06:14:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-12 06:14:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2024-11-12 06:14:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:14:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2024-11-12 06:14:53,347 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 79 [2024-11-12 06:14:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:53,348 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2024-11-12 06:14:53,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:14:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2024-11-12 06:14:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 06:14:53,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:53,350 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 06:14:53,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 06:14:53,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:14:53,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:53,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:53,555 INFO L85 PathProgramCache]: Analyzing trace with hash -659565786, now seen corresponding path program 1 times [2024-11-12 06:14:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:53,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150085357] [2024-11-12 06:14:53,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:53,556 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-12 06:14:53,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:53,557 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:14:53,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 06:14:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:53,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 06:14:53,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:15:10,669 WARN L286 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 06:15:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 06:15:18,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:15:18,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:15:18,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150085357] [2024-11-12 06:15:18,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150085357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:15:18,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:15:18,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 06:15:18,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478465505] [2024-11-12 06:15:18,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:15:18,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 06:15:18,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:15:18,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 06:15:18,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 06:15:18,347 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 06:15:24,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:15:29,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:15:37,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []