./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.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_fillercode_fillercodestructure_filler-pr-cn_file-81.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 c37c06019a2f7252c23194b0baf4adc5534d367e32a3abf21b53b0028081fdaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:21:40,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:21:40,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:21:40,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:21:40,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:21:40,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:21:40,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:21:40,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:21:40,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:21:40,476 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:21:40,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:21:40,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:21:40,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:21:40,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:21:40,477 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:21:40,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:21:40,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:21:40,477 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:21:40,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:21:40,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:21:40,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:21:40,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:21:40,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:21:40,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:21:40,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:21:40,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:21:40,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:21:40,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:21:40,478 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:21:40,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:21:40,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:21:40,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:21:40,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:21:40,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:21:40,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:21:40,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:21:40,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:21:40,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:21:40,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:21:40,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:21:40,480 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:21:40,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:21:40,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:21:40,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:21:40,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:21:40,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:21:40,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:21:40,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:21:40,481 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 -> c37c06019a2f7252c23194b0baf4adc5534d367e32a3abf21b53b0028081fdaa [2025-01-09 11:21:40,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:21:40,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:21:40,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:21:40,770 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:21:40,770 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:21:40,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i [2025-01-09 11:21:42,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84ae8789a/de4091320abf4f418bca7f6b8dece74c/FLAG2a2cb49b9 [2025-01-09 11:21:42,437 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:21:42,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i [2025-01-09 11:21:42,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84ae8789a/de4091320abf4f418bca7f6b8dece74c/FLAG2a2cb49b9 [2025-01-09 11:21:42,717 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84ae8789a/de4091320abf4f418bca7f6b8dece74c [2025-01-09 11:21:42,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:21:42,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:21:42,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:21:42,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:21:42,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:21:42,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:21:42" (1/1) ... [2025-01-09 11:21:42,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2a9750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:42, skipping insertion in model container [2025-01-09 11:21:42,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:21:42" (1/1) ... [2025-01-09 11:21:42,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:21:42,889 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_fillercode_fillercodestructure_filler-pr-cn_file-81.i[919,932] [2025-01-09 11:21:42,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:21:42,988 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:21:42,999 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_fillercode_fillercodestructure_filler-pr-cn_file-81.i[919,932] [2025-01-09 11:21:43,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:21:43,075 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:21:43,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43 WrapperNode [2025-01-09 11:21:43,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:21:43,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:21:43,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:21:43,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:21:43,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,154 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 305 [2025-01-09 11:21:43,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:21:43,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:21:43,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:21:43,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:21:43,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,212 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 11:21:43,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,231 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,236 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:21:43,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:21:43,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:21:43,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:21:43,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (1/1) ... [2025-01-09 11:21:43,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:21:43,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:21:43,297 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 11:21:43,300 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 11:21:43,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:21:43,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:21:43,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:21:43,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:21:43,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:21:43,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:21:43,399 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:21:43,401 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:21:43,980 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 11:21:43,980 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:21:43,993 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:21:43,995 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:21:43,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:21:43 BoogieIcfgContainer [2025-01-09 11:21:43,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:21:43,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:21:43,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:21:44,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:21:44,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:21:42" (1/3) ... [2025-01-09 11:21:44,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c58311d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:21:44, skipping insertion in model container [2025-01-09 11:21:44,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:43" (2/3) ... [2025-01-09 11:21:44,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c58311d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:21:44, skipping insertion in model container [2025-01-09 11:21:44,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:21:43" (3/3) ... [2025-01-09 11:21:44,007 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i [2025-01-09 11:21:44,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:21:44,025 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-81.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:21:44,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:21:44,087 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;@32228a8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:21:44,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:21:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 11:21:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-01-09 11:21:44,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:21:44,113 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:44,114 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:21:44,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:21:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2047256824, now seen corresponding path program 1 times [2025-01-09 11:21:44,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:21:44,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33210187] [2025-01-09 11:21:44,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:21:44,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:21:44,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 11:21:44,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 11:21:44,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:21:44,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:21:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 11:21:45,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:21:45,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33210187] [2025-01-09 11:21:45,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33210187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:21:45,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:21:45,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:21:45,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339989473] [2025-01-09 11:21:45,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:21:45,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:21:45,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:21:45,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:21:45,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:21:45,633 INFO L87 Difference]: Start difference. First operand has 133 states, 80 states have (on average 1.4125) internal successors, (113), 81 states have internal predecessors, (113), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:21:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:21:46,032 INFO L93 Difference]: Finished difference Result 388 states and 731 transitions. [2025-01-09 11:21:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:21:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 306 [2025-01-09 11:21:46,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:21:46,050 INFO L225 Difference]: With dead ends: 388 [2025-01-09 11:21:46,050 INFO L226 Difference]: Without dead ends: 258 [2025-01-09 11:21:46,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:21:46,061 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 114 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:21:46,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 501 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:21:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-01-09 11:21:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2025-01-09 11:21:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 153 states have (on average 1.392156862745098) internal successors, (213), 153 states have internal predecessors, (213), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 11:21:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 413 transitions. [2025-01-09 11:21:46,184 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 413 transitions. Word has length 306 [2025-01-09 11:21:46,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:21:46,187 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 413 transitions. [2025-01-09 11:21:46,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:21:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 413 transitions. [2025-01-09 11:21:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 11:21:46,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:21:46,198 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:21:46,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 11:21:46,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:21:46,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:21:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash -509983567, now seen corresponding path program 1 times [2025-01-09 11:21:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:21:46,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131644187] [2025-01-09 11:21:46,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:21:46,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:21:46,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 11:21:46,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 11:21:46,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:21:46,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:22:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 11:22:00,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:22:00,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131644187] [2025-01-09 11:22:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131644187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:22:00,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:22:00,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:22:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350914528] [2025-01-09 11:22:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:22:00,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:22:00,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:22:00,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:22:00,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:22:00,606 INFO L87 Difference]: Start difference. First operand 256 states and 413 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:22:04,534 INFO L93 Difference]: Finished difference Result 924 states and 1485 transitions. [2025-01-09 11:22:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:22:04,535 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 11:22:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:22:04,543 INFO L225 Difference]: With dead ends: 924 [2025-01-09 11:22:04,545 INFO L226 Difference]: Without dead ends: 671 [2025-01-09 11:22:04,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:22:04,548 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 562 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:22:04,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1227 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 11:22:04,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-01-09 11:22:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 393. [2025-01-09 11:22:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 239 states have (on average 1.405857740585774) internal successors, (336), 239 states have internal predecessors, (336), 150 states have call successors, (150), 3 states have call predecessors, (150), 3 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-01-09 11:22:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 636 transitions. [2025-01-09 11:22:04,649 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 636 transitions. Word has length 307 [2025-01-09 11:22:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:22:04,651 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 636 transitions. [2025-01-09 11:22:04,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 636 transitions. [2025-01-09 11:22:04,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 11:22:04,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:22:04,657 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:04,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:22:04,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:22:04,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:22:04,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1789847245, now seen corresponding path program 1 times [2025-01-09 11:22:04,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:22:04,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608801603] [2025-01-09 11:22:04,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:22:04,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:22:04,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 11:22:04,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 11:22:04,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:22:04,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:22:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 11:22:04,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:22:04,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608801603] [2025-01-09 11:22:04,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608801603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:22:04,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:22:04,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:22:04,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665502168] [2025-01-09 11:22:04,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:22:04,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:22:04,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:22:04,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:22:04,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:22:04,973 INFO L87 Difference]: Start difference. First operand 393 states and 636 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:22:05,152 INFO L93 Difference]: Finished difference Result 753 states and 1214 transitions. [2025-01-09 11:22:05,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:22:05,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 11:22:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:22:05,160 INFO L225 Difference]: With dead ends: 753 [2025-01-09 11:22:05,162 INFO L226 Difference]: Without dead ends: 500 [2025-01-09 11:22:05,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:22:05,165 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 72 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:22:05,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 615 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:22:05,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-01-09 11:22:05,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 496. [2025-01-09 11:22:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 332 states have (on average 1.4427710843373494) internal successors, (479), 334 states have internal predecessors, (479), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 11:22:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 795 transitions. [2025-01-09 11:22:05,244 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 795 transitions. Word has length 307 [2025-01-09 11:22:05,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:22:05,245 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 795 transitions. [2025-01-09 11:22:05,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:05,246 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 795 transitions. [2025-01-09 11:22:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 11:22:05,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:22:05,250 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:05,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:22:05,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:22:05,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:22:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1790839023, now seen corresponding path program 1 times [2025-01-09 11:22:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:22:05,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842674601] [2025-01-09 11:22:05,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:22:05,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:22:05,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 11:22:05,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 11:22:05,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:22:05,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:22:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 11:22:15,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:22:15,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842674601] [2025-01-09 11:22:15,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842674601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:22:15,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:22:15,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:22:15,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958396359] [2025-01-09 11:22:15,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:22:15,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:22:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:22:15,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:22:15,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:22:15,440 INFO L87 Difference]: Start difference. First operand 496 states and 795 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:22:18,163 INFO L93 Difference]: Finished difference Result 1454 states and 2320 transitions. [2025-01-09 11:22:18,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:22:18,165 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 11:22:18,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:22:18,177 INFO L225 Difference]: With dead ends: 1454 [2025-01-09 11:22:18,178 INFO L226 Difference]: Without dead ends: 1098 [2025-01-09 11:22:18,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-01-09 11:22:18,182 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 683 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:22:18,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1216 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 11:22:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-01-09 11:22:18,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 760. [2025-01-09 11:22:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 535 states have (on average 1.4747663551401868) internal successors, (789), 539 states have internal predecessors, (789), 216 states have call successors, (216), 8 states have call predecessors, (216), 8 states have return successors, (216), 212 states have call predecessors, (216), 216 states have call successors, (216) [2025-01-09 11:22:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1221 transitions. [2025-01-09 11:22:18,323 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1221 transitions. Word has length 307 [2025-01-09 11:22:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:22:18,324 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1221 transitions. [2025-01-09 11:22:18,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1221 transitions. [2025-01-09 11:22:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-01-09 11:22:18,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:22:18,329 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:18,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:22:18,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:22:18,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:22:18,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2096039987, now seen corresponding path program 1 times [2025-01-09 11:22:18,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:22:18,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516472645] [2025-01-09 11:22:18,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:22:18,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:22:18,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-01-09 11:22:18,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-01-09 11:22:18,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:22:18,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:22:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 11:22:19,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:22:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516472645] [2025-01-09 11:22:19,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516472645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:22:19,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:22:19,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 11:22:19,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854685024] [2025-01-09 11:22:19,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:22:19,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:22:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:22:19,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:22:19,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:22:19,153 INFO L87 Difference]: Start difference. First operand 760 states and 1221 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:22:19,811 INFO L93 Difference]: Finished difference Result 1382 states and 2218 transitions. [2025-01-09 11:22:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:22:19,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 307 [2025-01-09 11:22:19,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:22:19,818 INFO L225 Difference]: With dead ends: 1382 [2025-01-09 11:22:19,818 INFO L226 Difference]: Without dead ends: 625 [2025-01-09 11:22:19,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:22:19,823 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 192 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:22:19,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 877 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:22:19,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-01-09 11:22:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 506. [2025-01-09 11:22:19,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 342 states have (on average 1.4473684210526316) internal successors, (495), 344 states have internal predecessors, (495), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 11:22:19,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 811 transitions. [2025-01-09 11:22:19,896 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 811 transitions. Word has length 307 [2025-01-09 11:22:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:22:19,897 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 811 transitions. [2025-01-09 11:22:19,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 811 transitions. [2025-01-09 11:22:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 11:22:19,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:22:19,904 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:19,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:22:19,906 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:22:19,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:22:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash -156127175, now seen corresponding path program 1 times [2025-01-09 11:22:19,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:22:19,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703760638] [2025-01-09 11:22:19,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:22:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:22:19,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 11:22:20,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 11:22:20,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:22:20,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:22:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 11:22:26,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:22:26,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703760638] [2025-01-09 11:22:26,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703760638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:22:26,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:22:26,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:22:26,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641698158] [2025-01-09 11:22:26,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:22:26,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:22:26,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:22:26,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:22:26,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:22:26,414 INFO L87 Difference]: Start difference. First operand 506 states and 811 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:22:27,299 INFO L93 Difference]: Finished difference Result 1338 states and 2136 transitions. [2025-01-09 11:22:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:22:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-01-09 11:22:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:22:27,306 INFO L225 Difference]: With dead ends: 1338 [2025-01-09 11:22:27,307 INFO L226 Difference]: Without dead ends: 982 [2025-01-09 11:22:27,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:22:27,309 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 451 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:22:27,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 925 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:22:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2025-01-09 11:22:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 547. [2025-01-09 11:22:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 383 states have (on average 1.4882506527415145) internal successors, (570), 385 states have internal predecessors, (570), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 11:22:27,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 886 transitions. [2025-01-09 11:22:27,373 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 886 transitions. Word has length 308 [2025-01-09 11:22:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:22:27,375 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 886 transitions. [2025-01-09 11:22:27,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 886 transitions. [2025-01-09 11:22:27,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 11:22:27,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:22:27,379 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:27,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:22:27,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:22:27,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:22:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1435990853, now seen corresponding path program 1 times [2025-01-09 11:22:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:22:27,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505324360] [2025-01-09 11:22:27,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:22:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:22:27,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 11:22:27,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 11:22:27,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:22:27,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:22:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 11:22:28,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:22:28,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505324360] [2025-01-09 11:22:28,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505324360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:22:28,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:22:28,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 11:22:28,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896751922] [2025-01-09 11:22:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:22:28,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:22:28,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:22:28,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:22:28,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:22:28,355 INFO L87 Difference]: Start difference. First operand 547 states and 886 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:22:29,103 INFO L93 Difference]: Finished difference Result 1263 states and 2044 transitions. [2025-01-09 11:22:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:22:29,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-01-09 11:22:29,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:22:29,111 INFO L225 Difference]: With dead ends: 1263 [2025-01-09 11:22:29,111 INFO L226 Difference]: Without dead ends: 832 [2025-01-09 11:22:29,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:22:29,114 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 557 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:22:29,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 831 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:22:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-01-09 11:22:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 550. [2025-01-09 11:22:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 386 states have (on average 1.4870466321243523) internal successors, (574), 388 states have internal predecessors, (574), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 11:22:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 890 transitions. [2025-01-09 11:22:29,177 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 890 transitions. Word has length 308 [2025-01-09 11:22:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:22:29,177 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 890 transitions. [2025-01-09 11:22:29,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 890 transitions. [2025-01-09 11:22:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 11:22:29,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:22:29,181 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:29,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:22:29,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:22:29,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:22:29,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2144695415, now seen corresponding path program 1 times [2025-01-09 11:22:29,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:22:29,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808404281] [2025-01-09 11:22:29,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:22:29,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:22:29,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 11:22:29,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 11:22:29,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:22:29,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:22:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 11:22:36,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:22:36,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808404281] [2025-01-09 11:22:36,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808404281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:22:36,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:22:36,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 11:22:36,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681674869] [2025-01-09 11:22:36,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:22:36,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 11:22:36,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:22:36,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 11:22:36,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:22:36,078 INFO L87 Difference]: Start difference. First operand 550 states and 890 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:22:36,860 INFO L93 Difference]: Finished difference Result 1299 states and 2088 transitions. [2025-01-09 11:22:36,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 11:22:36,861 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-01-09 11:22:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:22:36,868 INFO L225 Difference]: With dead ends: 1299 [2025-01-09 11:22:36,869 INFO L226 Difference]: Without dead ends: 868 [2025-01-09 11:22:36,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:22:36,872 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 406 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:22:36,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 981 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:22:36,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-01-09 11:22:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 548. [2025-01-09 11:22:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 384 states have (on average 1.4895833333333333) internal successors, (572), 386 states have internal predecessors, (572), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 11:22:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 888 transitions. [2025-01-09 11:22:36,948 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 888 transitions. Word has length 308 [2025-01-09 11:22:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:22:36,949 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 888 transitions. [2025-01-09 11:22:36,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 888 transitions. [2025-01-09 11:22:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 11:22:36,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:22:36,953 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:36,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:22:36,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:22:36,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:22:36,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1654845571, now seen corresponding path program 1 times [2025-01-09 11:22:36,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:22:36,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183020456] [2025-01-09 11:22:36,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:22:36,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:22:36,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 11:22:37,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 11:22:37,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:22:37,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:22:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 11:22:41,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:22:41,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183020456] [2025-01-09 11:22:41,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183020456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:22:41,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:22:41,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:22:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183659430] [2025-01-09 11:22:41,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:22:41,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:22:41,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:22:41,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:22:41,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:22:41,993 INFO L87 Difference]: Start difference. First operand 548 states and 888 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 11:22:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:22:43,954 INFO L93 Difference]: Finished difference Result 1450 states and 2317 transitions. [2025-01-09 11:22:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:22:43,956 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 308 [2025-01-09 11:22:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:22:43,961 INFO L225 Difference]: With dead ends: 1450 [2025-01-09 11:22:43,962 INFO L226 Difference]: Without dead ends: 1019 [2025-01-09 11:22:43,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-01-09 11:22:43,968 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 837 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:22:43,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1491 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 11:22:43,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-01-09 11:22:44,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 591. [2025-01-09 11:22:44,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 427 states have (on average 1.505854800936768) internal successors, (643), 429 states have internal predecessors, (643), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 11:22:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 959 transitions. [2025-01-09 11:22:44,038 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 959 transitions. Word has length 308 [2025-01-09 11:22:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:22:44,039 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 959 transitions. [2025-01-09 11:22:44,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 11:22:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 959 transitions. [2025-01-09 11:22:44,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 11:22:44,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:22:44,042 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:44,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:22:44,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:22:44,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:22:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash 645977019, now seen corresponding path program 1 times [2025-01-09 11:22:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:22:44,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161403662] [2025-01-09 11:22:44,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:22:44,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:22:44,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 11:22:44,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 11:22:44,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:22:44,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:22:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 11:22:48,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:22:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161403662] [2025-01-09 11:22:48,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161403662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:22:48,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:22:48,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:22:48,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615588648] [2025-01-09 11:22:48,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:22:48,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:22:48,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:22:48,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:22:48,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:22:48,779 INFO L87 Difference]: Start difference. First operand 591 states and 959 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 11:22:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:22:50,295 INFO L93 Difference]: Finished difference Result 1375 states and 2203 transitions. [2025-01-09 11:22:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 11:22:50,297 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 308 [2025-01-09 11:22:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:22:50,303 INFO L225 Difference]: With dead ends: 1375 [2025-01-09 11:22:50,303 INFO L226 Difference]: Without dead ends: 944 [2025-01-09 11:22:50,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-01-09 11:22:50,306 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 516 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:22:50,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1790 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 11:22:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-01-09 11:22:50,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 591. [2025-01-09 11:22:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 427 states have (on average 1.505854800936768) internal successors, (643), 429 states have internal predecessors, (643), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 11:22:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 959 transitions. [2025-01-09 11:22:50,378 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 959 transitions. Word has length 308 [2025-01-09 11:22:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:22:50,379 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 959 transitions. [2025-01-09 11:22:50,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 11:22:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 959 transitions. [2025-01-09 11:22:50,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 11:22:50,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:22:50,383 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:50,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:22:50,383 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:22:50,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:22:50,383 INFO L85 PathProgramCache]: Analyzing trace with hash -15578565, now seen corresponding path program 1 times [2025-01-09 11:22:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:22:50,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553562648] [2025-01-09 11:22:50,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:22:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:22:50,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 11:22:50,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 11:22:50,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:22:50,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:22:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 11:22:50,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:22:50,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553562648] [2025-01-09 11:22:50,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553562648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:22:50,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:22:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:22:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85705459] [2025-01-09 11:22:50,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:22:50,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:22:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:22:50,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:22:50,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:22:50,637 INFO L87 Difference]: Start difference. First operand 591 states and 959 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:22:50,738 INFO L93 Difference]: Finished difference Result 1128 states and 1821 transitions. [2025-01-09 11:22:50,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:22:50,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 308 [2025-01-09 11:22:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:22:50,744 INFO L225 Difference]: With dead ends: 1128 [2025-01-09 11:22:50,745 INFO L226 Difference]: Without dead ends: 697 [2025-01-09 11:22:50,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:22:50,747 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 126 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:22:50,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 694 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:22:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-01-09 11:22:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 567. [2025-01-09 11:22:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 410 states have (on average 1.5219512195121951) internal successors, (624), 410 states have internal predecessors, (624), 150 states have call successors, (150), 6 states have call predecessors, (150), 6 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-01-09 11:22:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 924 transitions. [2025-01-09 11:22:50,804 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 924 transitions. Word has length 308 [2025-01-09 11:22:50,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:22:50,805 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 924 transitions. [2025-01-09 11:22:50,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 11:22:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 924 transitions. [2025-01-09 11:22:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 11:22:50,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:22:50,809 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:22:50,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:22:50,809 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:22:50,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:22:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1295442243, now seen corresponding path program 1 times [2025-01-09 11:22:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:22:50,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509610892] [2025-01-09 11:22:50,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:22:50,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:22:50,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 11:22:50,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 11:22:50,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:22:50,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat