./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-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_amount10_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 b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:20:22,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:20:22,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:20:22,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:20:22,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:20:22,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:20:22,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:20:22,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:20:22,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:20:22,537 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:20:22,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:20:22,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:20:22,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:20:22,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:20:22,541 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:20:22,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:20:22,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:20:22,542 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:20:22,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:20:22,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:20:22,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:20:22,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:20:22,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:20:22,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:20:22,544 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:20:22,544 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:20:22,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:20:22,545 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:20:22,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:20:22,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:20:22,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:20:22,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:20:22,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:20:22,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:20:22,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:20:22,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:20:22,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:20:22,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:20:22,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:20:22,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:20:22,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:20:22,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:20:22,549 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 -> b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 [2024-10-24 10:20:22,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:20:22,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:20:22,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:20:22,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:20:22,890 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:20:22,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2024-10-24 10:20:24,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:20:24,356 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:20:24,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2024-10-24 10:20:24,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8005735ae/2884f5d657584ae6bf2ab477ba52c750/FLAGb8cd75b3b [2024-10-24 10:20:24,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8005735ae/2884f5d657584ae6bf2ab477ba52c750 [2024-10-24 10:20:24,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:20:24,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:20:24,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:20:24,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:20:24,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:20:24,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:20:24" (1/1) ... [2024-10-24 10:20:24,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aca0365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:24, skipping insertion in model container [2024-10-24 10:20:24,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:20:24" (1/1) ... [2024-10-24 10:20:24,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:20:24,919 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i[915,928] [2024-10-24 10:20:24,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:20:24,968 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:20:24,979 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i[915,928] [2024-10-24 10:20:24,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:20:25,016 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:20:25,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:25 WrapperNode [2024-10-24 10:20:25,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:20:25,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:20:25,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:20:25,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:20:25,024 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:20:25" (1/1) ... [2024-10-24 10:20:25,030 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:20:25" (1/1) ... [2024-10-24 10:20:25,053 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2024-10-24 10:20:25,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:20:25,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:20:25,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:20:25,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:20:25,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:25" (1/1) ... [2024-10-24 10:20:25,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:25" (1/1) ... [2024-10-24 10:20:25,065 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:25" (1/1) ... [2024-10-24 10:20:25,084 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:20:25,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:25" (1/1) ... [2024-10-24 10:20:25,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:25" (1/1) ... [2024-10-24 10:20:25,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:25" (1/1) ... [2024-10-24 10:20:25,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:25" (1/1) ... [2024-10-24 10:20:25,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:25" (1/1) ... [2024-10-24 10:20:25,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:25" (1/1) ... [2024-10-24 10:20:25,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:20:25,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:20:25,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:20:25,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:20:25,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:25" (1/1) ... [2024-10-24 10:20:25,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:20:25,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:20:25,130 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:20:25,140 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:20:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:20:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:20:25,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:20:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:20:25,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:20:25,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:20:25,277 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:20:25,279 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:20:25,438 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:20:25,439 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:20:25,480 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:20:25,483 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:20:25,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:20:25 BoogieIcfgContainer [2024-10-24 10:20:25,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:20:25,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:20:25,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:20:25,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:20:25,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:20:24" (1/3) ... [2024-10-24 10:20:25,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a3342d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:20:25, skipping insertion in model container [2024-10-24 10:20:25,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:25" (2/3) ... [2024-10-24 10:20:25,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a3342d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:20:25, skipping insertion in model container [2024-10-24 10:20:25,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:20:25" (3/3) ... [2024-10-24 10:20:25,493 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-76.i [2024-10-24 10:20:25,505 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:20:25,505 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:20:25,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:20:25,558 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;@3df2e479, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:20:25,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:20:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:20:25,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 10:20:25,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:20:25,577 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 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:20:25,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:20:25,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:20:25,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1692738125, now seen corresponding path program 1 times [2024-10-24 10:20:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:20:25,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503967856] [2024-10-24 10:20:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:25,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:20:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:25,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:20:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:25,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 10:20:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:25,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 10:20:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:25,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 10:20:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:25,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:20:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:20:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:25,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:20:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:20:25,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:20:25,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503967856] [2024-10-24 10:20:25,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503967856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:20:25,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:20:25,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:20:25,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106471864] [2024-10-24 10:20:25,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:20:25,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:20:25,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:20:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:20:25,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:20:25,810 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 10:20:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:20:25,834 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2024-10-24 10:20:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:20:25,837 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2024-10-24 10:20:25,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:20:25,843 INFO L225 Difference]: With dead ends: 51 [2024-10-24 10:20:25,843 INFO L226 Difference]: Without dead ends: 25 [2024-10-24 10:20:25,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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:20:25,848 INFO L432 NwaCegarLoop]: 30 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, 30 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:20:25,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:20:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-24 10:20:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-24 10:20:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:20:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-10-24 10:20:25,878 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 47 [2024-10-24 10:20:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:20:25,879 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-10-24 10:20:25,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 10:20:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-10-24 10:20:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 10:20:25,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:20:25,881 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 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:20:25,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:20:25,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:20:25,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:20:25,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1148317523, now seen corresponding path program 1 times [2024-10-24 10:20:25,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:20:25,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647629046] [2024-10-24 10:20:25,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:25,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:20:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:26,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:20:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:26,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 10:20:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:26,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 10:20:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:26,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 10:20:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:26,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 10:20:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:26,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 10:20:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:26,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 10:20:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:26,142 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:20:26,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:20:26,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647629046] [2024-10-24 10:20:26,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647629046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:20:26,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:20:26,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:20:26,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885114704] [2024-10-24 10:20:26,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:20:26,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:20:26,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:20:26,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:20:26,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:20:26,145 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:20:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:20:26,212 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-10-24 10:20:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:20:26,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 47 [2024-10-24 10:20:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:20:26,214 INFO L225 Difference]: With dead ends: 49 [2024-10-24 10:20:26,214 INFO L226 Difference]: Without dead ends: 25 [2024-10-24 10:20:26,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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:20:26,215 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:20:26,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:20:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-24 10:20:26,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-24 10:20:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:20:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-10-24 10:20:26,224 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 47 [2024-10-24 10:20:26,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:20:26,225 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-24 10:20:26,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:20:26,226 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-10-24 10:20:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 10:20:26,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:20:26,227 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 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:20:26,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:20:26,227 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:20:26,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:20:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1148377105, now seen corresponding path program 1 times [2024-10-24 10:20:26,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:20:26,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505353580] [2024-10-24 10:20:26,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:26,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:20:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:20:26,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:20:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:20:26,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:20:26,310 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:20:26,311 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:20:26,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:20:26,315 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 10:20:26,349 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:20:26,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:20:26 BoogieIcfgContainer [2024-10-24 10:20:26,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:20:26,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:20:26,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:20:26,353 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:20:26,353 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:20:25" (3/4) ... [2024-10-24 10:20:26,355 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:20:26,356 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:20:26,356 INFO L158 Benchmark]: Toolchain (without parser) took 1585.88ms. Allocated memory is still 192.9MB. Free memory was 125.1MB in the beginning and 156.9MB in the end (delta: -31.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:20:26,357 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory was 76.1MB in the beginning and 76.0MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:20:26,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.48ms. Allocated memory is still 192.9MB. Free memory was 124.9MB in the beginning and 112.1MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:20:26,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.54ms. Allocated memory is still 192.9MB. Free memory was 111.9MB in the beginning and 110.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:20:26,358 INFO L158 Benchmark]: Boogie Preprocessor took 42.48ms. Allocated memory is still 192.9MB. Free memory was 110.1MB in the beginning and 108.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:20:26,358 INFO L158 Benchmark]: RCFGBuilder took 385.79ms. Allocated memory is still 192.9MB. Free memory was 108.0MB in the beginning and 152.8MB in the end (delta: -44.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-10-24 10:20:26,358 INFO L158 Benchmark]: TraceAbstraction took 867.38ms. Allocated memory is still 192.9MB. Free memory was 152.0MB in the beginning and 156.9MB in the end (delta: -4.9MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-10-24 10:20:26,358 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 192.9MB. Free memory is still 156.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:20:26,361 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.12ms. Allocated memory is still 104.9MB. Free memory was 76.1MB in the beginning and 76.0MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.48ms. Allocated memory is still 192.9MB. Free memory was 124.9MB in the beginning and 112.1MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.54ms. Allocated memory is still 192.9MB. Free memory was 111.9MB in the beginning and 110.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.48ms. Allocated memory is still 192.9MB. Free memory was 110.1MB in the beginning and 108.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.79ms. Allocated memory is still 192.9MB. Free memory was 108.0MB in the beginning and 152.8MB in the end (delta: -44.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * TraceAbstraction took 867.38ms. Allocated memory is still 192.9MB. Free memory was 152.0MB in the beginning and 156.9MB in the end (delta: -4.9MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 192.9MB. Free memory is still 156.9MB. 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 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 32.81; [L23] float var_1_3 = 256.25; [L24] float var_1_4 = 1.75; [L25] double var_1_5 = 10000000.5; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 0; [L29] signed char var_1_10 = 5; [L30] double last_1_var_1_1 = 32.81; [L31] unsigned char last_1_var_1_6 = 0; [L66] isInitial = 1 [L67] FCALL initially() [L68] COND TRUE 1 [L69] CALL updateLastVariables() [L58] last_1_var_1_1 = var_1_1 [L59] last_1_var_1_6 = var_1_6 [L69] RET updateLastVariables() [L70] CALL updateVariables() [L44] var_1_3 = __VERIFIER_nondet_float() [L45] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L45] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L46] var_1_4 = __VERIFIER_nondet_float() [L47] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L47] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L48] var_1_5 = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L49] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L50] var_1_8 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_9=0] [L51] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_9=0] [L52] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L52] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L53] var_1_9 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0] [L54] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0] [L55] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L55] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L70] RET updateVariables() [L71] CALL step() [L35] COND FALSE !(last_1_var_1_1 < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) - 199.2f)) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L38] COND FALSE !(\read(last_1_var_1_6)) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L41] var_1_10 = -50 [L71] RET step() [L72] CALL, EXPR property() [L62-L63] return (((last_1_var_1_1 < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) - 199.2f)) ? (var_1_1 == ((double) var_1_5)) : 1) && (last_1_var_1_6 ? (var_1_6 == ((unsigned char) (! (var_1_8 || var_1_9)))) : 1)) && (var_1_10 == ((signed char) -50)) ; [L72] RET, EXPR property() [L72] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 58 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 168/168 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:20:26,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_amount10_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 b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:20:28,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:20:28,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:20:28,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:20:28,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:20:28,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:20:28,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:20:28,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:20:28,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:20:28,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:20:28,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:20:28,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:20:28,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:20:28,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:20:28,529 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:20:28,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:20:28,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:20:28,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:20:28,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:20:28,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:20:28,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:20:28,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:20:28,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:20:28,536 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:20:28,536 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:20:28,536 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:20:28,536 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:20:28,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:20:28,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:20:28,537 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:20:28,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:20:28,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:20:28,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:20:28,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:20:28,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:20:28,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:20:28,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:20:28,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:20:28,538 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:20:28,538 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:20:28,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:20:28,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:20:28,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:20:28,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:20:28,539 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:20:28,540 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 -> b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 [2024-10-24 10:20:28,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:20:28,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:20:28,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:20:28,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:20:28,813 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:20:28,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2024-10-24 10:20:30,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:20:30,461 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:20:30,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2024-10-24 10:20:30,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be29b38bb/318f166978854404ba0bf84c75388070/FLAG877030720 [2024-10-24 10:20:30,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be29b38bb/318f166978854404ba0bf84c75388070 [2024-10-24 10:20:30,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:20:30,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:20:30,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:20:30,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:20:30,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:20:30,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:20:30" (1/1) ... [2024-10-24 10:20:30,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b74886d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30, skipping insertion in model container [2024-10-24 10:20:30,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:20:30" (1/1) ... [2024-10-24 10:20:30,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:20:30,687 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i[915,928] [2024-10-24 10:20:30,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:20:30,733 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:20:30,744 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i[915,928] [2024-10-24 10:20:30,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:20:30,778 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:20:30,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30 WrapperNode [2024-10-24 10:20:30,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:20:30,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:20:30,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:20:30,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:20:30,785 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:20:30" (1/1) ... [2024-10-24 10:20:30,796 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:20:30" (1/1) ... [2024-10-24 10:20:30,815 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2024-10-24 10:20:30,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:20:30,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:20:30,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:20:30,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:20:30,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30" (1/1) ... [2024-10-24 10:20:30,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30" (1/1) ... [2024-10-24 10:20:30,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30" (1/1) ... [2024-10-24 10:20:30,850 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:20:30,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30" (1/1) ... [2024-10-24 10:20:30,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30" (1/1) ... [2024-10-24 10:20:30,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30" (1/1) ... [2024-10-24 10:20:30,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30" (1/1) ... [2024-10-24 10:20:30,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30" (1/1) ... [2024-10-24 10:20:30,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30" (1/1) ... [2024-10-24 10:20:30,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:20:30,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:20:30,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:20:30,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:20:30,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30" (1/1) ... [2024-10-24 10:20:30,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:20:30,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:20:30,899 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:20:30,908 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:20:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:20:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:20:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:20:30,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:20:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:20:30,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:20:31,017 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:20:31,019 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:20:31,908 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:20:31,909 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:20:31,963 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:20:31,963 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:20:31,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:20:31 BoogieIcfgContainer [2024-10-24 10:20:31,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:20:31,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:20:31,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:20:31,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:20:31,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:20:30" (1/3) ... [2024-10-24 10:20:31,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68225a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:20:31, skipping insertion in model container [2024-10-24 10:20:31,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:20:30" (2/3) ... [2024-10-24 10:20:31,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68225a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:20:31, skipping insertion in model container [2024-10-24 10:20:31,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:20:31" (3/3) ... [2024-10-24 10:20:31,973 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-76.i [2024-10-24 10:20:31,988 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:20:31,989 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:20:32,043 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:20:32,049 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;@730fcaaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:20:32,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:20:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:20:32,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 10:20:32,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:20:32,061 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 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:20:32,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:20:32,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:20:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1692738125, now seen corresponding path program 1 times [2024-10-24 10:20:32,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:20:32,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935029564] [2024-10-24 10:20:32,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:32,081 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:20:32,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:20:32,086 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:20:32,089 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:20:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:32,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:20:32,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:20:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-24 10:20:32,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:20:32,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:20:32,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935029564] [2024-10-24 10:20:32,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935029564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:20:32,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:20:32,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:20:32,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799493375] [2024-10-24 10:20:32,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:20:32,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:20:32,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:20:32,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:20:32,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:20:32,282 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 10:20:32,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:20:32,479 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2024-10-24 10:20:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:20:32,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2024-10-24 10:20:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:20:32,495 INFO L225 Difference]: With dead ends: 51 [2024-10-24 10:20:32,495 INFO L226 Difference]: Without dead ends: 25 [2024-10-24 10:20:32,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 46 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:20:32,500 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 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.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:20:32,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:20:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-24 10:20:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-24 10:20:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:20:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-10-24 10:20:32,534 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 47 [2024-10-24 10:20:32,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:20:32,535 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-10-24 10:20:32,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 10:20:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-10-24 10:20:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 10:20:32,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:20:32,537 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 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:20:32,542 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:20:32,738 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:20:32,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:20:32,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:20:32,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1148317523, now seen corresponding path program 1 times [2024-10-24 10:20:32,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:20:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181459497] [2024-10-24 10:20:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:32,740 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:20:32,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:20:32,747 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:20:32,750 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:20:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:32,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 10:20:32,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:20:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:20:33,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:20:33,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:20:33,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181459497] [2024-10-24 10:20:33,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181459497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:20:33,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:20:33,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:20:33,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979851042] [2024-10-24 10:20:33,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:20:33,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:20:33,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:20:33,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:20:33,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:20:33,004 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:20:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:20:33,213 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2024-10-24 10:20:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:20:33,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 47 [2024-10-24 10:20:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:20:33,219 INFO L225 Difference]: With dead ends: 49 [2024-10-24 10:20:33,219 INFO L226 Difference]: Without dead ends: 25 [2024-10-24 10:20:33,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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:20:33,220 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:20:33,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 28 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:20:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-24 10:20:33,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-24 10:20:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:20:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-10-24 10:20:33,227 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 47 [2024-10-24 10:20:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:20:33,229 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-10-24 10:20:33,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:20:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-10-24 10:20:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 10:20:33,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:20:33,230 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 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:20:33,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 10:20:33,431 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:20:33,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:20:33,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:20:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1148377105, now seen corresponding path program 1 times [2024-10-24 10:20:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:20:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412415866] [2024-10-24 10:20:33,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:20:33,433 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:20:33,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:20:33,435 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:20:33,437 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:20:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:20:33,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 10:20:33,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:20:51,078 WARN L286 SmtUtils]: Spent 7.98s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-24 10:21:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 10:21:04,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:21:04,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:21:04,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412415866] [2024-10-24 10:21:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412415866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:21:04,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:21:04,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:21:04,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288058472] [2024-10-24 10:21:04,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:21:04,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:21:04,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:21:04,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:21:04,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:21:04,672 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:21:05,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:21:08,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:21:09,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:21:11,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:21:13,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:21:14,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:21:17,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:21:19,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:21:23,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:21:27,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:21:37,431 WARN L286 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-24 10:21:39,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:21:40,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:21:40,931 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-10-24 10:21:40,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:21:40,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 47 [2024-10-24 10:21:40,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:21:40,952 INFO L225 Difference]: With dead ends: 32 [2024-10-24 10:21:40,952 INFO L226 Difference]: Without dead ends: 30 [2024-10-24 10:21:40,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:21:40,953 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2024-10-24 10:21:40,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 63 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 25.9s Time] [2024-10-24 10:21:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-24 10:21:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-24 10:21:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-24 10:21:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-10-24 10:21:40,959 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 47 [2024-10-24 10:21:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:21:40,959 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-10-24 10:21:40,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 10:21:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-10-24 10:21:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 10:21:40,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:21:40,961 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 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:21:40,970 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 (4)] Ended with exit code 0 [2024-10-24 10:21:41,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:21:41,162 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:21:41,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:21:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1146530063, now seen corresponding path program 1 times [2024-10-24 10:21:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:21:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069561955] [2024-10-24 10:21:41,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:21:41,163 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:21:41,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:21:41,166 INFO L229 MonitoredProcess]: Starting monitored process 5 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:21:41,167 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 (5)] Waiting until timeout for monitored process [2024-10-24 10:21:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:21:41,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 10:21:41,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:21:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 10:21:46,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:21:58,519 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 996.0 5.0)))) (let ((.cse1 (forall ((~var_1_4~0 (_ FloatingPoint 8 24)) (~var_1_3~0 (_ FloatingPoint 8 24))) (or (forall ((~last_1_var_1_1~0 (_ FloatingPoint 11 53))) (not (fp.lt ~last_1_var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode ~var_1_3~0 .cse2))))) (not (fp.lt ~var_1_3~0 ~var_1_4~0))))) (.cse3 (= (_ bv0 8) c_~last_1_var_1_6~0)) (.cse0 (fp.eq c_~var_1_1~0 c_~var_1_5~0))) (and (or (not .cse0) (and (or (and .cse1 (forall ((~var_1_4~0 (_ FloatingPoint 8 24)) (~var_1_3~0 (_ FloatingPoint 8 24))) (or (not (fp.lt ~var_1_3~0 ~var_1_4~0)) (forall ((~last_1_var_1_1~0 (_ FloatingPoint 11 53))) (fp.lt ~last_1_var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode ~var_1_3~0 .cse2))))))) .cse3) (or (and (forall ((~var_1_4~0 (_ FloatingPoint 8 24)) (~var_1_3~0 (_ FloatingPoint 8 24))) (or (forall ((~last_1_var_1_1~0 (_ FloatingPoint 11 53))) (not (fp.lt ~last_1_var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode ~var_1_4~0 .cse2))))) (fp.lt ~var_1_3~0 ~var_1_4~0))) (forall ((~var_1_4~0 (_ FloatingPoint 8 24)) (~var_1_3~0 (_ FloatingPoint 8 24))) (or (forall ((~last_1_var_1_1~0 (_ FloatingPoint 11 53))) (fp.lt ~last_1_var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode ~var_1_4~0 .cse2)))) (fp.lt ~var_1_3~0 ~var_1_4~0)))) .cse3))) (or (and .cse1 .cse3 (forall ((~last_1_var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 8 24)) (~var_1_3~0 (_ FloatingPoint 8 24))) (or (not (fp.lt ~last_1_var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode ~var_1_4~0 .cse2)))) (fp.lt ~var_1_3~0 ~var_1_4~0)))) .cse0)))) is different from true [2024-10-24 10:22:06,048 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 996.0 5.0)))) (let ((.cse0 (forall ((~var_1_4~0 (_ FloatingPoint 8 24)) (~var_1_3~0 (_ FloatingPoint 8 24))) (or (forall ((~last_1_var_1_1~0 (_ FloatingPoint 11 53))) (not (fp.lt ~last_1_var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode ~var_1_3~0 .cse1))))) (not (fp.lt ~var_1_3~0 ~var_1_4~0))))) (.cse2 (= (_ bv0 8) c_~last_1_var_1_6~0))) (and (or (and .cse0 (forall ((~var_1_4~0 (_ FloatingPoint 8 24)) (~var_1_3~0 (_ FloatingPoint 8 24))) (or (not (fp.lt ~var_1_3~0 ~var_1_4~0)) (forall ((~last_1_var_1_1~0 (_ FloatingPoint 11 53))) (fp.lt ~last_1_var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode ~var_1_3~0 .cse1))))))) .cse2) (or (and .cse0 .cse2 (forall ((~last_1_var_1_1~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 8 24)) (~var_1_3~0 (_ FloatingPoint 8 24))) (or (not (fp.lt ~last_1_var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode ~var_1_4~0 .cse1)))) (fp.lt ~var_1_3~0 ~var_1_4~0)))) (fp.eq c_~var_1_1~0 c_~var_1_5~0)) (or (and (forall ((~var_1_4~0 (_ FloatingPoint 8 24)) (~var_1_3~0 (_ FloatingPoint 8 24))) (or (forall ((~last_1_var_1_1~0 (_ FloatingPoint 11 53))) (not (fp.lt ~last_1_var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode ~var_1_4~0 .cse1))))) (fp.lt ~var_1_3~0 ~var_1_4~0))) (forall ((~var_1_4~0 (_ FloatingPoint 8 24)) (~var_1_3~0 (_ FloatingPoint 8 24))) (or (forall ((~last_1_var_1_1~0 (_ FloatingPoint 11 53))) (fp.lt ~last_1_var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.sub c_currentRoundingMode ~var_1_4~0 .cse1)))) (fp.lt ~var_1_3~0 ~var_1_4~0)))) .cse2)))) is different from true