./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-66.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 75e16fbc6add136470e5a368bd6380d698425fcea4219ad0b84abde2182994d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:42:37,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:42:37,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:42:37,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:42:37,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:42:37,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:42:37,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:42:37,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:42:37,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:42:37,660 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:42:37,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:42:37,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:42:37,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:42:37,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:42:37,661 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:42:37,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:42:37,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:42:37,662 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:42:37,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:42:37,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:42:37,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:42:37,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:42:37,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:42:37,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:42:37,663 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:42:37,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:42:37,663 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:42:37,663 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:42:37,663 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:42:37,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:42:37,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:42:37,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:42:37,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:42:37,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:42:37,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:42:37,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:42:37,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:42:37,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:42:37,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:42:37,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:42:37,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:42:37,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:42:37,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:42:37,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:42:37,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:42:37,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:42:37,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:42:37,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:42:37,665 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 -> 75e16fbc6add136470e5a368bd6380d698425fcea4219ad0b84abde2182994d0 [2025-01-09 10:42:37,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:42:37,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:42:37,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:42:37,961 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:42:37,961 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:42:37,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-66.i [2025-01-09 10:42:39,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af52a7e7a/822ab37c3df04988ae47a16fd295a42e/FLAG88ad90d09 [2025-01-09 10:42:39,660 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:42:39,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-66.i [2025-01-09 10:42:39,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af52a7e7a/822ab37c3df04988ae47a16fd295a42e/FLAG88ad90d09 [2025-01-09 10:42:39,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af52a7e7a/822ab37c3df04988ae47a16fd295a42e [2025-01-09 10:42:39,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:42:39,696 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:42:39,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:42:39,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:42:39,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:42:39,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:42:39" (1/1) ... [2025-01-09 10:42:39,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a75321b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:39, skipping insertion in model container [2025-01-09 10:42:39,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:42:39" (1/1) ... [2025-01-09 10:42:39,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:42:39,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-66.i[919,932] [2025-01-09 10:42:39,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:42:39,936 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:42:39,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-66.i[919,932] [2025-01-09 10:42:39,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:42:40,011 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:42:40,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40 WrapperNode [2025-01-09 10:42:40,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:42:40,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:42:40,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:42:40,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:42:40,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,073 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2025-01-09 10:42:40,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:42:40,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:42:40,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:42:40,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:42:40,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,098 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 10:42:40,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:42:40,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:42:40,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:42:40,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:42:40,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (1/1) ... [2025-01-09 10:42:40,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:42:40,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:42:40,153 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 10:42:40,156 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 10:42:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:42:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:42:40,176 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:42:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:42:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:42:40,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:42:40,246 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:42:40,248 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:42:40,684 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 10:42:40,685 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:42:40,701 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:42:40,701 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:42:40,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:42:40 BoogieIcfgContainer [2025-01-09 10:42:40,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:42:40,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:42:40,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:42:40,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:42:40,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:42:39" (1/3) ... [2025-01-09 10:42:40,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbb1a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:42:40, skipping insertion in model container [2025-01-09 10:42:40,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:42:40" (2/3) ... [2025-01-09 10:42:40,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbb1a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:42:40, skipping insertion in model container [2025-01-09 10:42:40,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:42:40" (3/3) ... [2025-01-09 10:42:40,714 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-66.i [2025-01-09 10:42:40,728 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:42:40,729 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-66.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:42:40,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:42:40,804 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;@37383f2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:42:40,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:42:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 10:42:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 10:42:40,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:42:40,826 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:42:40,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:42:40,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:42:40,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1175955554, now seen corresponding path program 1 times [2025-01-09 10:42:40,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:42:40,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222727814] [2025-01-09 10:42:40,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:42:40,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:42:40,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 10:42:40,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 10:42:40,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:42:40,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:42:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-01-09 10:42:41,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:42:41,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222727814] [2025-01-09 10:42:41,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222727814] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:42:41,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353844161] [2025-01-09 10:42:41,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:42:41,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:42:41,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:42:41,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:42:41,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:42:41,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 10:42:41,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 10:42:41,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:42:41,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:42:41,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:42:41,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:42:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 3698 trivial. 0 not checked. [2025-01-09 10:42:41,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:42:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353844161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:42:41,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:42:41,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:42:41,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873243808] [2025-01-09 10:42:41,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:42:41,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:42:41,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:42:41,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:42:41,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:42:41,649 INFO L87 Difference]: Start difference. First operand has 113 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 10:42:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:42:41,686 INFO L93 Difference]: Finished difference Result 220 states and 401 transitions. [2025-01-09 10:42:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:42:41,688 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 270 [2025-01-09 10:42:41,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:42:41,697 INFO L225 Difference]: With dead ends: 220 [2025-01-09 10:42:41,697 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 10:42:41,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:42:41,703 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:42:41,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:42:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 10:42:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 10:42:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 10:42:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 176 transitions. [2025-01-09 10:42:41,751 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 176 transitions. Word has length 270 [2025-01-09 10:42:41,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:42:41,751 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 176 transitions. [2025-01-09 10:42:41,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (44), 2 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 10:42:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 176 transitions. [2025-01-09 10:42:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 10:42:41,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:42:41,763 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:42:41,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:42:41,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:42:41,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:42:41,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:42:41,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1408812122, now seen corresponding path program 1 times [2025-01-09 10:42:41,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:42:41,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215969319] [2025-01-09 10:42:41,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:42:41,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:42:41,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 10:42:42,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 10:42:42,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:42:42,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:42:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:42:43,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:42:43,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215969319] [2025-01-09 10:42:43,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215969319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:42:43,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:42:43,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:42:43,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261596675] [2025-01-09 10:42:43,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:42:43,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:42:43,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:42:43,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:42:43,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:42:43,622 INFO L87 Difference]: Start difference. First operand 110 states and 176 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 10:42:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:42:44,010 INFO L93 Difference]: Finished difference Result 264 states and 422 transitions. [2025-01-09 10:42:44,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:42:44,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 270 [2025-01-09 10:42:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:42:44,016 INFO L225 Difference]: With dead ends: 264 [2025-01-09 10:42:44,018 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 10:42:44,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:42:44,022 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 226 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:42:44,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 306 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:42:44,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 10:42:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2025-01-09 10:42:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 102 states have internal predecessors, (146), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 10:42:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 246 transitions. [2025-01-09 10:42:44,061 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 246 transitions. Word has length 270 [2025-01-09 10:42:44,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:42:44,063 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 246 transitions. [2025-01-09 10:42:44,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-01-09 10:42:44,064 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 246 transitions. [2025-01-09 10:42:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 10:42:44,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:42:44,069 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:42:44,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:42:44,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:42:44,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:42:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2068506724, now seen corresponding path program 1 times [2025-01-09 10:42:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:42:44,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497617183] [2025-01-09 10:42:44,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:42:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:42:44,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 10:42:44,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 10:42:44,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:42:44,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:43:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:43:06,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:43:06,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497617183] [2025-01-09 10:43:06,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497617183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:43:06,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:43:06,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 10:43:06,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143626367] [2025-01-09 10:43:06,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:43:06,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:43:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:43:06,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:43:06,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:43:06,032 INFO L87 Difference]: Start difference. First operand 154 states and 246 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:43:07,193 INFO L93 Difference]: Finished difference Result 414 states and 657 transitions. [2025-01-09 10:43:07,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:43:07,194 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 10:43:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:43:07,199 INFO L225 Difference]: With dead ends: 414 [2025-01-09 10:43:07,201 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 10:43:07,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:43:07,203 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 395 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:43:07,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1135 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:43:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 10:43:07,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 188. [2025-01-09 10:43:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 134 states have (on average 1.462686567164179) internal successors, (196), 135 states have internal predecessors, (196), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 10:43:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 296 transitions. [2025-01-09 10:43:07,233 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 296 transitions. Word has length 270 [2025-01-09 10:43:07,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:43:07,234 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 296 transitions. [2025-01-09 10:43:07,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:07,235 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 296 transitions. [2025-01-09 10:43:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 10:43:07,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:43:07,238 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:07,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:43:07,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:43:07,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:43:07,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1810341286, now seen corresponding path program 1 times [2025-01-09 10:43:07,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:43:07,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999783975] [2025-01-09 10:43:07,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:43:07,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:43:07,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 10:43:07,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 10:43:07,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:43:07,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:43:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:43:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:43:12,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999783975] [2025-01-09 10:43:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999783975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:43:12,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:43:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:43:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615360935] [2025-01-09 10:43:12,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:43:12,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:43:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:43:12,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:43:12,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:43:12,476 INFO L87 Difference]: Start difference. First operand 188 states and 296 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:43:13,780 INFO L93 Difference]: Finished difference Result 302 states and 468 transitions. [2025-01-09 10:43:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:43:13,781 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 10:43:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:43:13,784 INFO L225 Difference]: With dead ends: 302 [2025-01-09 10:43:13,784 INFO L226 Difference]: Without dead ends: 300 [2025-01-09 10:43:13,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:43:13,785 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 429 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:43:13,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1629 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:43:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-01-09 10:43:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 190. [2025-01-09 10:43:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 136 states have (on average 1.463235294117647) internal successors, (199), 137 states have internal predecessors, (199), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 10:43:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 299 transitions. [2025-01-09 10:43:13,808 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 299 transitions. Word has length 270 [2025-01-09 10:43:13,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:43:13,809 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 299 transitions. [2025-01-09 10:43:13,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:13,809 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 299 transitions. [2025-01-09 10:43:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 10:43:13,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:43:13,812 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:13,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:43:13,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:43:13,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:43:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1205392218, now seen corresponding path program 1 times [2025-01-09 10:43:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:43:13,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814774189] [2025-01-09 10:43:13,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:43:13,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:43:13,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 10:43:13,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 10:43:13,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:43:13,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:43:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:43:17,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:43:17,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814774189] [2025-01-09 10:43:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814774189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:43:17,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:43:17,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 10:43:17,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890939456] [2025-01-09 10:43:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:43:17,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:43:17,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:43:17,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:43:17,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:43:17,919 INFO L87 Difference]: Start difference. First operand 190 states and 299 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:43:18,619 INFO L93 Difference]: Finished difference Result 306 states and 473 transitions. [2025-01-09 10:43:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 10:43:18,620 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 10:43:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:43:18,622 INFO L225 Difference]: With dead ends: 306 [2025-01-09 10:43:18,622 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 10:43:18,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:43:18,623 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 412 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:43:18,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1317 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:43:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 10:43:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 192. [2025-01-09 10:43:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 138 states have (on average 1.463768115942029) internal successors, (202), 139 states have internal predecessors, (202), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 10:43:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 302 transitions. [2025-01-09 10:43:18,647 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 302 transitions. Word has length 270 [2025-01-09 10:43:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:43:18,648 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 302 transitions. [2025-01-09 10:43:18,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 302 transitions. [2025-01-09 10:43:18,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 10:43:18,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:43:18,653 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:18,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:43:18,654 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:43:18,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:43:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1463557656, now seen corresponding path program 1 times [2025-01-09 10:43:18,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:43:18,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745833176] [2025-01-09 10:43:18,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:43:18,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:43:18,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 10:43:18,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 10:43:18,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:43:18,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:43:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:43:23,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:43:23,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745833176] [2025-01-09 10:43:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745833176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:43:23,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:43:23,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:43:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551906082] [2025-01-09 10:43:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:43:23,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:43:23,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:43:23,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:43:23,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:43:23,963 INFO L87 Difference]: Start difference. First operand 192 states and 302 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:43:25,004 INFO L93 Difference]: Finished difference Result 304 states and 471 transitions. [2025-01-09 10:43:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 10:43:25,005 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 10:43:25,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:43:25,008 INFO L225 Difference]: With dead ends: 304 [2025-01-09 10:43:25,008 INFO L226 Difference]: Without dead ends: 302 [2025-01-09 10:43:25,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:43:25,009 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 359 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:43:25,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1588 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:43:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-01-09 10:43:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 192. [2025-01-09 10:43:25,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 138 states have (on average 1.463768115942029) internal successors, (202), 139 states have internal predecessors, (202), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 10:43:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 302 transitions. [2025-01-09 10:43:25,024 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 302 transitions. Word has length 270 [2025-01-09 10:43:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:43:25,024 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 302 transitions. [2025-01-09 10:43:25,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 302 transitions. [2025-01-09 10:43:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 10:43:25,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:43:25,026 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:25,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:43:25,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:43:25,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:43:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash 537516830, now seen corresponding path program 1 times [2025-01-09 10:43:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:43:25,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082278434] [2025-01-09 10:43:25,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:43:25,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:43:25,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 10:43:25,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 10:43:25,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:43:25,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:43:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:43:25,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:43:25,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082278434] [2025-01-09 10:43:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082278434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:43:25,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:43:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:43:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562938870] [2025-01-09 10:43:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:43:25,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:43:25,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:43:25,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:43:25,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:43:25,091 INFO L87 Difference]: Start difference. First operand 192 states and 302 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:43:25,139 INFO L93 Difference]: Finished difference Result 526 states and 828 transitions. [2025-01-09 10:43:25,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:43:25,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 10:43:25,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:43:25,143 INFO L225 Difference]: With dead ends: 526 [2025-01-09 10:43:25,143 INFO L226 Difference]: Without dead ends: 337 [2025-01-09 10:43:25,145 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 10:43:25,146 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 163 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:43:25,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 492 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:43:25,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-01-09 10:43:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 333. [2025-01-09 10:43:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 226 states have (on average 1.4026548672566372) internal successors, (317), 228 states have internal predecessors, (317), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 10:43:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 517 transitions. [2025-01-09 10:43:25,186 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 517 transitions. Word has length 270 [2025-01-09 10:43:25,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:43:25,188 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 517 transitions. [2025-01-09 10:43:25,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 517 transitions. [2025-01-09 10:43:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 10:43:25,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:43:25,191 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:25,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:43:25,191 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:43:25,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:43:25,192 INFO L85 PathProgramCache]: Analyzing trace with hash -742346848, now seen corresponding path program 1 times [2025-01-09 10:43:25,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:43:25,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563939993] [2025-01-09 10:43:25,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:43:25,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:43:25,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 10:43:25,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 10:43:25,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:43:25,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:43:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:43:25,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:43:25,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563939993] [2025-01-09 10:43:25,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563939993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:43:25,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:43:25,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:43:25,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463147776] [2025-01-09 10:43:25,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:43:25,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:43:25,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:43:25,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:43:25,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:43:25,323 INFO L87 Difference]: Start difference. First operand 333 states and 517 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:43:25,572 INFO L93 Difference]: Finished difference Result 972 states and 1501 transitions. [2025-01-09 10:43:25,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:43:25,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 10:43:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:43:25,579 INFO L225 Difference]: With dead ends: 972 [2025-01-09 10:43:25,579 INFO L226 Difference]: Without dead ends: 642 [2025-01-09 10:43:25,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:43:25,581 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 145 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:43:25,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 639 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:43:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-01-09 10:43:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 604. [2025-01-09 10:43:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 393 states have (on average 1.366412213740458) internal successors, (537), 397 states have internal predecessors, (537), 198 states have call successors, (198), 12 states have call predecessors, (198), 12 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) [2025-01-09 10:43:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 933 transitions. [2025-01-09 10:43:25,660 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 933 transitions. Word has length 270 [2025-01-09 10:43:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:43:25,661 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 933 transitions. [2025-01-09 10:43:25,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 933 transitions. [2025-01-09 10:43:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 10:43:25,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:43:25,664 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:25,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:43:25,664 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:43:25,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:43:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1763415202, now seen corresponding path program 1 times [2025-01-09 10:43:25,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:43:25,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092916483] [2025-01-09 10:43:25,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:43:25,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:43:25,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 10:43:25,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 10:43:25,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:43:25,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:43:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:43:27,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:43:27,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092916483] [2025-01-09 10:43:27,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092916483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:43:27,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:43:27,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 10:43:27,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826379598] [2025-01-09 10:43:27,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:43:27,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:43:27,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:43:27,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:43:27,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:43:27,755 INFO L87 Difference]: Start difference. First operand 604 states and 933 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:43:28,698 INFO L93 Difference]: Finished difference Result 737 states and 1117 transitions. [2025-01-09 10:43:28,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 10:43:28,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 270 [2025-01-09 10:43:28,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:43:28,706 INFO L225 Difference]: With dead ends: 737 [2025-01-09 10:43:28,706 INFO L226 Difference]: Without dead ends: 735 [2025-01-09 10:43:28,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:43:28,710 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 412 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:43:28,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1278 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:43:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-01-09 10:43:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 657. [2025-01-09 10:43:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 443 states have (on average 1.3860045146726863) internal successors, (614), 448 states have internal predecessors, (614), 200 states have call successors, (200), 13 states have call predecessors, (200), 13 states have return successors, (200), 195 states have call predecessors, (200), 200 states have call successors, (200) [2025-01-09 10:43:28,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1014 transitions. [2025-01-09 10:43:28,799 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1014 transitions. Word has length 270 [2025-01-09 10:43:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:43:28,799 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 1014 transitions. [2025-01-09 10:43:28,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 10:43:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1014 transitions. [2025-01-09 10:43:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-01-09 10:43:28,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:43:28,802 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:28,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:43:28,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:43:28,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:43:28,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1505249764, now seen corresponding path program 1 times [2025-01-09 10:43:28,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:43:28,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450990188] [2025-01-09 10:43:28,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:43:28,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:43:28,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-01-09 10:43:28,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-01-09 10:43:28,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:43:28,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:43:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:43:34,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:43:34,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450990188] [2025-01-09 10:43:34,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450990188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:43:34,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:43:34,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 10:43:34,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022664348] [2025-01-09 10:43:34,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:43:34,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 10:43:34,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:43:34,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 10:43:34,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:43:34,031 INFO L87 Difference]: Start difference. First operand 657 states and 1014 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-01-09 10:43:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:43:37,034 INFO L93 Difference]: Finished difference Result 735 states and 1115 transitions. [2025-01-09 10:43:37,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:43:37,035 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 270 [2025-01-09 10:43:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:43:37,040 INFO L225 Difference]: With dead ends: 735 [2025-01-09 10:43:37,040 INFO L226 Difference]: Without dead ends: 733 [2025-01-09 10:43:37,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2025-01-09 10:43:37,041 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 485 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:43:37,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1532 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:43:37,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-01-09 10:43:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 657. [2025-01-09 10:43:37,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 443 states have (on average 1.3860045146726863) internal successors, (614), 448 states have internal predecessors, (614), 200 states have call successors, (200), 13 states have call predecessors, (200), 13 states have return successors, (200), 195 states have call predecessors, (200), 200 states have call successors, (200) [2025-01-09 10:43:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1014 transitions. [2025-01-09 10:43:37,113 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1014 transitions. Word has length 270 [2025-01-09 10:43:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:43:37,113 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 1014 transitions. [2025-01-09 10:43:37,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-01-09 10:43:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1014 transitions. [2025-01-09 10:43:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 10:43:37,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:43:37,115 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:37,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:43:37,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:43:37,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:43:37,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1163072486, now seen corresponding path program 1 times [2025-01-09 10:43:37,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:43:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056198323] [2025-01-09 10:43:37,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:43:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:43:37,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:43:37,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:43:37,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:43:37,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:43:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2025-01-09 10:43:40,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:43:40,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056198323] [2025-01-09 10:43:40,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056198323] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:43:40,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:43:40,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 10:43:40,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848847033] [2025-01-09 10:43:40,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:43:40,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 10:43:40,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:43:40,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 10:43:40,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:43:40,907 INFO L87 Difference]: Start difference. First operand 657 states and 1014 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-01-09 10:43:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:43:43,133 INFO L93 Difference]: Finished difference Result 1346 states and 2073 transitions. [2025-01-09 10:43:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:43:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) Word has length 271 [2025-01-09 10:43:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:43:43,141 INFO L225 Difference]: With dead ends: 1346 [2025-01-09 10:43:43,141 INFO L226 Difference]: Without dead ends: 1016 [2025-01-09 10:43:43,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2025-01-09 10:43:43,147 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 1035 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:43:43,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1269 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 10:43:43,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-01-09 10:43:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 706. [2025-01-09 10:43:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 488 states have (on average 1.3934426229508197) internal successors, (680), 493 states have internal predecessors, (680), 200 states have call successors, (200), 17 states have call predecessors, (200), 17 states have return successors, (200), 195 states have call predecessors, (200), 200 states have call successors, (200) [2025-01-09 10:43:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1080 transitions. [2025-01-09 10:43:43,226 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1080 transitions. Word has length 271 [2025-01-09 10:43:43,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:43:43,227 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1080 transitions. [2025-01-09 10:43:43,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 3 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 3 states have call predecessors, (44), 3 states have call successors, (44) [2025-01-09 10:43:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1080 transitions. [2025-01-09 10:43:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 10:43:43,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:43:43,230 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:43:43,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:43:43,230 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:43:43,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:43:43,231 INFO L85 PathProgramCache]: Analyzing trace with hash -904907048, now seen corresponding path program 1 times [2025-01-09 10:43:43,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:43:43,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755292725] [2025-01-09 10:43:43,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:43:43,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:43:43,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 10:43:43,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 10:43:43,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:43:43,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat