./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:29:14,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:29:14,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:29:14,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:29:14,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:29:14,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:29:14,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:29:14,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:29:14,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:29:14,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:29:14,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:29:14,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:29:14,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:29:14,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:29:14,364 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:29:14,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:29:14,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:29:14,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:29:14,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:29:14,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:29:14,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:29:14,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:29:14,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:29:14,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:29:14,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:29:14,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:29:14,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:29:14,365 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:29:14,365 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:29:14,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:29:14,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:29:14,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:29:14,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:29:14,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:29:14,367 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:29:14,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:29:14,367 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 [2025-01-09 12:29:14,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:29:14,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:29:14,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:29:14,667 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:29:14,667 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:29:14,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2025-01-09 12:29:15,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cda37c8f/bd8c6dbf51b64e01a3dd58ef05c36e4c/FLAGd478c39b2 [2025-01-09 12:29:16,282 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:29:16,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2025-01-09 12:29:16,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cda37c8f/bd8c6dbf51b64e01a3dd58ef05c36e4c/FLAGd478c39b2 [2025-01-09 12:29:16,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4cda37c8f/bd8c6dbf51b64e01a3dd58ef05c36e4c [2025-01-09 12:29:16,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:29:16,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:29:16,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:29:16,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:29:16,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:29:16,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fec0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16, skipping insertion in model container [2025-01-09 12:29:16,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:29:16,687 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i[917,930] [2025-01-09 12:29:16,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:29:16,761 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:29:16,774 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i[917,930] [2025-01-09 12:29:16,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:29:16,823 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:29:16,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16 WrapperNode [2025-01-09 12:29:16,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:29:16,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:29:16,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:29:16,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:29:16,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,884 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2025-01-09 12:29:16,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:29:16,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:29:16,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:29:16,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:29:16,892 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,906 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]. [2025-01-09 12:29:16,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:29:16,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:29:16,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:29:16,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:29:16,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (1/1) ... [2025-01-09 12:29:16,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:29:16,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:29:16,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:29:16,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:29:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:29:17,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:29:17,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:29:17,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:29:17,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:29:17,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:29:17,074 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:29:17,076 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:29:17,379 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 12:29:17,379 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:29:17,393 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:29:17,393 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:29:17,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:29:17 BoogieIcfgContainer [2025-01-09 12:29:17,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:29:17,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:29:17,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:29:17,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:29:17,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:29:16" (1/3) ... [2025-01-09 12:29:17,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3423d97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:29:17, skipping insertion in model container [2025-01-09 12:29:17,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:16" (2/3) ... [2025-01-09 12:29:17,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3423d97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:29:17, skipping insertion in model container [2025-01-09 12:29:17,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:29:17" (3/3) ... [2025-01-09 12:29:17,404 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-33.i [2025-01-09 12:29:17,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:29:17,416 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-33.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:29:17,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:29:17,487 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;@d7711c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:29:17,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:29:17,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:29:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 12:29:17,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:17,500 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:17,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:17,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash -103364123, now seen corresponding path program 1 times [2025-01-09 12:29:17,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:17,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423638916] [2025-01-09 12:29:17,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:17,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 12:29:17,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 12:29:17,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:17,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 12:29:17,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423638916] [2025-01-09 12:29:17,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423638916] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:29:17,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002670809] [2025-01-09 12:29:17,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:17,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:29:17,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:29:17,726 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:29:17,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:29:17,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 12:29:17,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 12:29:17,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:17,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:17,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:29:17,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:29:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 12:29:17,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:29:17,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002670809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:17,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:29:17,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:29:17,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202089019] [2025-01-09 12:29:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:17,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:29:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:29:17,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:29:17,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:29:17,886 INFO L87 Difference]: Start difference. First operand has 65 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 54 states have internal predecessors, (77), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 12:29:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:17,914 INFO L93 Difference]: Finished difference Result 124 states and 194 transitions. [2025-01-09 12:29:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:29:17,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2025-01-09 12:29:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:17,922 INFO L225 Difference]: With dead ends: 124 [2025-01-09 12:29:17,922 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 12:29:17,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:29:17,929 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:17,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:29:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 12:29:17,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-01-09 12:29:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:29:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2025-01-09 12:29:17,976 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 74 [2025-01-09 12:29:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:17,977 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2025-01-09 12:29:17,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 12:29:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2025-01-09 12:29:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 12:29:17,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:17,979 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:17,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:29:18,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:29:18,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:18,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:18,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1510341589, now seen corresponding path program 1 times [2025-01-09 12:29:18,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:18,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575118237] [2025-01-09 12:29:18,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:18,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:18,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 12:29:18,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 12:29:18,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:18,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:29:18,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:18,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575118237] [2025-01-09 12:29:18,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575118237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:18,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:29:18,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:29:18,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424348626] [2025-01-09 12:29:18,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:18,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:29:18,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:29:18,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:29:18,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:29:18,475 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:18,504 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2025-01-09 12:29:18,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:29:18,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2025-01-09 12:29:18,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:18,507 INFO L225 Difference]: With dead ends: 122 [2025-01-09 12:29:18,507 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 12:29:18,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:29:18,508 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:18,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:29:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 12:29:18,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-09 12:29:18,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:29:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2025-01-09 12:29:18,521 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 74 [2025-01-09 12:29:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:18,522 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2025-01-09 12:29:18,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2025-01-09 12:29:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 12:29:18,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:18,526 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:18,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:29:18,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:18,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash -830283219, now seen corresponding path program 1 times [2025-01-09 12:29:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:18,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380276606] [2025-01-09 12:29:18,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:18,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 12:29:18,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 12:29:18,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:18,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:29:18,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:18,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380276606] [2025-01-09 12:29:18,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380276606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:18,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:29:18,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:29:18,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284140302] [2025-01-09 12:29:18,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:18,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:29:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:29:18,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:29:18,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:29:18,742 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:18,950 INFO L93 Difference]: Finished difference Result 148 states and 214 transitions. [2025-01-09 12:29:18,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:29:18,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2025-01-09 12:29:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:18,952 INFO L225 Difference]: With dead ends: 148 [2025-01-09 12:29:18,952 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 12:29:18,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:29:18,953 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 85 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:18,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 275 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:29:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 12:29:18,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2025-01-09 12:29:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:29:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2025-01-09 12:29:18,970 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 74 [2025-01-09 12:29:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:18,971 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2025-01-09 12:29:18,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2025-01-09 12:29:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 12:29:18,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:18,974 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:18,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:29:18,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:18,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash -572117781, now seen corresponding path program 1 times [2025-01-09 12:29:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:18,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303073529] [2025-01-09 12:29:18,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:18,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 12:29:19,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 12:29:19,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:19,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:29:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:20,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303073529] [2025-01-09 12:29:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303073529] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:20,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:29:20,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:29:20,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484543190] [2025-01-09 12:29:20,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:20,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:29:20,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:29:20,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:29:20,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:29:20,579 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:21,120 INFO L93 Difference]: Finished difference Result 253 states and 364 transitions. [2025-01-09 12:29:21,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:29:21,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2025-01-09 12:29:21,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:21,124 INFO L225 Difference]: With dead ends: 253 [2025-01-09 12:29:21,124 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 12:29:21,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:29:21,127 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 397 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:21,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 218 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:29:21,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 12:29:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 83. [2025-01-09 12:29:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 72 states have internal predecessors, (101), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:29:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2025-01-09 12:29:21,144 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 74 [2025-01-09 12:29:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:21,144 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2025-01-09 12:29:21,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2025-01-09 12:29:21,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 12:29:21,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:21,147 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:21,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:29:21,147 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:21,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1728704809, now seen corresponding path program 1 times [2025-01-09 12:29:21,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:21,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077125195] [2025-01-09 12:29:21,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:21,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 12:29:21,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 12:29:21,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:21,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:29:21,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:21,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077125195] [2025-01-09 12:29:21,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077125195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:21,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:29:21,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:29:21,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72914967] [2025-01-09 12:29:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:21,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:29:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:29:21,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:29:21,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:29:21,664 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:22,010 INFO L93 Difference]: Finished difference Result 195 states and 281 transitions. [2025-01-09 12:29:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:29:22,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2025-01-09 12:29:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:22,012 INFO L225 Difference]: With dead ends: 195 [2025-01-09 12:29:22,012 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 12:29:22,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:29:22,014 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 140 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:22,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 227 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:29:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 12:29:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 77. [2025-01-09 12:29:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:29:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2025-01-09 12:29:22,029 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 74 [2025-01-09 12:29:22,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:22,029 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2025-01-09 12:29:22,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2025-01-09 12:29:22,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 12:29:22,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:22,031 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:22,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:29:22,031 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:22,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1783952483, now seen corresponding path program 1 times [2025-01-09 12:29:22,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:22,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700546460] [2025-01-09 12:29:22,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:22,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:22,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 12:29:22,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 12:29:22,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:22,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:29:22,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:22,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700546460] [2025-01-09 12:29:22,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700546460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:22,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:29:22,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:29:22,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465905094] [2025-01-09 12:29:22,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:22,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:29:22,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:29:22,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:29:22,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:29:22,083 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:22,137 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2025-01-09 12:29:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:29:22,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2025-01-09 12:29:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:22,139 INFO L225 Difference]: With dead ends: 196 [2025-01-09 12:29:22,139 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 12:29:22,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:29:22,141 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 54 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:22,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 183 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:29:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 12:29:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 90. [2025-01-09 12:29:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:29:22,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2025-01-09 12:29:22,154 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 75 [2025-01-09 12:29:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:22,154 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2025-01-09 12:29:22,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:22,155 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2025-01-09 12:29:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 12:29:22,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:22,156 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:22,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:29:22,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:22,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:22,156 INFO L85 PathProgramCache]: Analyzing trace with hash -444698480, now seen corresponding path program 1 times [2025-01-09 12:29:22,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:22,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566066909] [2025-01-09 12:29:22,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:22,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:22,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 12:29:22,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 12:29:22,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:22,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:29:22,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:22,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566066909] [2025-01-09 12:29:22,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566066909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:22,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:29:22,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:29:22,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873594484] [2025-01-09 12:29:22,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:22,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:29:22,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:29:22,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:29:22,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:29:22,199 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:22,244 INFO L93 Difference]: Finished difference Result 207 states and 295 transitions. [2025-01-09 12:29:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:29:22,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2025-01-09 12:29:22,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:22,246 INFO L225 Difference]: With dead ends: 207 [2025-01-09 12:29:22,246 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 12:29:22,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:29:22,249 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 75 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:22,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 143 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:29:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 12:29:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 78. [2025-01-09 12:29:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:29:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2025-01-09 12:29:22,263 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 75 [2025-01-09 12:29:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:22,263 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2025-01-09 12:29:22,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2025-01-09 12:29:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 12:29:22,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:22,266 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:22,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:29:22,266 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:22,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1438983518, now seen corresponding path program 1 times [2025-01-09 12:29:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:22,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739341094] [2025-01-09 12:29:22,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:22,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 12:29:22,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 12:29:22,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:22,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:29:22,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:22,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739341094] [2025-01-09 12:29:22,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739341094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:22,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:29:22,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:29:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187354628] [2025-01-09 12:29:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:22,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:29:22,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:29:22,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:29:22,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:29:22,375 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:22,638 INFO L93 Difference]: Finished difference Result 241 states and 333 transitions. [2025-01-09 12:29:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 12:29:22,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2025-01-09 12:29:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:22,640 INFO L225 Difference]: With dead ends: 241 [2025-01-09 12:29:22,640 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 12:29:22,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:29:22,641 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 201 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:22,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 314 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:29:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 12:29:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2025-01-09 12:29:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 137 states have internal predecessors, (180), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:29:22,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 220 transitions. [2025-01-09 12:29:22,664 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 220 transitions. Word has length 76 [2025-01-09 12:29:22,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:22,665 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 220 transitions. [2025-01-09 12:29:22,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:22,665 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 220 transitions. [2025-01-09 12:29:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 12:29:22,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:22,666 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:22,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:29:22,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:22,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:22,668 INFO L85 PathProgramCache]: Analyzing trace with hash 852177504, now seen corresponding path program 1 times [2025-01-09 12:29:22,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:22,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310461093] [2025-01-09 12:29:22,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:22,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:22,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 12:29:22,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 12:29:22,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:22,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:29:23,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:23,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310461093] [2025-01-09 12:29:23,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310461093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:23,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:29:23,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:29:23,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318492643] [2025-01-09 12:29:23,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:23,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:29:23,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:29:23,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:29:23,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:29:23,767 INFO L87 Difference]: Start difference. First operand 160 states and 220 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:24,518 INFO L93 Difference]: Finished difference Result 467 states and 645 transitions. [2025-01-09 12:29:24,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:29:24,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2025-01-09 12:29:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:24,523 INFO L225 Difference]: With dead ends: 467 [2025-01-09 12:29:24,523 INFO L226 Difference]: Without dead ends: 314 [2025-01-09 12:29:24,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:29:24,524 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 353 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:24,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 205 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:29:24,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-01-09 12:29:24,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 180. [2025-01-09 12:29:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 157 states have internal predecessors, (209), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:29:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 249 transitions. [2025-01-09 12:29:24,546 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 249 transitions. Word has length 76 [2025-01-09 12:29:24,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:24,547 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 249 transitions. [2025-01-09 12:29:24,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 249 transitions. [2025-01-09 12:29:24,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 12:29:24,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:24,549 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:24,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:29:24,549 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:24,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:24,550 INFO L85 PathProgramCache]: Analyzing trace with hash 34529054, now seen corresponding path program 1 times [2025-01-09 12:29:24,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:24,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140084624] [2025-01-09 12:29:24,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:24,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:24,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 12:29:24,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 12:29:24,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:24,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:29:24,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:24,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140084624] [2025-01-09 12:29:24,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140084624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:24,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:29:24,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:29:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181375602] [2025-01-09 12:29:24,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:24,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:29:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:29:24,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:29:24,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:29:24,641 INFO L87 Difference]: Start difference. First operand 180 states and 249 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:24,723 INFO L93 Difference]: Finished difference Result 504 states and 698 transitions. [2025-01-09 12:29:24,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:29:24,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2025-01-09 12:29:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:24,727 INFO L225 Difference]: With dead ends: 504 [2025-01-09 12:29:24,727 INFO L226 Difference]: Without dead ends: 331 [2025-01-09 12:29:24,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:29:24,728 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 61 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:24,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 174 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:29:24,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-01-09 12:29:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 260. [2025-01-09 12:29:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 224 states have (on average 1.3348214285714286) internal successors, (299), 226 states have internal predecessors, (299), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 12:29:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 357 transitions. [2025-01-09 12:29:24,755 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 357 transitions. Word has length 76 [2025-01-09 12:29:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:24,755 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 357 transitions. [2025-01-09 12:29:24,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 357 transitions. [2025-01-09 12:29:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 12:29:24,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:24,756 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:24,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:29:24,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:24,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash 886450430, now seen corresponding path program 1 times [2025-01-09 12:29:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:24,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016933515] [2025-01-09 12:29:24,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:24,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:24,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 12:29:24,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 12:29:24,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 12:29:24,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:29:24,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016933515] [2025-01-09 12:29:24,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016933515] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:29:24,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465546799] [2025-01-09 12:29:24,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:24,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:29:24,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:29:24,903 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:29:24,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:29:24,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 12:29:24,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 12:29:24,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:24,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:24,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 12:29:24,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:29:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 12:29:25,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:29:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 12:29:25,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465546799] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:29:25,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:29:25,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2025-01-09 12:29:25,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296055391] [2025-01-09 12:29:25,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:29:25,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:29:25,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:29:25,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:29:25,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:29:25,382 INFO L87 Difference]: Start difference. First operand 260 states and 357 transitions. Second operand has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2025-01-09 12:29:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:26,005 INFO L93 Difference]: Finished difference Result 872 states and 1163 transitions. [2025-01-09 12:29:26,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 12:29:26,006 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) Word has length 77 [2025-01-09 12:29:26,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:26,011 INFO L225 Difference]: With dead ends: 872 [2025-01-09 12:29:26,012 INFO L226 Difference]: Without dead ends: 768 [2025-01-09 12:29:26,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=933, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 12:29:26,014 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 1193 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:26,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 759 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:29:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-01-09 12:29:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 278. [2025-01-09 12:29:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 220 states have (on average 1.2636363636363637) internal successors, (278), 221 states have internal predecessors, (278), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 12:29:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 368 transitions. [2025-01-09 12:29:26,053 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 368 transitions. Word has length 77 [2025-01-09 12:29:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:26,053 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 368 transitions. [2025-01-09 12:29:26,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2025-01-09 12:29:26,054 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 368 transitions. [2025-01-09 12:29:26,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 12:29:26,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:26,055 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:26,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 12:29:26,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:29:26,259 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:26,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:26,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1309152256, now seen corresponding path program 1 times [2025-01-09 12:29:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:29:26,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795466625] [2025-01-09 12:29:26,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:26,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:29:26,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 12:29:26,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 12:29:26,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:26,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:29:26,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:29:26,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 12:29:26,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 12:29:26,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:26,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:29:26,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:29:26,338 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:29:26,339 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:29:26,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:29:26,344 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:26,415 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:29:26,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:29:26 BoogieIcfgContainer [2025-01-09 12:29:26,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:29:26,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:29:26,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:29:26,421 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:29:26,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:29:17" (3/4) ... [2025-01-09 12:29:26,423 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:29:26,424 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:29:26,425 INFO L158 Benchmark]: Toolchain (without parser) took 9894.95ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.2MB in the beginning and 122.6MB in the end (delta: -10.4MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2025-01-09 12:29:26,426 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:29:26,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.47ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.6MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:29:26,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.20ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 96.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:29:26,426 INFO L158 Benchmark]: Boogie Preprocessor took 50.57ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 93.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:29:26,426 INFO L158 Benchmark]: RCFGBuilder took 457.18ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 73.1MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 12:29:26,427 INFO L158 Benchmark]: TraceAbstraction took 9019.93ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 72.6MB in the beginning and 124.9MB in the end (delta: -52.3MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2025-01-09 12:29:26,427 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 218.1MB. Free memory was 124.9MB in the beginning and 122.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:29:26,429 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.26ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.47ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 99.6MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.20ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 96.8MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.57ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 93.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 457.18ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 73.1MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9019.93ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 72.6MB in the beginning and 124.9MB in the end (delta: -52.3MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 218.1MB. Free memory was 124.9MB in the beginning and 122.6MB in the end (delta: 2.3MB). 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 84, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] signed short int var_1_5 = 4; [L24] unsigned char var_1_7 = 200; [L25] unsigned char var_1_8 = 32; [L26] float var_1_9 = 256.5; [L27] float var_1_10 = -0.25; [L28] float var_1_11 = 0.30000000000000004; [L29] float var_1_12 = 49.5; [L30] signed long int var_1_13 = -8; [L31] unsigned char var_1_14 = 0; [L32] float var_1_15 = 0.4; [L33] signed long int var_1_16 = -256; [L34] signed long int last_1_var_1_13 = -8; VAL [isInitial=0, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=4, var_1_7=200, var_1_8=32, var_1_9=513/2] [L88] isInitial = 1 [L89] FCALL initially() [L91] CALL updateLastVariables() [L81] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=4, var_1_7=200, var_1_8=32, var_1_9=513/2] [L91] RET updateLastVariables() [L92] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L67] var_1_8 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L72] var_1_11 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L74] var_1_12 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L92] RET updateVariables() [L93] CALL step() [L38] COND FALSE !(var_1_5 < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L41] var_1_16 = var_1_7 [L42] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L43] COND TRUE ! var_1_14 [L44] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=0, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L52] var_1_15 = var_1_11 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] signed long int stepLocal_0 = (var_1_13 ^ var_1_7) + var_1_16; [L54] COND FALSE !(stepLocal_0 < -1) [L57] var_1_1 = (128 - (var_1_7 + var_1_7)) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] COND FALSE !(var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84-L85] return ((((((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1)) && ((! var_1_14) ? (var_1_13 == ((signed long int) var_1_8)) : ((var_1_7 > (var_1_7 + var_1_7)) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_16))))) && (var_1_15 == ((float) var_1_11))) && (var_1_16 == ((signed long int) var_1_7)) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2567 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2559 mSDsluCounter, 2760 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1828 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1681 IncrementalHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 932 mSDtfsCounter, 1681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=11, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 944 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1053 NumberOfCodeBlocks, 1053 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 4718 SizeOfPredicates, 4 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 1928/2016 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 12:29:26,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:29:28,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:29:28,805 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:29:28,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:29:28,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:29:28,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:29:28,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:29:28,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:29:28,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:29:28,836 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:29:28,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:29:28,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:29:28,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:29:28,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:29:28,838 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:29:28,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:29:28,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:29:28,838 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:29:28,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:29:28,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:29:28,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:29:28,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:29:28,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:29:28,839 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:29:28,839 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:29:28,839 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:29:28,839 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:29:28,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:29:28,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:29:28,839 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:29:28,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:29:28,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:29:28,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:29:28,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:29:28,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:29:28,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:29:28,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:29:28,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:29:28,842 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 8c657d494f862b4e748f718e9b06d9431fa0d9b5ab160606f6187c22952013a2 [2025-01-09 12:29:29,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:29:29,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:29:29,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:29:29,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:29:29,121 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:29:29,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2025-01-09 12:29:30,490 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/815d8e648/cf2d40d7d0914e6ab0b21ca1259926d0/FLAGf64794c3d [2025-01-09 12:29:30,744 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:29:30,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i [2025-01-09 12:29:30,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/815d8e648/cf2d40d7d0914e6ab0b21ca1259926d0/FLAGf64794c3d [2025-01-09 12:29:30,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/815d8e648/cf2d40d7d0914e6ab0b21ca1259926d0 [2025-01-09 12:29:30,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:29:30,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:29:30,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:29:30,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:29:30,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:29:30,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:29:30" (1/1) ... [2025-01-09 12:29:30,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113dc4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:30, skipping insertion in model container [2025-01-09 12:29:30,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:29:30" (1/1) ... [2025-01-09 12:29:30,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:29:30,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i[917,930] [2025-01-09 12:29:30,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:29:31,004 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:29:31,016 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-33.i[917,930] [2025-01-09 12:29:31,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:29:31,064 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:29:31,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31 WrapperNode [2025-01-09 12:29:31,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:29:31,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:29:31,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:29:31,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:29:31,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,109 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2025-01-09 12:29:31,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:29:31,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:29:31,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:29:31,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:29:31,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,147 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]. [2025-01-09 12:29:31,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:29:31,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:29:31,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:29:31,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:29:31,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (1/1) ... [2025-01-09 12:29:31,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:29:31,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:29:31,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:29:31,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:29:31,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:29:31,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:29:31,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:29:31,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:29:31,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:29:31,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:29:31,343 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:29:31,345 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:29:32,076 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:29:32,076 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:29:32,084 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:29:32,085 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:29:32,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:29:32 BoogieIcfgContainer [2025-01-09 12:29:32,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:29:32,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:29:32,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:29:32,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:29:32,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:29:30" (1/3) ... [2025-01-09 12:29:32,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75887f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:29:32, skipping insertion in model container [2025-01-09 12:29:32,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:31" (2/3) ... [2025-01-09 12:29:32,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75887f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:29:32, skipping insertion in model container [2025-01-09 12:29:32,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:29:32" (3/3) ... [2025-01-09 12:29:32,094 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-33.i [2025-01-09 12:29:32,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:29:32,107 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-33.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:29:32,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:29:32,170 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;@69033225, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:29:32,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:29:32,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:29:32,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 12:29:32,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:32,182 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:32,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:32,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash 60799829, now seen corresponding path program 1 times [2025-01-09 12:29:32,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:29:32,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585440513] [2025-01-09 12:29:32,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:32,202 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 [2025-01-09 12:29:32,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:29:32,206 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:29:32,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 12:29:32,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 12:29:32,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 12:29:32,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:32,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:32,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:29:32,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:29:32,474 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 12:29:32,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:29:32,474 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:29:32,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585440513] [2025-01-09 12:29:32,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585440513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:32,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:29:32,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:29:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734963798] [2025-01-09 12:29:32,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:32,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:29:32,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:29:32,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:29:32,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:29:32,500 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 12:29:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:32,517 INFO L93 Difference]: Finished difference Result 74 states and 114 transitions. [2025-01-09 12:29:32,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:29:32,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-01-09 12:29:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:32,524 INFO L225 Difference]: With dead ends: 74 [2025-01-09 12:29:32,524 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 12:29:32,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:29:32,529 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:32,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:29:32,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 12:29:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-01-09 12:29:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:29:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-01-09 12:29:32,557 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2025-01-09 12:29:32,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:32,557 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-01-09 12:29:32,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 12:29:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2025-01-09 12:29:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 12:29:32,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:32,559 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:32,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-01-09 12:29:32,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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 [2025-01-09 12:29:32,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:32,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:32,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1340906395, now seen corresponding path program 1 times [2025-01-09 12:29:32,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:29:32,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050818054] [2025-01-09 12:29:32,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:32,762 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 [2025-01-09 12:29:32,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:29:32,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:29:32,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 12:29:32,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 12:29:32,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 12:29:32,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:32,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:32,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:29:32,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:29:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 12:29:33,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:29:33,747 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:29:33,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050818054] [2025-01-09 12:29:33,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050818054] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:29:33,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1778637219] [2025-01-09 12:29:33,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:33,747 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 12:29:33,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 12:29:33,775 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 12:29:33,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 12:29:33,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 12:29:34,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 12:29:34,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:34,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:34,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 12:29:34,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:29:34,295 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 12:29:34,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:29:34,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1778637219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:29:34,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:29:34,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-01-09 12:29:34,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786944271] [2025-01-09 12:29:34,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:29:34,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:29:34,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:29:34,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:29:34,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:29:34,297 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:34,696 INFO L93 Difference]: Finished difference Result 96 states and 133 transitions. [2025-01-09 12:29:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:29:34,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2025-01-09 12:29:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:34,700 INFO L225 Difference]: With dead ends: 96 [2025-01-09 12:29:34,701 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 12:29:34,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:29:34,703 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 64 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:34,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 179 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:29:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 12:29:34,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2025-01-09 12:29:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 12:29:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2025-01-09 12:29:34,718 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 66 [2025-01-09 12:29:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:34,719 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2025-01-09 12:29:34,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 12:29:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2025-01-09 12:29:34,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 12:29:34,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:34,724 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:34,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 12:29:34,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-01-09 12:29:35,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 12:29:35,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:35,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:35,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1400011739, now seen corresponding path program 1 times [2025-01-09 12:29:35,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:29:35,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803366085] [2025-01-09 12:29:35,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:35,126 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 [2025-01-09 12:29:35,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:29:35,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:29:35,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 12:29:35,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 12:29:35,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 12:29:35,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:35,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:35,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:29:35,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:29:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 12:29:35,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:29:35,782 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:29:35,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803366085] [2025-01-09 12:29:35,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803366085] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:29:35,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [258460431] [2025-01-09 12:29:35,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:35,783 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 12:29:35,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 12:29:35,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 12:29:35,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 12:29:35,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 12:29:36,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 12:29:36,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:36,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:36,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 12:29:36,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:29:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 12:29:36,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:29:36,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [258460431] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:29:36,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:29:36,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2025-01-09 12:29:36,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620703818] [2025-01-09 12:29:36,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:29:36,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:29:36,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:29:36,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:29:36,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:29:36,575 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 12:29:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:29:37,358 INFO L93 Difference]: Finished difference Result 112 states and 144 transitions. [2025-01-09 12:29:37,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:29:37,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-01-09 12:29:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:29:37,366 INFO L225 Difference]: With dead ends: 112 [2025-01-09 12:29:37,366 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 12:29:37,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:29:37,367 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:29:37,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 166 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:29:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 12:29:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2025-01-09 12:29:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:29:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2025-01-09 12:29:37,390 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 66 [2025-01-09 12:29:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:29:37,390 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2025-01-09 12:29:37,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 12:29:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2025-01-09 12:29:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 12:29:37,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:29:37,392 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:29:37,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-01-09 12:29:37,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-01-09 12:29:37,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/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 [2025-01-09 12:29:37,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:29:37,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:29:37,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1006984729, now seen corresponding path program 1 times [2025-01-09 12:29:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:29:37,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391363947] [2025-01-09 12:29:37,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:29:37,794 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 [2025-01-09 12:29:37,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:29:37,796 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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) [2025-01-09 12:29:37,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (7)] Waiting until timeout for monitored process [2025-01-09 12:29:37,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 12:29:37,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 12:29:37,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:29:37,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:29:37,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 12:29:37,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:30:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 86 proven. 39 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 12:30:31,561 INFO L312 TraceCheckSpWp]: Computing backward predicates...