./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c --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/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -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 0b2744f3415dbb18037af957678e462154c9b5d1903565ea0dc58b30d01826b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:58:35,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:58:35,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:58:35,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:58:35,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:58:35,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:58:35,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:58:35,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:58:35,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:58:35,898 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:58:35,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:58:35,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:58:35,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:58:35,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:58:35,898 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:58:35,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:58:35,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:58:35,898 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:58:35,899 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:58:35,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:58:35,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:58:35,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:58:35,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:58:35,900 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 -> 0b2744f3415dbb18037af957678e462154c9b5d1903565ea0dc58b30d01826b2 [2025-01-09 04:58:36,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:58:36,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:58:36,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:58:36,165 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:58:36,165 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:58:36,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-01-09 04:58:37,457 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ead062a75/a7df0dda71e34b15901c6eac93c1bdb8/FLAGc46749144 [2025-01-09 04:58:37,828 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:58:37,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-01-09 04:58:37,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ead062a75/a7df0dda71e34b15901c6eac93c1bdb8/FLAGc46749144 [2025-01-09 04:58:37,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ead062a75/a7df0dda71e34b15901c6eac93c1bdb8 [2025-01-09 04:58:37,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:58:37,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:58:37,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:58:37,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:58:37,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:58:37,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:58:37" (1/1) ... [2025-01-09 04:58:37,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:37, skipping insertion in model container [2025-01-09 04:58:37,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:58:37" (1/1) ... [2025-01-09 04:58:37,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:58:38,213 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/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[34568,34581] [2025-01-09 04:58:38,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:58:38,314 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:58:38,462 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/seq-mthreaded-reduced/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[34568,34581] [2025-01-09 04:58:38,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:58:38,555 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:58:38,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38 WrapperNode [2025-01-09 04:58:38,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:58:38,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:58:38,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:58:38,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:58:38,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,691 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3045 [2025-01-09 04:58:38,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:58:38,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:58:38,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:58:38,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:58:38,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,752 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 04:58:38,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,753 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,818 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:58:38,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:58:38,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:58:38,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:58:38,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (1/1) ... [2025-01-09 04:58:38,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:58:38,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:58:38,901 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 04:58:38,903 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 04:58:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:58:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:58:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:58:38,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:58:39,078 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:58:39,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:58:40,726 INFO L? ?]: Removed 219 outVars from TransFormulas that were not future-live. [2025-01-09 04:58:40,726 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:58:40,748 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:58:40,748 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:58:40,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:58:40 BoogieIcfgContainer [2025-01-09 04:58:40,748 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:58:40,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:58:40,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:58:40,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:58:40,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:58:37" (1/3) ... [2025-01-09 04:58:40,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66090321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:58:40, skipping insertion in model container [2025-01-09 04:58:40,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:58:38" (2/3) ... [2025-01-09 04:58:40,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66090321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:58:40, skipping insertion in model container [2025-01-09 04:58:40,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:58:40" (3/3) ... [2025-01-09 04:58:40,755 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2025-01-09 04:58:40,765 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:58:40,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c that has 1 procedures, 771 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:58:40,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:58:40,828 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;@3fe89ae6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:58:40,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:58:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 771 states, 769 states have (on average 1.786736020806242) internal successors, (1374), 770 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-01-09 04:58:40,847 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:40,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:40,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:40,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:40,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1478878914, now seen corresponding path program 1 times [2025-01-09 04:58:40,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:40,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238884078] [2025-01-09 04:58:40,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:40,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-01-09 04:58:41,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-01-09 04:58:41,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:41,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:41,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:41,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238884078] [2025-01-09 04:58:41,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238884078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:41,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:41,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:41,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198883719] [2025-01-09 04:58:41,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:41,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:41,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:41,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:41,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:41,674 INFO L87 Difference]: Start difference. First operand has 771 states, 769 states have (on average 1.786736020806242) internal successors, (1374), 770 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:41,881 INFO L93 Difference]: Finished difference Result 1385 states and 2441 transitions. [2025-01-09 04:58:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:41,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2025-01-09 04:58:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:41,899 INFO L225 Difference]: With dead ends: 1385 [2025-01-09 04:58:41,899 INFO L226 Difference]: Without dead ends: 1215 [2025-01-09 04:58:41,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:41,907 INFO L435 NwaCegarLoop]: 1313 mSDtfsCounter, 804 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:41,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 2362 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-01-09 04:58:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1213. [2025-01-09 04:58:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1212 states have (on average 1.5627062706270627) internal successors, (1894), 1212 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1894 transitions. [2025-01-09 04:58:41,986 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1894 transitions. Word has length 316 [2025-01-09 04:58:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:41,987 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1894 transitions. [2025-01-09 04:58:41,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1894 transitions. [2025-01-09 04:58:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-01-09 04:58:41,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:41,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:41,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:58:41,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:41,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:42,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1649206099, now seen corresponding path program 1 times [2025-01-09 04:58:42,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:42,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59770192] [2025-01-09 04:58:42,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:42,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:42,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-01-09 04:58:42,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-01-09 04:58:42,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:42,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:43,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:43,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59770192] [2025-01-09 04:58:43,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59770192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:43,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:43,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:58:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713363237] [2025-01-09 04:58:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:43,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:58:43,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:43,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:58:43,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:43,245 INFO L87 Difference]: Start difference. First operand 1213 states and 1894 transitions. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:43,432 INFO L93 Difference]: Finished difference Result 5943 states and 9259 transitions. [2025-01-09 04:58:43,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:58:43,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2025-01-09 04:58:43,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:43,450 INFO L225 Difference]: With dead ends: 5943 [2025-01-09 04:58:43,450 INFO L226 Difference]: Without dead ends: 4741 [2025-01-09 04:58:43,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:58:43,455 INFO L435 NwaCegarLoop]: 1812 mSDtfsCounter, 3827 mSDsluCounter, 2927 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3827 SdHoareTripleChecker+Valid, 4739 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:43,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3827 Valid, 4739 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4741 states. [2025-01-09 04:58:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4741 to 2383. [2025-01-09 04:58:43,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2382 states have (on average 1.5528967254408061) internal successors, (3699), 2382 states have internal predecessors, (3699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3699 transitions. [2025-01-09 04:58:43,543 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3699 transitions. Word has length 316 [2025-01-09 04:58:43,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:43,543 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 3699 transitions. [2025-01-09 04:58:43,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3699 transitions. [2025-01-09 04:58:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-01-09 04:58:43,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:43,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:43,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:58:43,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:43,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1029364850, now seen corresponding path program 1 times [2025-01-09 04:58:43,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:43,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692372258] [2025-01-09 04:58:43,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:43,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-09 04:58:43,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-09 04:58:43,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:43,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:43,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692372258] [2025-01-09 04:58:43,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692372258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:43,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:43,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352898287] [2025-01-09 04:58:43,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:43,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:43,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:43,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:43,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:43,749 INFO L87 Difference]: Start difference. First operand 2383 states and 3699 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:43,849 INFO L93 Difference]: Finished difference Result 7112 states and 11034 transitions. [2025-01-09 04:58:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 318 [2025-01-09 04:58:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:43,866 INFO L225 Difference]: With dead ends: 7112 [2025-01-09 04:58:43,866 INFO L226 Difference]: Without dead ends: 4750 [2025-01-09 04:58:43,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:43,872 INFO L435 NwaCegarLoop]: 2380 mSDtfsCounter, 1187 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 3568 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:43,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 3568 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4750 states. [2025-01-09 04:58:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4750 to 2396. [2025-01-09 04:58:43,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2395 states have (on average 1.552400835073069) internal successors, (3718), 2395 states have internal predecessors, (3718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3718 transitions. [2025-01-09 04:58:43,948 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3718 transitions. Word has length 318 [2025-01-09 04:58:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:43,948 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 3718 transitions. [2025-01-09 04:58:43,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3718 transitions. [2025-01-09 04:58:43,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-01-09 04:58:43,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:43,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:43,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:58:43,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:43,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash -528855671, now seen corresponding path program 1 times [2025-01-09 04:58:43,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:43,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919818569] [2025-01-09 04:58:43,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:43,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:43,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-09 04:58:44,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-09 04:58:44,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:44,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:44,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:44,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919818569] [2025-01-09 04:58:44,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919818569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:44,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:44,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:44,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312568926] [2025-01-09 04:58:44,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:44,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:44,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:44,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:44,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:44,172 INFO L87 Difference]: Start difference. First operand 2396 states and 3718 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:44,268 INFO L93 Difference]: Finished difference Result 6949 states and 10745 transitions. [2025-01-09 04:58:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:44,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 318 [2025-01-09 04:58:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:44,282 INFO L225 Difference]: With dead ends: 6949 [2025-01-09 04:58:44,283 INFO L226 Difference]: Without dead ends: 4691 [2025-01-09 04:58:44,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:44,287 INFO L435 NwaCegarLoop]: 2325 mSDtfsCounter, 1059 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 3462 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:44,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 3462 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2025-01-09 04:58:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 4689. [2025-01-09 04:58:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4688 states have (on average 1.54330204778157) internal successors, (7235), 4688 states have internal predecessors, (7235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 7235 transitions. [2025-01-09 04:58:44,383 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 7235 transitions. Word has length 318 [2025-01-09 04:58:44,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:44,383 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 7235 transitions. [2025-01-09 04:58:44,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 7235 transitions. [2025-01-09 04:58:44,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-01-09 04:58:44,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:44,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:44,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:58:44,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:44,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:44,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1432087453, now seen corresponding path program 1 times [2025-01-09 04:58:44,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:44,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945726733] [2025-01-09 04:58:44,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:44,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:44,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-01-09 04:58:44,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-01-09 04:58:44,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:44,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:44,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:44,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945726733] [2025-01-09 04:58:44,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945726733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:44,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:44,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:44,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379490322] [2025-01-09 04:58:44,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:44,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:44,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:44,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:44,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:44,538 INFO L87 Difference]: Start difference. First operand 4689 states and 7235 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:44,594 INFO L93 Difference]: Finished difference Result 9340 states and 14403 transitions. [2025-01-09 04:58:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:44,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 319 [2025-01-09 04:58:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:44,610 INFO L225 Difference]: With dead ends: 9340 [2025-01-09 04:58:44,610 INFO L226 Difference]: Without dead ends: 4707 [2025-01-09 04:58:44,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:44,616 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 5 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2406 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:44,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2406 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4707 states. [2025-01-09 04:58:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4707 to 4707. [2025-01-09 04:58:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4707 states, 4706 states have (on average 1.5418614534636634) internal successors, (7256), 4706 states have internal predecessors, (7256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4707 states to 4707 states and 7256 transitions. [2025-01-09 04:58:44,709 INFO L78 Accepts]: Start accepts. Automaton has 4707 states and 7256 transitions. Word has length 319 [2025-01-09 04:58:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:44,709 INFO L471 AbstractCegarLoop]: Abstraction has 4707 states and 7256 transitions. [2025-01-09 04:58:44,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 4707 states and 7256 transitions. [2025-01-09 04:58:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 04:58:44,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:44,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:44,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:58:44,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:44,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash -131705436, now seen corresponding path program 1 times [2025-01-09 04:58:44,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:44,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756046350] [2025-01-09 04:58:44,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:44,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:44,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 04:58:44,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 04:58:44,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:44,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:44,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:44,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756046350] [2025-01-09 04:58:44,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756046350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:44,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:44,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:44,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117549797] [2025-01-09 04:58:44,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:44,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:44,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:44,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:44,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:44,916 INFO L87 Difference]: Start difference. First operand 4707 states and 7256 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:45,038 INFO L93 Difference]: Finished difference Result 13598 states and 20881 transitions. [2025-01-09 04:58:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:45,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2025-01-09 04:58:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:45,062 INFO L225 Difference]: With dead ends: 13598 [2025-01-09 04:58:45,063 INFO L226 Difference]: Without dead ends: 9132 [2025-01-09 04:58:45,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:45,070 INFO L435 NwaCegarLoop]: 2332 mSDtfsCounter, 1053 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:45,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 3469 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9132 states. [2025-01-09 04:58:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9132 to 9130. [2025-01-09 04:58:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9130 states, 9129 states have (on average 1.5305071749370138) internal successors, (13972), 9129 states have internal predecessors, (13972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9130 states to 9130 states and 13972 transitions. [2025-01-09 04:58:45,239 INFO L78 Accepts]: Start accepts. Automaton has 9130 states and 13972 transitions. Word has length 320 [2025-01-09 04:58:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:45,239 INFO L471 AbstractCegarLoop]: Abstraction has 9130 states and 13972 transitions. [2025-01-09 04:58:45,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 9130 states and 13972 transitions. [2025-01-09 04:58:45,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-09 04:58:45,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:45,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:45,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:58:45,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:45,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:45,254 INFO L85 PathProgramCache]: Analyzing trace with hash 570948353, now seen corresponding path program 1 times [2025-01-09 04:58:45,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:45,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196590523] [2025-01-09 04:58:45,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:45,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:45,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-09 04:58:45,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-09 04:58:45,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:45,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:46,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:46,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196590523] [2025-01-09 04:58:46,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196590523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:46,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:46,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:58:46,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023649234] [2025-01-09 04:58:46,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:46,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:58:46,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:46,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:58:46,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:46,104 INFO L87 Difference]: Start difference. First operand 9130 states and 13972 transitions. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:46,244 INFO L93 Difference]: Finished difference Result 26457 states and 40290 transitions. [2025-01-09 04:58:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:58:46,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2025-01-09 04:58:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:46,282 INFO L225 Difference]: With dead ends: 26457 [2025-01-09 04:58:46,282 INFO L226 Difference]: Without dead ends: 17863 [2025-01-09 04:58:46,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:58:46,299 INFO L435 NwaCegarLoop]: 2375 mSDtfsCounter, 1156 mSDsluCounter, 3563 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 5938 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:46,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 5938 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:46,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17863 states. [2025-01-09 04:58:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17863 to 9365. [2025-01-09 04:58:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9365 states, 9364 states have (on average 1.5335326783425887) internal successors, (14360), 9364 states have internal predecessors, (14360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 14360 transitions. [2025-01-09 04:58:46,642 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 14360 transitions. Word has length 320 [2025-01-09 04:58:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:46,642 INFO L471 AbstractCegarLoop]: Abstraction has 9365 states and 14360 transitions. [2025-01-09 04:58:46,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 14360 transitions. [2025-01-09 04:58:46,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-01-09 04:58:46,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:46,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:46,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:58:46,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:46,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:46,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1415860444, now seen corresponding path program 1 times [2025-01-09 04:58:46,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:46,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240430312] [2025-01-09 04:58:46,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:46,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:46,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 321 statements into 1 equivalence classes. [2025-01-09 04:58:46,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 321 of 321 statements. [2025-01-09 04:58:46,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:46,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:46,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:46,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240430312] [2025-01-09 04:58:46,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240430312] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:46,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:46,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119939965] [2025-01-09 04:58:46,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:46,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:46,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:46,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:46,804 INFO L87 Difference]: Start difference. First operand 9365 states and 14360 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:46,916 INFO L93 Difference]: Finished difference Result 20269 states and 31278 transitions. [2025-01-09 04:58:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:46,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2025-01-09 04:58:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:46,939 INFO L225 Difference]: With dead ends: 20269 [2025-01-09 04:58:46,939 INFO L226 Difference]: Without dead ends: 12663 [2025-01-09 04:58:46,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:46,951 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 536 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:46,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 2532 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12663 states. [2025-01-09 04:58:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12663 to 11269. [2025-01-09 04:58:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.5530706425275116) internal successors, (17500), 11268 states have internal predecessors, (17500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 17500 transitions. [2025-01-09 04:58:47,223 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 17500 transitions. Word has length 321 [2025-01-09 04:58:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:47,224 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 17500 transitions. [2025-01-09 04:58:47,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 17500 transitions. [2025-01-09 04:58:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-01-09 04:58:47,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:47,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:47,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:58:47,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:47,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:47,238 INFO L85 PathProgramCache]: Analyzing trace with hash -415484776, now seen corresponding path program 1 times [2025-01-09 04:58:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:47,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131215638] [2025-01-09 04:58:47,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:47,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-09 04:58:47,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-09 04:58:47,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:47,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:47,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:47,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131215638] [2025-01-09 04:58:47,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131215638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:47,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:47,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:47,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483426165] [2025-01-09 04:58:47,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:47,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:47,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:47,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:47,364 INFO L87 Difference]: Start difference. First operand 11269 states and 17500 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:47,457 INFO L93 Difference]: Finished difference Result 32245 states and 49789 transitions. [2025-01-09 04:58:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:47,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 322 [2025-01-09 04:58:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:47,496 INFO L225 Difference]: With dead ends: 32245 [2025-01-09 04:58:47,497 INFO L226 Difference]: Without dead ends: 21775 [2025-01-09 04:58:47,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:47,518 INFO L435 NwaCegarLoop]: 2242 mSDtfsCounter, 1052 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:47,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 3426 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21775 states. [2025-01-09 04:58:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21775 to 11373. [2025-01-09 04:58:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11373 states, 11372 states have (on average 1.5514421385860007) internal successors, (17643), 11372 states have internal predecessors, (17643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:47,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11373 states to 11373 states and 17643 transitions. [2025-01-09 04:58:47,762 INFO L78 Accepts]: Start accepts. Automaton has 11373 states and 17643 transitions. Word has length 322 [2025-01-09 04:58:47,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:47,762 INFO L471 AbstractCegarLoop]: Abstraction has 11373 states and 17643 transitions. [2025-01-09 04:58:47,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:47,763 INFO L276 IsEmpty]: Start isEmpty. Operand 11373 states and 17643 transitions. [2025-01-09 04:58:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-01-09 04:58:47,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:47,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:47,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:58:47,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:47,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:47,776 INFO L85 PathProgramCache]: Analyzing trace with hash -939252223, now seen corresponding path program 1 times [2025-01-09 04:58:47,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:47,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29574716] [2025-01-09 04:58:47,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:47,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 04:58:47,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 04:58:47,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:47,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:47,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:47,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29574716] [2025-01-09 04:58:47,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29574716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:47,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:47,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:58:47,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709382455] [2025-01-09 04:58:47,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:47,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:58:47,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:47,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:58:47,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:47,936 INFO L87 Difference]: Start difference. First operand 11373 states and 17643 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:47,991 INFO L93 Difference]: Finished difference Result 21975 states and 33950 transitions. [2025-01-09 04:58:47,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:58:47,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 323 [2025-01-09 04:58:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:48,010 INFO L225 Difference]: With dead ends: 21975 [2025-01-09 04:58:48,010 INFO L226 Difference]: Without dead ends: 11498 [2025-01-09 04:58:48,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:58:48,023 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 5 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2400 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:48,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2400 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:58:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11498 states. [2025-01-09 04:58:48,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11498 to 11498. [2025-01-09 04:58:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11498 states, 11497 states have (on average 1.5472732017047925) internal successors, (17789), 11497 states have internal predecessors, (17789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11498 states to 11498 states and 17789 transitions. [2025-01-09 04:58:48,174 INFO L78 Accepts]: Start accepts. Automaton has 11498 states and 17789 transitions. Word has length 323 [2025-01-09 04:58:48,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:48,174 INFO L471 AbstractCegarLoop]: Abstraction has 11498 states and 17789 transitions. [2025-01-09 04:58:48,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:48,175 INFO L276 IsEmpty]: Start isEmpty. Operand 11498 states and 17789 transitions. [2025-01-09 04:58:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 04:58:48,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:48,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:48,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:58:48,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:48,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1155276537, now seen corresponding path program 1 times [2025-01-09 04:58:48,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:48,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664514470] [2025-01-09 04:58:48,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:48,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:48,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 04:58:48,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 04:58:48,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:48,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:48,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:48,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664514470] [2025-01-09 04:58:48,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664514470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:48,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:48,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:58:48,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316815814] [2025-01-09 04:58:48,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:48,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:58:48,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:48,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:58:48,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:58:48,652 INFO L87 Difference]: Start difference. First operand 11498 states and 17789 transitions. Second operand has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:51,709 INFO L93 Difference]: Finished difference Result 88362 states and 140238 transitions. [2025-01-09 04:58:51,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 04:58:51,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2025-01-09 04:58:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:51,863 INFO L225 Difference]: With dead ends: 88362 [2025-01-09 04:58:51,863 INFO L226 Difference]: Without dead ends: 84992 [2025-01-09 04:58:51,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=370, Invalid=1112, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 04:58:51,904 INFO L435 NwaCegarLoop]: 1797 mSDtfsCounter, 22359 mSDsluCounter, 8809 mSDsCounter, 0 mSdLazyCounter, 3809 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22359 SdHoareTripleChecker+Valid, 10606 SdHoareTripleChecker+Invalid, 4185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 3809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:51,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22359 Valid, 10606 Invalid, 4185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 3809 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 04:58:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84992 states. [2025-01-09 04:58:52,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84992 to 28806. [2025-01-09 04:58:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28806 states, 28805 states have (on average 1.5576809581669848) internal successors, (44869), 28805 states have internal predecessors, (44869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28806 states to 28806 states and 44869 transitions. [2025-01-09 04:58:52,806 INFO L78 Accepts]: Start accepts. Automaton has 28806 states and 44869 transitions. Word has length 324 [2025-01-09 04:58:52,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:52,808 INFO L471 AbstractCegarLoop]: Abstraction has 28806 states and 44869 transitions. [2025-01-09 04:58:52,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 9 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 28806 states and 44869 transitions. [2025-01-09 04:58:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 04:58:52,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:52,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:52,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:58:52,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:52,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:52,837 INFO L85 PathProgramCache]: Analyzing trace with hash -350055568, now seen corresponding path program 1 times [2025-01-09 04:58:52,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:52,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808255828] [2025-01-09 04:58:52,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:52,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:52,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 04:58:52,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 04:58:52,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:52,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:53,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:53,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808255828] [2025-01-09 04:58:53,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808255828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:53,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:53,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:58:53,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550744638] [2025-01-09 04:58:53,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:53,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:58:53,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:53,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:58:53,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:58:53,654 INFO L87 Difference]: Start difference. First operand 28806 states and 44869 transitions. Second operand has 9 states, 9 states have (on average 36.0) internal successors, (324), 8 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:55,079 INFO L93 Difference]: Finished difference Result 75201 states and 118666 transitions. [2025-01-09 04:58:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:58:55,080 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 8 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2025-01-09 04:58:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:55,309 INFO L225 Difference]: With dead ends: 75201 [2025-01-09 04:58:55,309 INFO L226 Difference]: Without dead ends: 58827 [2025-01-09 04:58:55,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:58:55,324 INFO L435 NwaCegarLoop]: 1249 mSDtfsCounter, 9776 mSDsluCounter, 5350 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9776 SdHoareTripleChecker+Valid, 6599 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:55,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9776 Valid, 6599 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:58:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58827 states. [2025-01-09 04:58:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58827 to 24869. [2025-01-09 04:58:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24869 states, 24868 states have (on average 1.5463245938555574) internal successors, (38454), 24868 states have internal predecessors, (38454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24869 states to 24869 states and 38454 transitions. [2025-01-09 04:58:55,744 INFO L78 Accepts]: Start accepts. Automaton has 24869 states and 38454 transitions. Word has length 324 [2025-01-09 04:58:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:55,744 INFO L471 AbstractCegarLoop]: Abstraction has 24869 states and 38454 transitions. [2025-01-09 04:58:55,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.0) internal successors, (324), 8 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 24869 states and 38454 transitions. [2025-01-09 04:58:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 04:58:55,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:55,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:55,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:58:55,758 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:55,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:55,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1158982380, now seen corresponding path program 1 times [2025-01-09 04:58:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:55,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149489309] [2025-01-09 04:58:55,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:55,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 04:58:55,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 04:58:55,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:55,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:56,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:56,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149489309] [2025-01-09 04:58:56,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149489309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:56,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:56,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:58:56,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337119654] [2025-01-09 04:58:56,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:56,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:58:56,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:56,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:58:56,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:56,212 INFO L87 Difference]: Start difference. First operand 24869 states and 38454 transitions. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:56,475 INFO L93 Difference]: Finished difference Result 51377 states and 81082 transitions. [2025-01-09 04:58:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:58:56,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2025-01-09 04:58:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:56,521 INFO L225 Difference]: With dead ends: 51377 [2025-01-09 04:58:56,522 INFO L226 Difference]: Without dead ends: 38131 [2025-01-09 04:58:56,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 04:58:56,543 INFO L435 NwaCegarLoop]: 1345 mSDtfsCounter, 1359 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:56,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 2761 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:58:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38131 states. [2025-01-09 04:58:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38131 to 38129. [2025-01-09 04:58:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38129 states, 38128 states have (on average 1.5555497272345782) internal successors, (59310), 38128 states have internal predecessors, (59310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38129 states to 38129 states and 59310 transitions. [2025-01-09 04:58:56,958 INFO L78 Accepts]: Start accepts. Automaton has 38129 states and 59310 transitions. Word has length 324 [2025-01-09 04:58:56,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:58:56,959 INFO L471 AbstractCegarLoop]: Abstraction has 38129 states and 59310 transitions. [2025-01-09 04:58:56,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 38129 states and 59310 transitions. [2025-01-09 04:58:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-01-09 04:58:56,974 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:58:56,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:58:56,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:58:56,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:58:56,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:58:56,975 INFO L85 PathProgramCache]: Analyzing trace with hash -269352895, now seen corresponding path program 1 times [2025-01-09 04:58:56,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:58:56,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023148531] [2025-01-09 04:58:56,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:58:56,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:58:56,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 04:58:57,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 04:58:57,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:58:57,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:58:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:58:57,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:58:57,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023148531] [2025-01-09 04:58:57,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023148531] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:58:57,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:58:57,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:58:57,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194553598] [2025-01-09 04:58:57,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:58:57,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:58:57,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:58:57,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:58:57,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:58:57,590 INFO L87 Difference]: Start difference. First operand 38129 states and 59310 transitions. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:58:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:58:58,138 INFO L93 Difference]: Finished difference Result 186863 states and 290482 transitions. [2025-01-09 04:58:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:58:58,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 324 [2025-01-09 04:58:58,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:58:58,338 INFO L225 Difference]: With dead ends: 186863 [2025-01-09 04:58:58,338 INFO L226 Difference]: Without dead ends: 148802 [2025-01-09 04:58:58,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:58:58,404 INFO L435 NwaCegarLoop]: 2051 mSDtfsCounter, 3531 mSDsluCounter, 3106 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3531 SdHoareTripleChecker+Valid, 5157 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:58:58,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3531 Valid, 5157 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:58:58,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148802 states. [2025-01-09 04:58:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148802 to 74454. [2025-01-09 04:58:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74454 states, 74453 states have (on average 1.546680456126684) internal successors, (115155), 74453 states have internal predecessors, (115155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74454 states to 74454 states and 115155 transitions. [2025-01-09 04:59:00,619 INFO L78 Accepts]: Start accepts. Automaton has 74454 states and 115155 transitions. Word has length 324 [2025-01-09 04:59:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:59:00,620 INFO L471 AbstractCegarLoop]: Abstraction has 74454 states and 115155 transitions. [2025-01-09 04:59:00,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 74454 states and 115155 transitions. [2025-01-09 04:59:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 04:59:00,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:59:00,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:00,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:59:00,669 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:59:00,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:59:00,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1497228852, now seen corresponding path program 1 times [2025-01-09 04:59:00,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:59:00,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441759568] [2025-01-09 04:59:00,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:59:00,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:59:00,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 04:59:00,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 04:59:00,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:59:00,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:59:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:59:00,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:59:00,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441759568] [2025-01-09 04:59:00,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441759568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:59:00,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:59:00,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:59:00,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810770873] [2025-01-09 04:59:00,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:59:00,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:59:00,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:59:00,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:59:00,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:59:00,952 INFO L87 Difference]: Start difference. First operand 74454 states and 115155 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:59:01,375 INFO L93 Difference]: Finished difference Result 218340 states and 337489 transitions. [2025-01-09 04:59:01,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:59:01,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 326 [2025-01-09 04:59:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:59:01,571 INFO L225 Difference]: With dead ends: 218340 [2025-01-09 04:59:01,571 INFO L226 Difference]: Without dead ends: 145371 [2025-01-09 04:59:01,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:59:01,658 INFO L435 NwaCegarLoop]: 2208 mSDtfsCounter, 1033 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 3334 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:59:01,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 3334 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:59:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145371 states. [2025-01-09 04:59:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145371 to 145369. [2025-01-09 04:59:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145369 states, 145368 states have (on average 1.5389563040008805) internal successors, (223715), 145368 states have internal predecessors, (223715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145369 states to 145369 states and 223715 transitions. [2025-01-09 04:59:04,818 INFO L78 Accepts]: Start accepts. Automaton has 145369 states and 223715 transitions. Word has length 326 [2025-01-09 04:59:04,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:59:04,818 INFO L471 AbstractCegarLoop]: Abstraction has 145369 states and 223715 transitions. [2025-01-09 04:59:04,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 145369 states and 223715 transitions. [2025-01-09 04:59:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-09 04:59:04,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:59:04,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:04,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:59:04,894 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:59:04,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:59:04,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1156452997, now seen corresponding path program 1 times [2025-01-09 04:59:04,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:59:04,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389461060] [2025-01-09 04:59:04,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:59:04,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:59:04,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-09 04:59:04,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-09 04:59:04,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:59:04,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:59:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:59:05,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:59:05,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389461060] [2025-01-09 04:59:05,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389461060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:59:05,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:59:05,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:59:05,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496560780] [2025-01-09 04:59:05,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:59:05,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:59:05,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:59:05,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:59:05,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:59:05,559 INFO L87 Difference]: Start difference. First operand 145369 states and 223715 transitions. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:59:06,403 INFO L93 Difference]: Finished difference Result 272895 states and 419175 transitions. [2025-01-09 04:59:06,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:59:06,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 326 [2025-01-09 04:59:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:59:06,579 INFO L225 Difference]: With dead ends: 272895 [2025-01-09 04:59:06,580 INFO L226 Difference]: Without dead ends: 129799 [2025-01-09 04:59:06,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:59:06,669 INFO L435 NwaCegarLoop]: 1323 mSDtfsCounter, 99 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 3824 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:59:06,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 3824 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:59:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129799 states. [2025-01-09 04:59:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129799 to 129723. [2025-01-09 04:59:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129723 states, 129722 states have (on average 1.5344197591773177) internal successors, (199048), 129722 states have internal predecessors, (199048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129723 states to 129723 states and 199048 transitions. [2025-01-09 04:59:09,039 INFO L78 Accepts]: Start accepts. Automaton has 129723 states and 199048 transitions. Word has length 326 [2025-01-09 04:59:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:59:09,039 INFO L471 AbstractCegarLoop]: Abstraction has 129723 states and 199048 transitions. [2025-01-09 04:59:09,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 129723 states and 199048 transitions. [2025-01-09 04:59:09,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-09 04:59:09,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:59:09,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:09,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:59:09,096 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:59:09,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:59:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash -892364145, now seen corresponding path program 1 times [2025-01-09 04:59:09,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:59:09,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903347711] [2025-01-09 04:59:09,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:59:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:59:09,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 04:59:09,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 04:59:09,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:59:09,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:59:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:59:09,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:59:09,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903347711] [2025-01-09 04:59:09,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903347711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:59:09,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:59:09,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:59:09,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790622973] [2025-01-09 04:59:09,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:59:09,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:59:09,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:59:09,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:59:09,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:59:09,499 INFO L87 Difference]: Start difference. First operand 129723 states and 199048 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:59:10,246 INFO L93 Difference]: Finished difference Result 381676 states and 584640 transitions. [2025-01-09 04:59:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:59:10,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 328 [2025-01-09 04:59:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:59:11,019 INFO L225 Difference]: With dead ends: 381676 [2025-01-09 04:59:11,019 INFO L226 Difference]: Without dead ends: 253296 [2025-01-09 04:59:11,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:59:11,129 INFO L435 NwaCegarLoop]: 2219 mSDtfsCounter, 1019 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:59:11,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 3339 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:59:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253296 states. [2025-01-09 04:59:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253296 to 253294. [2025-01-09 04:59:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253294 states, 253293 states have (on average 1.5230701203744281) internal successors, (385783), 253293 states have internal predecessors, (385783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253294 states to 253294 states and 385783 transitions. [2025-01-09 04:59:15,933 INFO L78 Accepts]: Start accepts. Automaton has 253294 states and 385783 transitions. Word has length 328 [2025-01-09 04:59:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:59:15,933 INFO L471 AbstractCegarLoop]: Abstraction has 253294 states and 385783 transitions. [2025-01-09 04:59:15,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 253294 states and 385783 transitions. [2025-01-09 04:59:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-09 04:59:16,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:59:16,033 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:16,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:59:16,033 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:59:16,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:59:16,034 INFO L85 PathProgramCache]: Analyzing trace with hash -473627092, now seen corresponding path program 1 times [2025-01-09 04:59:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:59:16,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307736216] [2025-01-09 04:59:16,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:59:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:59:16,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 04:59:16,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 04:59:16,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:59:16,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:59:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:59:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:59:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307736216] [2025-01-09 04:59:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307736216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:59:16,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:59:16,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:59:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023039785] [2025-01-09 04:59:16,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:59:16,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:59:16,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:59:16,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:59:16,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:59:16,880 INFO L87 Difference]: Start difference. First operand 253294 states and 385783 transitions. Second operand has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:59:18,964 INFO L93 Difference]: Finished difference Result 738853 states and 1123391 transitions. [2025-01-09 04:59:18,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:59:18,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 328 [2025-01-09 04:59:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:59:19,838 INFO L225 Difference]: With dead ends: 738853 [2025-01-09 04:59:19,838 INFO L226 Difference]: Without dead ends: 485769 [2025-01-09 04:59:19,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:59:20,000 INFO L435 NwaCegarLoop]: 1992 mSDtfsCounter, 1071 mSDsluCounter, 3068 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 5060 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:59:20,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 5060 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:59:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485769 states. [2025-01-09 04:59:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485769 to 485767. [2025-01-09 04:59:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485767 states, 485766 states have (on average 1.5104865305517472) internal successors, (733743), 485766 states have internal predecessors, (733743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485767 states to 485767 states and 733743 transitions. [2025-01-09 04:59:29,792 INFO L78 Accepts]: Start accepts. Automaton has 485767 states and 733743 transitions. Word has length 328 [2025-01-09 04:59:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:59:29,793 INFO L471 AbstractCegarLoop]: Abstraction has 485767 states and 733743 transitions. [2025-01-09 04:59:29,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:59:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 485767 states and 733743 transitions. [2025-01-09 04:59:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-09 04:59:29,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:59:29,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:59:29,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:59:29,996 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:59:29,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:59:29,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1582171422, now seen corresponding path program 1 times [2025-01-09 04:59:29,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:59:29,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862927240] [2025-01-09 04:59:29,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:59:29,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:59:30,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-09 04:59:30,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-09 04:59:30,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:59:30,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:59:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:59:30,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:59:30,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862927240] [2025-01-09 04:59:30,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862927240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:59:30,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:59:30,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:59:30,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822236815] [2025-01-09 04:59:30,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:59:30,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:59:30,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:59:30,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:59:30,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:59:30,097 INFO L87 Difference]: Start difference. First operand 485767 states and 733743 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)