./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-85.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_no-floats_file-85.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 d5ed89ea29299420fd60462f8e2db8b26e06e69feba35ce63f47be6d1e493230 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:46:54,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:46:54,550 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:46:54,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:46:54,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:46:54,568 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:46:54,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:46:54,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:46:54,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:46:54,569 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:46:54,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:46:54,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:46:54,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:46:54,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:46:54,569 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:46:54,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:46:54,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:46:54,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:46:54,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:46:54,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:46:54,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:46:54,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:46:54,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:46:54,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:46:54,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:46:54,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:46:54,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:46:54,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:46:54,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:46:54,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:54,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:54,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:54,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:54,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:46:54,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:54,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:54,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:54,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:54,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:46:54,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:46:54,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:46:54,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:46:54,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:46:54,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:46:54,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:46:54,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:46:54,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:46:54,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:46:54,572 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 -> d5ed89ea29299420fd60462f8e2db8b26e06e69feba35ce63f47be6d1e493230 [2025-01-09 12:46:54,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:46:54,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:46:54,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:46:54,764 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:46:54,764 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:46:54,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-85.i [2025-01-09 12:46:55,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/982fbc00c/0f9483c282104819868a10a9a73f92f4/FLAG7c1ad03d9 [2025-01-09 12:46:56,155 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:46:56,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-85.i [2025-01-09 12:46:56,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/982fbc00c/0f9483c282104819868a10a9a73f92f4/FLAG7c1ad03d9 [2025-01-09 12:46:56,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/982fbc00c/0f9483c282104819868a10a9a73f92f4 [2025-01-09 12:46:56,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:46:56,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:46:56,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:56,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:46:56,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:46:56,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75254f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56, skipping insertion in model container [2025-01-09 12:46:56,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:46:56,321 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_no-floats_file-85.i[916,929] [2025-01-09 12:46:56,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:56,369 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:46:56,379 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_no-floats_file-85.i[916,929] [2025-01-09 12:46:56,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:56,418 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:46:56,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56 WrapperNode [2025-01-09 12:46:56,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:56,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:56,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:46:56,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:46:56,426 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:46:56" (1/1) ... [2025-01-09 12:46:56,432 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:46:56" (1/1) ... [2025-01-09 12:46:56,449 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-01-09 12:46:56,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:56,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:46:56,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:46:56,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:46:56,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,464 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:46:56,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:46:56,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:46:56,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:46:56,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:46:56,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56" (1/1) ... [2025-01-09 12:46:56,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:56,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:56,520 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:46:56,523 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:46:56,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:46:56,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:46:56,540 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:46:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:46:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:46:56,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:46:56,591 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:46:56,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:46:56,822 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 12:46:56,823 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:46:56,830 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:46:56,831 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:46:56,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:56 BoogieIcfgContainer [2025-01-09 12:46:56,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:46:56,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:46:56,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:46:56,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:46:56,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:46:56" (1/3) ... [2025-01-09 12:46:56,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29bd3e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:56, skipping insertion in model container [2025-01-09 12:46:56,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:56" (2/3) ... [2025-01-09 12:46:56,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29bd3e37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:56, skipping insertion in model container [2025-01-09 12:46:56,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:56" (3/3) ... [2025-01-09 12:46:56,840 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-85.i [2025-01-09 12:46:56,850 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:46:56,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-85.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:46:56,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:46:56,907 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;@1ece1cd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:46:56,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:46:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 12:46:56,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:46:56,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:56,919 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:56,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:56,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:56,925 INFO L85 PathProgramCache]: Analyzing trace with hash 791117099, now seen corresponding path program 1 times [2025-01-09 12:46:56,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:56,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737843317] [2025-01-09 12:46:56,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:56,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:57,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:46:57,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:46:57,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:57,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 12:46:57,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:57,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737843317] [2025-01-09 12:46:57,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737843317] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:46:57,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486512966] [2025-01-09 12:46:57,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:57,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:57,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:57,160 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:46:57,165 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:46:57,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:46:57,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:46:57,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:57,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:57,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:46:57,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 12:46:57,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:57,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486512966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:57,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:46:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:46:57,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778979191] [2025-01-09 12:46:57,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:57,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:46:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:57,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:46:57,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:46:57,392 INFO L87 Difference]: Start difference. First operand has 58 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 12:46:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:57,416 INFO L93 Difference]: Finished difference Result 110 states and 192 transitions. [2025-01-09 12:46:57,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:46:57,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 139 [2025-01-09 12:46:57,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:57,423 INFO L225 Difference]: With dead ends: 110 [2025-01-09 12:46:57,423 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 12:46:57,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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:46:57,429 INFO L435 NwaCegarLoop]: 82 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, 82 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:46:57,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 12:46:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 12:46:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 12:46:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2025-01-09 12:46:57,457 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 139 [2025-01-09 12:46:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:57,457 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2025-01-09 12:46:57,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 12:46:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2025-01-09 12:46:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:46:57,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:57,460 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:57,466 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:46:57,665 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:46:57,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:57,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash -523542231, now seen corresponding path program 1 times [2025-01-09 12:46:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:57,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472624841] [2025-01-09 12:46:57,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:57,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:46:57,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:46:57,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:57,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:47:02,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:02,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472624841] [2025-01-09 12:47:02,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472624841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:02,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:02,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:47:02,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617206040] [2025-01-09 12:47:02,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:02,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:47:02,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:02,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:47:02,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:47:02,925 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:04,307 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2025-01-09 12:47:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:47:04,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2025-01-09 12:47:04,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:04,309 INFO L225 Difference]: With dead ends: 103 [2025-01-09 12:47:04,309 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 12:47:04,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:47:04,310 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 76 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:04,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 435 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:47:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 12:47:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2025-01-09 12:47:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 12:47:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2025-01-09 12:47:04,322 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 139 [2025-01-09 12:47:04,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:04,323 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2025-01-09 12:47:04,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2025-01-09 12:47:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:47:04,324 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:04,324 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:04,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:47:04,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:04,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1332888857, now seen corresponding path program 1 times [2025-01-09 12:47:04,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:04,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141259283] [2025-01-09 12:47:04,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:04,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:04,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:47:04,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:47:04,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:04,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:47:09,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:09,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141259283] [2025-01-09 12:47:09,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141259283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:09,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:09,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:47:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953981298] [2025-01-09 12:47:09,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:09,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:47:09,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:09,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:47:09,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:47:09,032 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:11,401 INFO L93 Difference]: Finished difference Result 108 states and 144 transitions. [2025-01-09 12:47:11,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:47:11,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2025-01-09 12:47:11,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:11,403 INFO L225 Difference]: With dead ends: 108 [2025-01-09 12:47:11,403 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 12:47:11,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:47:11,405 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 62 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:11,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 464 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:47:11,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 12:47:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 67. [2025-01-09 12:47:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 40 states have internal predecessors, (46), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 12:47:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2025-01-09 12:47:11,420 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 139 [2025-01-09 12:47:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:11,420 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2025-01-09 12:47:11,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2025-01-09 12:47:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:47:11,425 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:11,425 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:11,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:47:11,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:11,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash -2121038621, now seen corresponding path program 1 times [2025-01-09 12:47:11,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:11,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836074274] [2025-01-09 12:47:11,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:11,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:11,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:47:11,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:47:11,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:11,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:18,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:47:18,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:18,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836074274] [2025-01-09 12:47:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836074274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:18,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:18,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:47:18,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440955468] [2025-01-09 12:47:18,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:18,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:47:18,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:18,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:47:18,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:47:18,187 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:20,808 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2025-01-09 12:47:20,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:47:20,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:47:20,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:20,812 INFO L225 Difference]: With dead ends: 135 [2025-01-09 12:47:20,812 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 12:47:20,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:47:20,813 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 158 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:20,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 339 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 12:47:20,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 12:47:20,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2025-01-09 12:47:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.196969696969697) internal successors, (79), 68 states have internal predecessors, (79), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:47:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 145 transitions. [2025-01-09 12:47:20,828 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 145 transitions. Word has length 140 [2025-01-09 12:47:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:20,828 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 145 transitions. [2025-01-09 12:47:20,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 145 transitions. [2025-01-09 12:47:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:47:20,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:20,830 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:20,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:47:20,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:20,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2063780319, now seen corresponding path program 1 times [2025-01-09 12:47:20,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:20,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518950813] [2025-01-09 12:47:20,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:20,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:47:20,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:47:20,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:20,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:47:26,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:26,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518950813] [2025-01-09 12:47:26,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518950813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:26,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:26,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:47:26,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891193085] [2025-01-09 12:47:26,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:26,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:47:26,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:26,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:47:26,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:47:26,094 INFO L87 Difference]: Start difference. First operand 105 states and 145 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:27,140 INFO L93 Difference]: Finished difference Result 254 states and 337 transitions. [2025-01-09 12:47:27,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:47:27,140 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:47:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:27,142 INFO L225 Difference]: With dead ends: 254 [2025-01-09 12:47:27,142 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 12:47:27,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:47:27,143 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 77 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:27,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 363 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:47:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 12:47:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 103. [2025-01-09 12:47:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 69 states have internal predecessors, (79), 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:47:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2025-01-09 12:47:27,158 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 140 [2025-01-09 12:47:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:27,158 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2025-01-09 12:47:27,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:27,158 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2025-01-09 12:47:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:47:27,159 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:27,159 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:27,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:47:27,159 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:27,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1003561797, now seen corresponding path program 1 times [2025-01-09 12:47:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:27,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093817920] [2025-01-09 12:47:27,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:27,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:27,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:47:27,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:47:27,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:27,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:47:32,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:32,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093817920] [2025-01-09 12:47:32,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093817920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:32,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:32,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:47:32,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542640335] [2025-01-09 12:47:32,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:32,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:47:32,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:32,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:47:32,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:47:32,345 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:34,409 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2025-01-09 12:47:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:47:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:47:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:34,412 INFO L225 Difference]: With dead ends: 135 [2025-01-09 12:47:34,412 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 12:47:34,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:47:34,414 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 83 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:34,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 377 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:47:34,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 12:47:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2025-01-09 12:47:34,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 71 states have internal predecessors, (83), 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:47:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2025-01-09 12:47:34,434 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 140 [2025-01-09 12:47:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:34,435 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2025-01-09 12:47:34,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2025-01-09 12:47:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:47:34,436 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:34,437 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:34,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:47:34,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:34,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:34,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1005408839, now seen corresponding path program 1 times [2025-01-09 12:47:34,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:34,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816677842] [2025-01-09 12:47:34,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:34,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:34,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:47:34,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:47:34,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:34,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:47:37,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:37,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816677842] [2025-01-09 12:47:37,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816677842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:37,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:37,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:47:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387905974] [2025-01-09 12:47:37,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:37,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:47:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:37,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:47:37,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:47:37,513 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:39,265 INFO L93 Difference]: Finished difference Result 137 states and 174 transitions. [2025-01-09 12:47:39,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:47:39,267 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:47:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:39,269 INFO L225 Difference]: With dead ends: 137 [2025-01-09 12:47:39,269 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 12:47:39,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:47:39,271 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 98 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:39,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 496 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:47:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 12:47:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 105. [2025-01-09 12:47:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 71 states have internal predecessors, (83), 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:47:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2025-01-09 12:47:39,296 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 140 [2025-01-09 12:47:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:39,297 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2025-01-09 12:47:39,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2025-01-09 12:47:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:47:39,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:39,298 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:39,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:47:39,298 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:39,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1440980251, now seen corresponding path program 1 times [2025-01-09 12:47:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:39,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709292254] [2025-01-09 12:47:39,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:39,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:47:39,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:47:39,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:39,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:47:44,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:44,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709292254] [2025-01-09 12:47:44,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709292254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:44,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:44,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:47:44,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946852966] [2025-01-09 12:47:44,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:44,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:47:44,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:44,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:47:44,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:47:44,381 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:46,325 INFO L93 Difference]: Finished difference Result 135 states and 173 transitions. [2025-01-09 12:47:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:47:46,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:47:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:46,331 INFO L225 Difference]: With dead ends: 135 [2025-01-09 12:47:46,331 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 12:47:46,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:47:46,331 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 83 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:46,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 483 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:47:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 12:47:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2025-01-09 12:47:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 71 states have internal predecessors, (83), 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:47:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2025-01-09 12:47:46,352 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 140 [2025-01-09 12:47:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:46,353 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2025-01-09 12:47:46,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2025-01-09 12:47:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:47:46,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:46,357 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:46,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:47:46,357 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:46,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:46,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1383721949, now seen corresponding path program 1 times [2025-01-09 12:47:46,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:46,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994318282] [2025-01-09 12:47:46,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:46,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:46,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:47:46,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:47:46,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:46,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:47:49,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:49,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994318282] [2025-01-09 12:47:49,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994318282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:49,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:49,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:47:49,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043331612] [2025-01-09 12:47:49,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:49,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:47:49,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:49,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:47:49,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:47:49,889 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:51,911 INFO L93 Difference]: Finished difference Result 233 states and 306 transitions. [2025-01-09 12:47:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:47:51,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:47:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:51,913 INFO L225 Difference]: With dead ends: 233 [2025-01-09 12:47:51,913 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 12:47:51,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:47:51,914 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:51,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 443 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:47:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 12:47:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 89. [2025-01-09 12:47:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 57 states have internal predecessors, (68), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:47:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions. [2025-01-09 12:47:51,929 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 140 [2025-01-09 12:47:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:51,929 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 122 transitions. [2025-01-09 12:47:51,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:47:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions. [2025-01-09 12:47:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:47:51,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:51,930 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:51,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:47:51,931 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:51,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:51,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1683620167, now seen corresponding path program 1 times [2025-01-09 12:47:51,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:47:51,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842073770] [2025-01-09 12:47:51,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:51,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:47:51,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:47:51,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:47:51,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:51,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:47:57,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:47:57,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842073770] [2025-01-09 12:47:57,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842073770] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:47:57,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:47:57,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:47:57,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402575854] [2025-01-09 12:47:57,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:57,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:47:57,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:47:57,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:47:57,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:47:57,614 INFO L87 Difference]: Start difference. First operand 89 states and 122 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:48:00,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:48:00,087 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2025-01-09 12:48:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:48:00,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:48:00,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:48:00,088 INFO L225 Difference]: With dead ends: 137 [2025-01-09 12:48:00,088 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 12:48:00,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:48:00,089 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 73 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:48:00,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 393 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:48:00,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 12:48:00,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 91. [2025-01-09 12:48:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:48:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2025-01-09 12:48:00,100 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 140 [2025-01-09 12:48:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:48:00,100 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2025-01-09 12:48:00,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:48:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2025-01-09 12:48:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:48:00,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:48:00,101 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:00,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:48:00,101 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:48:00,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:48:00,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1685467209, now seen corresponding path program 1 times [2025-01-09 12:48:00,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:48:00,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192384782] [2025-01-09 12:48:00,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:48:00,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:48:00,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:48:00,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:48:00,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:48:00,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:48:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:48:03,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:48:03,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192384782] [2025-01-09 12:48:03,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192384782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:48:03,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:48:03,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:48:03,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535556132] [2025-01-09 12:48:03,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:48:03,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:48:03,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:48:03,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:48:03,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:48:03,352 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:48:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:48:05,048 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2025-01-09 12:48:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:48:05,049 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:48:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:48:05,050 INFO L225 Difference]: With dead ends: 139 [2025-01-09 12:48:05,051 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 12:48:05,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:48:05,051 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 77 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:48:05,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 589 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:48:05,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 12:48:05,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 84. [2025-01-09 12:48:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 52 states have internal predecessors, (59), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:48:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2025-01-09 12:48:05,065 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 140 [2025-01-09 12:48:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:48:05,066 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2025-01-09 12:48:05,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:48:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2025-01-09 12:48:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 12:48:05,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:48:05,068 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:05,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:48:05,069 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:48:05,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:48:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1274186037, now seen corresponding path program 1 times [2025-01-09 12:48:05,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:48:05,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857485667] [2025-01-09 12:48:05,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:48:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:48:05,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 12:48:05,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 12:48:05,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:48:05,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:48:11,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:48:11,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:48:11,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857485667] [2025-01-09 12:48:11,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857485667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:48:11,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:48:11,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:48:11,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379619007] [2025-01-09 12:48:11,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:48:11,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:48:11,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:48:11,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:48:11,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:48:11,168 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:48:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:48:15,151 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2025-01-09 12:48:15,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:48:15,151 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2025-01-09 12:48:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:48:15,153 INFO L225 Difference]: With dead ends: 135 [2025-01-09 12:48:15,155 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 12:48:15,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:48:15,156 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 115 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:48:15,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 371 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:48:15,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 12:48:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 76. [2025-01-09 12:48:15,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 12:48:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2025-01-09 12:48:15,169 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 141 [2025-01-09 12:48:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:48:15,169 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2025-01-09 12:48:15,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:48:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2025-01-09 12:48:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 12:48:15,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:48:15,170 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:15,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:48:15,171 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:48:15,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:48:15,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1667213047, now seen corresponding path program 1 times [2025-01-09 12:48:15,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:48:15,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198399337] [2025-01-09 12:48:15,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:48:15,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:48:15,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 12:48:15,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 12:48:15,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:48:15,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:48:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:48:20,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:48:20,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198399337] [2025-01-09 12:48:20,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198399337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:48:20,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:48:20,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:48:20,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392918305] [2025-01-09 12:48:20,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:48:20,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:48:20,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:48:20,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:48:20,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:48:20,762 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:48:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:48:23,384 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2025-01-09 12:48:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:48:23,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2025-01-09 12:48:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:48:23,385 INFO L225 Difference]: With dead ends: 122 [2025-01-09 12:48:23,385 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 12:48:23,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:48:23,386 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 98 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:48:23,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 499 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 12:48:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 12:48:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 12:48:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 12:48:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 12:48:23,387 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2025-01-09 12:48:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:48:23,387 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 12:48:23,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:48:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 12:48:23,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 12:48:23,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:48:23,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:48:23,392 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:48:23,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.