./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-29.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_amount25_file-29.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 c4d6be02e4d0ebe91e293f792b17ac6753100510b2dffdcc996eb79757e72554 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:27:09,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:27:09,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:27:09,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:27:09,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:27:09,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:27:09,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:27:09,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:27:09,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:27:09,518 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:27:09,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:27:09,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:27:09,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:27:09,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:27:09,519 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:27:09,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:27:09,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:27:09,524 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:27:09,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:27:09,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:27:09,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:27:09,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:27:09,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:27:09,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:27:09,530 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:27:09,530 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:27:09,530 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:27:09,530 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:27:09,531 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:27:09,531 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:27:09,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:27:09,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:27:09,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:27:09,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:27:09,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:27:09,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:27:09,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:27:09,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:27:09,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:27:09,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:27:09,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:27:09,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:27:09,536 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 -> c4d6be02e4d0ebe91e293f792b17ac6753100510b2dffdcc996eb79757e72554 [2024-11-12 06:27:09,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:27:09,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:27:09,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:27:09,866 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:27:09,870 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:27:09,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-29.i [2024-11-12 06:27:11,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:27:11,779 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:27:11,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-29.i [2024-11-12 06:27:11,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ebd5342/8f749d23c22d4c798f166fe8c1f3faf8/FLAG1b83bab87 [2024-11-12 06:27:11,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ebd5342/8f749d23c22d4c798f166fe8c1f3faf8 [2024-11-12 06:27:11,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:27:11,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:27:11,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:27:11,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:27:11,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:27:11,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:27:11" (1/1) ... [2024-11-12 06:27:11,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a35011e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:11, skipping insertion in model container [2024-11-12 06:27:11,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:27:11" (1/1) ... [2024-11-12 06:27:11,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:27:12,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-29.i[915,928] [2024-11-12 06:27:12,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:27:12,103 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:27:12,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-29.i[915,928] [2024-11-12 06:27:12,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:27:12,160 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:27:12,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:12 WrapperNode [2024-11-12 06:27:12,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:27:12,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:27:12,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:27:12,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:27:12,168 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:27:12" (1/1) ... [2024-11-12 06:27:12,180 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:27:12" (1/1) ... [2024-11-12 06:27:12,220 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2024-11-12 06:27:12,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:27:12,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:27:12,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:27:12,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:27:12,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:12" (1/1) ... [2024-11-12 06:27:12,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:12" (1/1) ... [2024-11-12 06:27:12,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:12" (1/1) ... [2024-11-12 06:27:12,258 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:27:12,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:12" (1/1) ... [2024-11-12 06:27:12,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:12" (1/1) ... [2024-11-12 06:27:12,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:12" (1/1) ... [2024-11-12 06:27:12,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:12" (1/1) ... [2024-11-12 06:27:12,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:12" (1/1) ... [2024-11-12 06:27:12,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:12" (1/1) ... [2024-11-12 06:27:12,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:27:12,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:27:12,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:27:12,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:27:12,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:12" (1/1) ... [2024-11-12 06:27:12,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:27:12,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:27:12,316 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:27:12,318 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:27:12,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:27:12,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:27:12,379 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:27:12,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:27:12,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:27:12,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:27:12,463 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:27:12,467 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:27:12,764 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:27:12,768 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:27:12,783 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:27:12,784 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:27:12,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:27:12 BoogieIcfgContainer [2024-11-12 06:27:12,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:27:12,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:27:12,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:27:12,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:27:12,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:27:11" (1/3) ... [2024-11-12 06:27:12,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd026db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:27:12, skipping insertion in model container [2024-11-12 06:27:12,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:12" (2/3) ... [2024-11-12 06:27:12,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd026db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:27:12, skipping insertion in model container [2024-11-12 06:27:12,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:27:12" (3/3) ... [2024-11-12 06:27:12,797 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-29.i [2024-11-12 06:27:12,815 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:27:12,816 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:27:12,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:27:12,900 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;@1f32ff7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:27:12,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:27:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:27:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 06:27:12,916 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:27:12,917 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:12,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:27:12,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:27:12,925 INFO L85 PathProgramCache]: Analyzing trace with hash 2027500392, now seen corresponding path program 1 times [2024-11-12 06:27:12,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:27:12,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759015918] [2024-11-12 06:27:12,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:27:12,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:27:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:13,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:27:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:13,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:27:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:13,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:27:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:13,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:27:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:13,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:27:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:13,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:27:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:13,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:27:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:13,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:27:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:13,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:27:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:13,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:27:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 06:27:13,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:27:13,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759015918] [2024-11-12 06:27:13,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759015918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:27:13,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:27:13,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:27:13,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830262512] [2024-11-12 06:27:13,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:27:13,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:27:13,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:27:13,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:27:13,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:27:13,306 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-12 06:27:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:27:13,327 INFO L93 Difference]: Finished difference Result 77 states and 124 transitions. [2024-11-12 06:27:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:27:13,330 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2024-11-12 06:27:13,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:27:13,336 INFO L225 Difference]: With dead ends: 77 [2024-11-12 06:27:13,337 INFO L226 Difference]: Without dead ends: 38 [2024-11-12 06:27:13,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:27:13,344 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:27:13,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:27:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-12 06:27:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-12 06:27:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:27:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-12 06:27:13,417 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 69 [2024-11-12 06:27:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:27:13,418 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-12 06:27:13,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-12 06:27:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-12 06:27:13,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 06:27:13,460 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:27:13,460 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:13,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:27:13,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:27:13,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:27:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash -606886932, now seen corresponding path program 1 times [2024-11-12 06:27:13,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:27:13,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849253547] [2024-11-12 06:27:13,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:27:13,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:27:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:27:13,568 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:27:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:27:13,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:27:13,671 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:27:13,674 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:27:13,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:27:13,679 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 06:27:13,733 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:27:13,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:27:13 BoogieIcfgContainer [2024-11-12 06:27:13,737 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:27:13,738 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:27:13,738 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:27:13,738 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:27:13,739 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:27:12" (3/4) ... [2024-11-12 06:27:13,741 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:27:13,742 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:27:13,745 INFO L158 Benchmark]: Toolchain (without parser) took 1905.29ms. Allocated memory was 134.2MB in the beginning and 197.1MB in the end (delta: 62.9MB). Free memory was 104.8MB in the beginning and 150.3MB in the end (delta: -45.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-11-12 06:27:13,745 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:27:13,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.27ms. Allocated memory was 134.2MB in the beginning and 197.1MB in the end (delta: 62.9MB). Free memory was 104.6MB in the beginning and 158.5MB in the end (delta: -54.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:27:13,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.10ms. Allocated memory is still 197.1MB. Free memory was 158.5MB in the beginning and 155.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:27:13,746 INFO L158 Benchmark]: Boogie Preprocessor took 52.69ms. Allocated memory is still 197.1MB. Free memory was 155.4MB in the beginning and 152.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 06:27:13,747 INFO L158 Benchmark]: RCFGBuilder took 509.61ms. Allocated memory is still 197.1MB. Free memory was 152.2MB in the beginning and 137.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:27:13,747 INFO L158 Benchmark]: TraceAbstraction took 950.79ms. Allocated memory is still 197.1MB. Free memory was 136.5MB in the beginning and 151.3MB in the end (delta: -14.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:27:13,747 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 197.1MB. Free memory was 151.3MB in the beginning and 150.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:27:13,752 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.21ms. Allocated memory is still 134.2MB. Free memory is still 84.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.27ms. Allocated memory was 134.2MB in the beginning and 197.1MB in the end (delta: 62.9MB). Free memory was 104.6MB in the beginning and 158.5MB in the end (delta: -54.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.10ms. Allocated memory is still 197.1MB. Free memory was 158.5MB in the beginning and 155.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.69ms. Allocated memory is still 197.1MB. Free memory was 155.4MB in the beginning and 152.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 509.61ms. Allocated memory is still 197.1MB. Free memory was 152.2MB in the beginning and 137.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 950.79ms. Allocated memory is still 197.1MB. Free memory was 136.5MB in the beginning and 151.3MB in the end (delta: -14.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 197.1MB. Free memory was 151.3MB in the beginning and 150.3MB 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 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 76. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 2.5; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 9.3; [L25] float var_1_4 = 3.4; [L26] unsigned short int var_1_5 = 32; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 64; [L29] unsigned short int var_1_8 = 16; [L30] unsigned short int var_1_9 = 1; VAL [isInitial=0, var_1_1=5/2, var_1_2=0, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L80] isInitial = 1 [L81] FCALL initially() [L82] COND TRUE 1 [L83] FCALL updateLastVariables() [L84] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=5/2, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L58] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L58] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_3=93/10, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L59] var_1_3 = __VERIFIER_nondet_float() [L60] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L60] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_4=17/5, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L61] var_1_4 = __VERIFIER_nondet_float() [L62] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L62] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=10, var_1_7=64, var_1_8=16, var_1_9=1] [L63] var_1_6 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_7=64, var_1_8=16, var_1_9=1] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_7=64, var_1_8=16, var_1_9=1] [L65] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=64, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=64, var_1_8=16, var_1_9=1] [L65] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=64, var_1_8=16, var_1_9=1] [L66] var_1_7 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_8=16, var_1_9=1] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_8=16, var_1_9=1] [L68] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=1] [L68] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=1] [L69] var_1_8 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_9=1] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_9=1] [L71] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L71] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, var_1_1=5/2, var_1_2=1, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L84] RET updateVariables() [L85] CALL step() [L34] COND TRUE \read(var_1_2) [L35] var_1_1 = var_1_3 VAL [isInitial=1, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=32, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L41] COND FALSE !((var_1_1 + 8.125) > (var_1_1 * var_1_3)) [L44] var_1_5 = var_1_8 VAL [isInitial=1, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=65534, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L46] signed long int stepLocal_0 = 5 * var_1_8; VAL [isInitial=1, stepLocal_0=327670, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=65534, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L47] COND FALSE !(((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) VAL [isInitial=1, stepLocal_0=327670, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=65534, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L85] RET step() [L86] CALL, EXPR property() [L76-L77] return ((var_1_2 ? (var_1_1 == ((float) var_1_3)) : ((! (var_1_3 < var_1_4)) ? (var_1_1 == ((float) ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) : 1)) && (((var_1_1 + 8.125) > (var_1_1 * var_1_3)) ? (var_1_5 == ((unsigned short int) (((((var_1_6 + var_1_7)) > (var_1_8)) ? ((var_1_6 + var_1_7)) : (var_1_8))))) : (var_1_5 == ((unsigned short int) var_1_8)))) && ((((((var_1_3) < (var_1_1)) ? (var_1_3) : (var_1_1))) == var_1_1) ? ((var_1_6 > (5 * var_1_8)) ? ((var_1_1 < (var_1_1 * 256.5f)) ? (var_1_9 == ((unsigned short int) var_1_6)) : 1) : 1) : 1) ; VAL [\result=0, isInitial=1, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=65534, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=65534, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_1=327675, var_1_2=1, var_1_3=327675, var_1_5=65534, var_1_6=0, var_1_7=0, var_1_8=65534, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 68 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 180/180 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:27:13,780 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_amount25_file-29.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 c4d6be02e4d0ebe91e293f792b17ac6753100510b2dffdcc996eb79757e72554 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:27:16,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:27:16,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:27:16,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:27:16,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:27:16,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:27:16,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:27:16,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:27:16,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:27:16,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:27:16,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:27:16,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:27:16,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:27:16,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:27:16,357 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:27:16,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:27:16,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:27:16,358 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:27:16,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:27:16,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:27:16,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:27:16,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:27:16,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:27:16,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:27:16,362 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:27:16,362 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:27:16,363 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:27:16,363 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:27:16,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:27:16,363 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:27:16,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:27:16,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:27:16,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:27:16,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:27:16,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:27:16,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:27:16,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:27:16,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:27:16,366 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:27:16,366 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:27:16,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:27:16,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:27:16,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:27:16,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:27:16,367 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 -> c4d6be02e4d0ebe91e293f792b17ac6753100510b2dffdcc996eb79757e72554 [2024-11-12 06:27:16,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:27:16,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:27:16,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:27:16,736 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:27:16,737 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:27:16,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-29.i [2024-11-12 06:27:18,349 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:27:18,590 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:27:18,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-29.i [2024-11-12 06:27:18,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2763b2a/23b53f5206f54e76acbd8deeec955283/FLAGac057f625 [2024-11-12 06:27:18,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2763b2a/23b53f5206f54e76acbd8deeec955283 [2024-11-12 06:27:18,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:27:18,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:27:18,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:27:18,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:27:18,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:27:18,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:27:18" (1/1) ... [2024-11-12 06:27:18,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408bdd23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:18, skipping insertion in model container [2024-11-12 06:27:18,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:27:18" (1/1) ... [2024-11-12 06:27:18,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:27:18,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-29.i[915,928] [2024-11-12 06:27:18,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:27:18,944 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:27:18,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-29.i[915,928] [2024-11-12 06:27:18,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:27:19,012 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:27:19,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:19 WrapperNode [2024-11-12 06:27:19,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:27:19,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:27:19,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:27:19,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:27:19,031 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:27:19" (1/1) ... [2024-11-12 06:27:19,045 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:27:19" (1/1) ... [2024-11-12 06:27:19,070 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2024-11-12 06:27:19,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:27:19,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:27:19,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:27:19,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:27:19,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:19" (1/1) ... [2024-11-12 06:27:19,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:19" (1/1) ... [2024-11-12 06:27:19,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:19" (1/1) ... [2024-11-12 06:27:19,100 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:27:19,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:19" (1/1) ... [2024-11-12 06:27:19,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:19" (1/1) ... [2024-11-12 06:27:19,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:19" (1/1) ... [2024-11-12 06:27:19,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:19" (1/1) ... [2024-11-12 06:27:19,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:19" (1/1) ... [2024-11-12 06:27:19,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:19" (1/1) ... [2024-11-12 06:27:19,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:27:19,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:27:19,136 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:27:19,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:27:19,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:19" (1/1) ... [2024-11-12 06:27:19,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:27:19,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:27:19,182 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:27:19,192 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:27:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:27:19,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:27:19,248 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:27:19,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:27:19,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:27:19,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:27:19,338 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:27:19,341 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:27:31,426 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:27:31,427 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:27:31,438 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:27:31,442 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:27:31,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:27:31 BoogieIcfgContainer [2024-11-12 06:27:31,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:27:31,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:27:31,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:27:31,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:27:31,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:27:18" (1/3) ... [2024-11-12 06:27:31,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19891bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:27:31, skipping insertion in model container [2024-11-12 06:27:31,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:27:19" (2/3) ... [2024-11-12 06:27:31,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19891bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:27:31, skipping insertion in model container [2024-11-12 06:27:31,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:27:31" (3/3) ... [2024-11-12 06:27:31,453 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-29.i [2024-11-12 06:27:31,469 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:27:31,470 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:27:31,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:27:31,534 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;@160cf587, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:27:31,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:27:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:27:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 06:27:31,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:27:31,548 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:31,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:27:31,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:27:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2027500392, now seen corresponding path program 1 times [2024-11-12 06:27:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:27:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178583661] [2024-11-12 06:27:31,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:27:31,568 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:27:31,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:27:31,572 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:27:31,573 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:27:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:31,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:27:31,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:27:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-12 06:27:31,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:27:31,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:27:31,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178583661] [2024-11-12 06:27:31,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178583661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:27:31,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:27:31,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:27:31,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109310319] [2024-11-12 06:27:31,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:27:31,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:27:31,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:27:31,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:27:31,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:27:31,957 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 30 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:27:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:27:31,982 INFO L93 Difference]: Finished difference Result 77 states and 124 transitions. [2024-11-12 06:27:31,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:27:31,985 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-12 06:27:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:27:31,993 INFO L225 Difference]: With dead ends: 77 [2024-11-12 06:27:31,993 INFO L226 Difference]: Without dead ends: 38 [2024-11-12 06:27:31,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:27:32,002 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:27:32,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:27:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-12 06:27:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-12 06:27:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 06:27:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-12 06:27:32,052 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 69 [2024-11-12 06:27:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:27:32,053 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-12 06:27:32,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-12 06:27:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-12 06:27:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 06:27:32,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:27:32,058 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:32,073 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:27:32,262 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:27:32,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:27:32,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:27:32,265 INFO L85 PathProgramCache]: Analyzing trace with hash -606886932, now seen corresponding path program 1 times [2024-11-12 06:27:32,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:27:32,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194928717] [2024-11-12 06:27:32,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:27:32,266 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:27:32,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:27:32,270 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:27:32,271 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:27:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:27:32,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 06:27:32,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:27:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 84 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-12 06:27:34,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:27:35,344 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-12 06:27:35,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:27:35,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194928717] [2024-11-12 06:27:35,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194928717] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 06:27:35,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 06:27:35,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-12 06:27:35,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568441552] [2024-11-12 06:27:35,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 06:27:35,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 06:27:35,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:27:35,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 06:27:35,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 06:27:35,349 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 06:27:38,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:27:41,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:27:43,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:27:47,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:27:50,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:27:54,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:27:56,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:27:59,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:28:03,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:28:06,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:28:08,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 06:28:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:28:09,483 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2024-11-12 06:28:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 06:28:09,484 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 69 [2024-11-12 06:28:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:28:09,486 INFO L225 Difference]: With dead ends: 118 [2024-11-12 06:28:09,486 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 06:28:09,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=185, Invalid=321, Unknown=0, NotChecked=0, Total=506 [2024-11-12 06:28:09,489 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 102 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:28:09,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 124 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 33.2s Time] [2024-11-12 06:28:09,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 06:28:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 57. [2024-11-12 06:28:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 06:28:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2024-11-12 06:28:09,512 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 69 [2024-11-12 06:28:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:28:09,512 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2024-11-12 06:28:09,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (20), 3 states have call predecessors, (20), 5 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-12 06:28:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2024-11-12 06:28:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-12 06:28:09,514 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:28:09,515 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:09,548 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 (3)] Ended with exit code 0 [2024-11-12 06:28:09,719 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:28:09,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:28:09,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:28:09,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2039113878, now seen corresponding path program 1 times [2024-11-12 06:28:09,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:28:09,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725794086] [2024-11-12 06:28:09,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:28:09,723 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:28:09,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:28:09,724 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:28:09,728 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:28:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:28:10,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 06:28:10,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:28:25,119 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 06:28:35,619 WARN L286 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 06:28:41,425 WARN L286 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)