./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.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 cde8d0b7ae63daaf73229c98a276eed51f74faeadb0d74d5645e79b969a982b1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:39:05,840 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:39:05,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:39:05,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:39:05,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:39:05,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:39:05,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:39:05,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:39:05,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:39:05,971 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:39:05,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:39:05,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:39:05,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:39:05,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:39:05,974 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:39:05,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:39:05,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:39:05,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:39:05,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:39:05,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:39:05,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:39:05,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:39:05,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:39:05,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:39:05,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:39:05,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:39:05,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:39:05,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:39:05,980 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:39:05,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:39:05,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:39:05,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:39:05,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:39:05,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:39:05,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:39:05,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:39:05,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:39:05,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:39:05,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:39:05,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:39:05,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:39:05,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:39:05,985 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 -> cde8d0b7ae63daaf73229c98a276eed51f74faeadb0d74d5645e79b969a982b1 [2024-10-24 10:39:06,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:39:06,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:39:06,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:39:06,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:39:06,280 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:39:06,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.i [2024-10-24 10:39:07,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:39:08,035 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:39:08,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.i [2024-10-24 10:39:08,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6865e2c/5c832ae86cf345c9980a15c9928defcf/FLAGd2d89d92f [2024-10-24 10:39:08,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f6865e2c/5c832ae86cf345c9980a15c9928defcf [2024-10-24 10:39:08,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:39:08,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:39:08,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:39:08,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:39:08,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:39:08,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d92d230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08, skipping insertion in model container [2024-10-24 10:39:08,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:39:08,646 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.i[915,928] [2024-10-24 10:39:08,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:39:08,697 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:39:08,707 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.i[915,928] [2024-10-24 10:39:08,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:39:08,746 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:39:08,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08 WrapperNode [2024-10-24 10:39:08,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:39:08,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:39:08,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:39:08,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:39:08,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,797 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-24 10:39:08,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:39:08,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:39:08,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:39:08,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:39:08,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,829 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:39:08,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:39:08,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:39:08,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:39:08,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:39:08,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (1/1) ... [2024-10-24 10:39:08,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:39:08,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:39:08,890 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-10-24 10:39:08,893 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-10-24 10:39:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:39:08,934 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:39:08,935 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:39:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:39:08,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:39:08,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:39:09,002 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:39:09,004 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:39:09,198 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 10:39:09,198 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:39:09,250 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:39:09,250 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:39:09,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:09 BoogieIcfgContainer [2024-10-24 10:39:09,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:39:09,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:39:09,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:39:09,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:39:09,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:39:08" (1/3) ... [2024-10-24 10:39:09,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b358c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:39:09, skipping insertion in model container [2024-10-24 10:39:09,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:08" (2/3) ... [2024-10-24 10:39:09,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b358c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:39:09, skipping insertion in model container [2024-10-24 10:39:09,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:09" (3/3) ... [2024-10-24 10:39:09,268 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-76.i [2024-10-24 10:39:09,286 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:39:09,287 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:39:09,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:39:09,375 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;@70d484aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:39:09,376 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:39:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 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-10-24 10:39:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 10:39:09,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:09,408 INFO L215 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] [2024-10-24 10:39:09,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:09,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:09,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1860658635, now seen corresponding path program 1 times [2024-10-24 10:39:09,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:09,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811877816] [2024-10-24 10:39:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:09,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:39:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:09,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:39:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:09,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:39:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:09,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:39:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:09,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:39:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:09,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:39:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:09,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:39:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:09,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:39:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:09,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:39:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:09,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 10:39:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:39:09,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:09,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811877816] [2024-10-24 10:39:09,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811877816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:09,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:09,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:39:09,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198123357] [2024-10-24 10:39:09,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:09,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:39:09,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:09,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:39:09,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:39:09,747 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-10-24 10:39:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:09,783 INFO L93 Difference]: Finished difference Result 65 states and 108 transitions. [2024-10-24 10:39:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:39:09,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 65 [2024-10-24 10:39:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:09,793 INFO L225 Difference]: With dead ends: 65 [2024-10-24 10:39:09,793 INFO L226 Difference]: Without dead ends: 32 [2024-10-24 10:39:09,798 INFO L431 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-10-24 10:39:09,802 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:09,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:39:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-24 10:39:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-24 10:39:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-10-24 10:39:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-24 10:39:09,839 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 65 [2024-10-24 10:39:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:09,840 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-24 10:39:09,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-10-24 10:39:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-24 10:39:09,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 10:39:09,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:09,844 INFO L215 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] [2024-10-24 10:39:09,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:39:09,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:09,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:09,846 INFO L85 PathProgramCache]: Analyzing trace with hash -424658489, now seen corresponding path program 1 times [2024-10-24 10:39:09,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:09,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314786650] [2024-10-24 10:39:09,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:09,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:10,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:39:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:10,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:39:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:10,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:39:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:10,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:39:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:10,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:39:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:10,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:39:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:10,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:39:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:10,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:39:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:10,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:39:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:10,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 10:39:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:39:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:39:10,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314786650] [2024-10-24 10:39:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314786650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:10,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:10,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:39:10,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274399158] [2024-10-24 10:39:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:10,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:39:10,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:39:10,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:39:10,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:39:10,255 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:39:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:10,327 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2024-10-24 10:39:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:39:10,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 65 [2024-10-24 10:39:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:10,331 INFO L225 Difference]: With dead ends: 94 [2024-10-24 10:39:10,331 INFO L226 Difference]: Without dead ends: 63 [2024-10-24 10:39:10,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:39:10,334 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:10,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 115 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:39:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-24 10:39:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-10-24 10:39:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 10:39:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2024-10-24 10:39:10,357 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 65 [2024-10-24 10:39:10,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:10,358 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2024-10-24 10:39:10,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:39:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-10-24 10:39:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 10:39:10,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:10,360 INFO L215 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] [2024-10-24 10:39:10,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:39:10,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:10,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash -422811447, now seen corresponding path program 1 times [2024-10-24 10:39:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:39:10,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138217657] [2024-10-24 10:39:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:10,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:39:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:39:10,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:39:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:39:10,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:39:10,549 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:39:10,550 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:39:10,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:39:10,557 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 10:39:10,619 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:39:10,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:39:10 BoogieIcfgContainer [2024-10-24 10:39:10,625 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:39:10,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:39:10,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:39:10,627 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:39:10,628 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:09" (3/4) ... [2024-10-24 10:39:10,630 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:39:10,631 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:39:10,632 INFO L158 Benchmark]: Toolchain (without parser) took 2216.65ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 104.3MB in the beginning and 184.6MB in the end (delta: -80.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:39:10,633 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 159.4MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:39:10,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.70ms. Allocated memory is still 159.4MB. Free memory was 104.3MB in the beginning and 89.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 10:39:10,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.95ms. Allocated memory is still 159.4MB. Free memory was 89.6MB in the beginning and 87.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:39:10,634 INFO L158 Benchmark]: Boogie Preprocessor took 45.44ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 84.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:39:10,634 INFO L158 Benchmark]: RCFGBuilder took 406.20ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 66.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 10:39:10,635 INFO L158 Benchmark]: TraceAbstraction took 1371.46ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 66.1MB in the beginning and 185.6MB in the end (delta: -119.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-10-24 10:39:10,635 INFO L158 Benchmark]: Witness Printer took 5.79ms. Allocated memory is still 222.3MB. Free memory is still 184.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:39:10,639 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.59ms. Allocated memory is still 159.4MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.70ms. Allocated memory is still 159.4MB. Free memory was 104.3MB in the beginning and 89.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.95ms. Allocated memory is still 159.4MB. Free memory was 89.6MB in the beginning and 87.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.44ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 84.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 406.20ms. Allocated memory is still 159.4MB. Free memory was 84.0MB in the beginning and 66.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1371.46ms. Allocated memory was 159.4MB in the beginning and 222.3MB in the end (delta: 62.9MB). Free memory was 66.1MB in the beginning and 185.6MB in the end (delta: -119.5MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Witness Printer took 5.79ms. Allocated memory is still 222.3MB. Free memory is still 184.6MB. 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 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] signed short int var_1_8 = 4; [L27] float var_1_10 = 16.4; [L28] signed short int var_1_11 = -25; [L29] float var_1_13 = 128.1; [L30] float var_1_14 = 31.4; [L31] unsigned char var_1_15 = 2; [L32] unsigned char var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] float last_1_var_1_13 = 128.1; [L35] signed long int last_1_var_1_17 = 5; [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] CALL updateLastVariables() [L78] last_1_var_1_13 = var_1_13 [L79] last_1_var_1_17 = var_1_17 [L89] RET updateLastVariables() [L90] CALL updateVariables() [L60] var_1_5 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=4] [L61] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=4] [L62] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L62] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L63] var_1_6 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_7=0, var_1_8=4] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_7=0, var_1_8=4] [L65] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L65] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L66] var_1_7 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_8=4] [L67] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_8=4] [L68] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L68] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_10=82/5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L69] var_1_10 = __VERIFIER_nondet_float() [L70] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L70] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_14=157/5, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L71] var_1_14 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L72] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=0, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L73] var_1_16 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L74] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L75] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=-252, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=-252, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L75] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=-252, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L90] RET updateVariables() [L91] CALL step() [L39] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=1281/10, var_1_15=2, var_1_16=-252, var_1_17=5, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L44] var_1_17 = var_1_8 [L45] var_1_13 = var_1_14 [L46] var_1_15 = var_1_16 [L47] signed long int stepLocal_0 = (- 5) + var_1_17; VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, stepLocal_0=-1, var_1_11=-25, var_1_13=133, var_1_14=133, var_1_15=-252, var_1_16=-252, var_1_17=4, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L48] COND FALSE !(stepLocal_0 >= var_1_15) [L51] var_1_1 = ((var_1_5 && var_1_6) || var_1_7) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=-25, var_1_13=133, var_1_14=133, var_1_15=-252, var_1_16=-252, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L53] COND TRUE var_1_10 >= 500.875f [L54] var_1_11 = ((((((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) < (var_1_15)) ? (((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=4, var_1_13=133, var_1_14=133, var_1_15=-252, var_1_16=-252, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return ((((((((- 5) + var_1_17) >= var_1_15) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) ((var_1_5 && var_1_6) || var_1_7)))) && (var_1_5 ? ((0.4f > ((((last_1_var_1_13) < ((var_1_10 - 1.375f))) ? (last_1_var_1_13) : ((var_1_10 - 1.375f))))) ? (var_1_8 == ((signed short int) last_1_var_1_17)) : 1) : 1)) && ((var_1_10 >= 500.875f) ? (var_1_11 == ((signed short int) ((((((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) < (var_1_15)) ? (((((((((-50) < 0 ) ? -(-50) : (-50)))) > (var_1_8)) ? (((((-50) < 0 ) ? -(-50) : (-50)))) : (var_1_8)))) : (var_1_15))))) : (var_1_11 == ((signed short int) var_1_15)))) && (var_1_13 == ((float) var_1_14))) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((signed long int) var_1_8)) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=4, var_1_13=133, var_1_14=133, var_1_15=-252, var_1_16=-252, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=1281/10, last_1_var_1_17=5, var_1_11=4, var_1_13=133, var_1_14=133, var_1_15=-252, var_1_16=-252, var_1_17=4, var_1_1=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 81 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 360/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:39:10,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.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 cde8d0b7ae63daaf73229c98a276eed51f74faeadb0d74d5645e79b969a982b1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:39:12,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:39:13,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:39:13,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:39:13,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:39:13,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:39:13,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:39:13,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:39:13,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:39:13,093 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:39:13,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:39:13,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:39:13,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:39:13,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:39:13,095 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:39:13,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:39:13,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:39:13,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:39:13,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:39:13,096 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:39:13,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:39:13,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:39:13,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:39:13,098 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:39:13,098 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:39:13,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:39:13,099 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:39:13,099 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:39:13,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:39:13,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:39:13,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:39:13,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:39:13,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:39:13,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:39:13,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:39:13,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:39:13,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:39:13,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:39:13,103 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:39:13,103 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:39:13,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:39:13,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:39:13,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:39:13,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:39:13,106 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:39:13,106 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 -> cde8d0b7ae63daaf73229c98a276eed51f74faeadb0d74d5645e79b969a982b1 [2024-10-24 10:39:13,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:39:13,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:39:13,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:39:13,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:39:13,465 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:39:13,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.i [2024-10-24 10:39:15,209 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:39:15,449 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:39:15,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.i [2024-10-24 10:39:15,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7083a828/736bf957d92f4049a2f9e2c35689d66a/FLAGd09b4dc94 [2024-10-24 10:39:15,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7083a828/736bf957d92f4049a2f9e2c35689d66a [2024-10-24 10:39:15,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:39:15,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:39:15,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:39:15,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:39:15,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:39:15,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:15" (1/1) ... [2024-10-24 10:39:15,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448ad4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:15, skipping insertion in model container [2024-10-24 10:39:15,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:39:15" (1/1) ... [2024-10-24 10:39:15,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:39:16,028 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.i[915,928] [2024-10-24 10:39:16,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:39:16,089 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:39:16,100 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-76.i[915,928] [2024-10-24 10:39:16,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:39:16,145 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:39:16,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16 WrapperNode [2024-10-24 10:39:16,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:39:16,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:39:16,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:39:16,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:39:16,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (1/1) ... [2024-10-24 10:39:16,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (1/1) ... [2024-10-24 10:39:16,199 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-24 10:39:16,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:39:16,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:39:16,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:39:16,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:39:16,213 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (1/1) ... [2024-10-24 10:39:16,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (1/1) ... [2024-10-24 10:39:16,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (1/1) ... [2024-10-24 10:39:16,240 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:39:16,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (1/1) ... [2024-10-24 10:39:16,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (1/1) ... [2024-10-24 10:39:16,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (1/1) ... [2024-10-24 10:39:16,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (1/1) ... [2024-10-24 10:39:16,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (1/1) ... [2024-10-24 10:39:16,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (1/1) ... [2024-10-24 10:39:16,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:39:16,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:39:16,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:39:16,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:39:16,277 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (1/1) ... [2024-10-24 10:39:16,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:39:16,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:39:16,312 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-10-24 10:39:16,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-10-24 10:39:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:39:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:39:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:39:16,366 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:39:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:39:16,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:39:16,450 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:39:16,452 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:39:16,923 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 10:39:16,923 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:39:16,990 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:39:16,991 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:39:16,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:16 BoogieIcfgContainer [2024-10-24 10:39:16,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:39:16,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:39:16,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:39:16,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:39:16,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:39:15" (1/3) ... [2024-10-24 10:39:17,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd74c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:39:17, skipping insertion in model container [2024-10-24 10:39:17,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:39:16" (2/3) ... [2024-10-24 10:39:17,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd74c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:39:17, skipping insertion in model container [2024-10-24 10:39:17,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:39:16" (3/3) ... [2024-10-24 10:39:17,003 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-76.i [2024-10-24 10:39:17,020 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:39:17,021 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:39:17,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:39:17,109 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;@4b507ef4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:39:17,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:39:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 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-10-24 10:39:17,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 10:39:17,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:17,145 INFO L215 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] [2024-10-24 10:39:17,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:17,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:17,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1860658635, now seen corresponding path program 1 times [2024-10-24 10:39:17,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:39:17,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812914569] [2024-10-24 10:39:17,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:17,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:39:17,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:39:17,174 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-10-24 10:39:17,175 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-10-24 10:39:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:17,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:39:17,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:39:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-24 10:39:17,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:39:17,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:39:17,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812914569] [2024-10-24 10:39:17,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812914569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:17,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:17,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:39:17,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428801230] [2024-10-24 10:39:17,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:17,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:39:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:39:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:39:17,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:39:17,526 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 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 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 10:39:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:17,627 INFO L93 Difference]: Finished difference Result 65 states and 108 transitions. [2024-10-24 10:39:17,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:39:17,637 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 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 65 [2024-10-24 10:39:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:17,644 INFO L225 Difference]: With dead ends: 65 [2024-10-24 10:39:17,645 INFO L226 Difference]: Without dead ends: 32 [2024-10-24 10:39:17,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:39:17,653 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:17,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:39:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-24 10:39:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-24 10:39:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-10-24 10:39:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-10-24 10:39:17,704 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 65 [2024-10-24 10:39:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:17,706 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-10-24 10:39:17,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 10:39:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-10-24 10:39:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 10:39:17,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:17,710 INFO L215 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] [2024-10-24 10:39:17,720 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-10-24 10:39:17,910 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-10-24 10:39:17,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:17,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:17,912 INFO L85 PathProgramCache]: Analyzing trace with hash -424658489, now seen corresponding path program 1 times [2024-10-24 10:39:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:39:17,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074894641] [2024-10-24 10:39:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:17,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:39:17,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:39:17,918 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-10-24 10:39:17,919 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-10-24 10:39:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:18,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 10:39:18,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:39:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 10:39:18,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:39:18,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:39:18,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074894641] [2024-10-24 10:39:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074894641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:39:18,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:39:18,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:39:18,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76064869] [2024-10-24 10:39:18,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:39:18,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:39:18,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:39:18,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:39:18,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:39:18,373 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:39:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:39:18,529 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2024-10-24 10:39:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:39:18,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 65 [2024-10-24 10:39:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:39:18,533 INFO L225 Difference]: With dead ends: 94 [2024-10-24 10:39:18,533 INFO L226 Difference]: Without dead ends: 63 [2024-10-24 10:39:18,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:39:18,535 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:39:18,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 115 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:39:18,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-24 10:39:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-10-24 10:39:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 10:39:18,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2024-10-24 10:39:18,561 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 65 [2024-10-24 10:39:18,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:39:18,566 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2024-10-24 10:39:18,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 10:39:18,566 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-10-24 10:39:18,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 10:39:18,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:39:18,568 INFO L215 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] [2024-10-24 10:39:18,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 10:39:18,772 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-10-24 10:39:18,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:39:18,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:39:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash -422811447, now seen corresponding path program 1 times [2024-10-24 10:39:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:39:18,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508372092] [2024-10-24 10:39:18,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:39:18,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:39:18,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:39:18,778 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-10-24 10:39:18,779 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-10-24 10:39:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:39:18,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 10:39:18,969 INFO L278 TraceCheckSpWp]: Computing forward predicates...