./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-81.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 139d16f6f2adc0a53ed334bc0ef4cd475497ad47ce08b4367552becb4de333c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:23:30,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:23:30,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:23:30,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:23:30,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:23:30,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:23:30,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:23:30,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:23:30,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:23:30,558 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:23:30,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:23:30,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:23:30,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:23:30,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:23:30,558 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:23:30,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:23:30,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:23:30,559 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:23:30,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:23:30,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:23:30,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:23:30,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:23:30,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:23:30,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:23:30,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:23:30,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:23:30,562 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:23:30,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:23:30,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:23:30,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:23:30,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:23:30,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:23:30,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:23:30,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:23:30,563 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 -> 139d16f6f2adc0a53ed334bc0ef4cd475497ad47ce08b4367552becb4de333c7 [2025-01-09 12:23:30,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:23:30,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:23:30,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:23:30,794 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:23:30,794 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:23:30,795 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_normal_file-81.i [2025-01-09 12:23:31,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c651e7a98/e2d16426c49d46d7b968e716551cb8ae/FLAG51b098037 [2025-01-09 12:23:32,144 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:23:32,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-81.i [2025-01-09 12:23:32,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c651e7a98/e2d16426c49d46d7b968e716551cb8ae/FLAG51b098037 [2025-01-09 12:23:32,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c651e7a98/e2d16426c49d46d7b968e716551cb8ae [2025-01-09 12:23:32,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:23:32,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:23:32,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:23:32,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:23:32,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:23:32,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1503eb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32, skipping insertion in model container [2025-01-09 12:23:32,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:23:32,596 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_normal_file-81.i[913,926] [2025-01-09 12:23:32,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:23:32,664 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:23:32,673 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_normal_file-81.i[913,926] [2025-01-09 12:23:32,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:23:32,720 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:23:32,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32 WrapperNode [2025-01-09 12:23:32,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:23:32,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:23:32,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:23:32,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:23:32,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,776 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-01-09 12:23:32,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:23:32,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:23:32,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:23:32,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:23:32,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,802 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:23:32,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,814 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:23:32,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:23:32,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:23:32,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:23:32,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (1/1) ... [2025-01-09 12:23:32,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:23:32,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:23:32,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:23:32,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:23:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:23:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:23:32,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:23:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:23:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:23:32,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:23:32,929 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:23:32,930 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:23:33,197 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 12:23:33,197 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:23:33,204 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:23:33,205 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:23:33,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:23:33 BoogieIcfgContainer [2025-01-09 12:23:33,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:23:33,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:23:33,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:23:33,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:23:33,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:23:32" (1/3) ... [2025-01-09 12:23:33,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f95fe4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:23:33, skipping insertion in model container [2025-01-09 12:23:33,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:23:32" (2/3) ... [2025-01-09 12:23:33,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f95fe4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:23:33, skipping insertion in model container [2025-01-09 12:23:33,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:23:33" (3/3) ... [2025-01-09 12:23:33,214 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-81.i [2025-01-09 12:23:33,225 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:23:33,227 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-81.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:23:33,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:23:33,282 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;@620e601b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:23:33,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:23:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:23:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 12:23:33,295 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:23:33,296 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:23:33,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:23:33,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:23:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1733745716, now seen corresponding path program 1 times [2025-01-09 12:23:33,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:23:33,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882121194] [2025-01-09 12:23:33,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:23:33,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:23:33,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 12:23:33,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 12:23:33,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:23:33,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:23:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 12:23:33,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:23:33,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882121194] [2025-01-09 12:23:33,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882121194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:23:33,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453227913] [2025-01-09 12:23:33,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:23:33,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:23:33,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:23:33,558 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:23:33,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:23:33,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 12:23:33,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 12:23:33,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:23:33,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:23:33,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:23:33,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:23:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-01-09 12:23:33,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:23:33,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453227913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:23:33,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:23:33,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:23:33,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958556619] [2025-01-09 12:23:33,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:23:33,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:23:33,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:23:33,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:23:33,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:23:33,740 INFO L87 Difference]: Start difference. First operand has 76 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:23:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:23:33,766 INFO L93 Difference]: Finished difference Result 146 states and 253 transitions. [2025-01-09 12:23:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:23:33,768 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-01-09 12:23:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:23:33,773 INFO L225 Difference]: With dead ends: 146 [2025-01-09 12:23:33,774 INFO L226 Difference]: Without dead ends: 73 [2025-01-09 12:23:33,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:23:33,781 INFO L435 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:23:33,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:23:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-09 12:23:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-01-09 12:23:33,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 12:23:33,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2025-01-09 12:23:33,824 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 163 [2025-01-09 12:23:33,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:23:33,825 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2025-01-09 12:23:33,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:23:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2025-01-09 12:23:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 12:23:33,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:23:33,832 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:23:33,839 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 12:23:34,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:23:34,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:23:34,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:23:34,039 INFO L85 PathProgramCache]: Analyzing trace with hash -949701364, now seen corresponding path program 1 times [2025-01-09 12:23:34,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:23:34,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574351682] [2025-01-09 12:23:34,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:23:34,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:23:34,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 12:23:34,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 12:23:34,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:23:34,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:23:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:23:42,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:23:42,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574351682] [2025-01-09 12:23:42,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574351682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:23:42,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:23:42,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:23:42,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44780400] [2025-01-09 12:23:42,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:23:42,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:23:42,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:23:42,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:23:42,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:23:42,266 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:23:44,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:23:44,020 INFO L93 Difference]: Finished difference Result 321 states and 480 transitions. [2025-01-09 12:23:44,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:23:44,021 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-01-09 12:23:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:23:44,025 INFO L225 Difference]: With dead ends: 321 [2025-01-09 12:23:44,026 INFO L226 Difference]: Without dead ends: 251 [2025-01-09 12:23:44,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2025-01-09 12:23:44,030 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 814 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:23:44,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 491 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:23:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-09 12:23:44,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 132. [2025-01-09 12:23:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 12:23:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 203 transitions. [2025-01-09 12:23:44,067 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 203 transitions. Word has length 163 [2025-01-09 12:23:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:23:44,069 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 203 transitions. [2025-01-09 12:23:44,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:23:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 203 transitions. [2025-01-09 12:23:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 12:23:44,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:23:44,073 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:23:44,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:23:44,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:23:44,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:23:44,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1342728374, now seen corresponding path program 1 times [2025-01-09 12:23:44,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:23:44,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87405634] [2025-01-09 12:23:44,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:23:44,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:23:44,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 12:23:44,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 12:23:44,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:23:44,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:23:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:23:44,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:23:44,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87405634] [2025-01-09 12:23:44,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87405634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:23:44,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:23:44,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:23:44,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969617092] [2025-01-09 12:23:44,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:23:44,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:23:44,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:23:44,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:23:44,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:23:44,246 INFO L87 Difference]: Start difference. First operand 132 states and 203 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:23:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:23:44,304 INFO L93 Difference]: Finished difference Result 237 states and 360 transitions. [2025-01-09 12:23:44,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:23:44,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-01-09 12:23:44,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:23:44,306 INFO L225 Difference]: With dead ends: 237 [2025-01-09 12:23:44,306 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 12:23:44,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:23:44,307 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 42 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:23:44,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 324 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:23:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 12:23:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2025-01-09 12:23:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 105 states have internal predecessors, (135), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:23:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 247 transitions. [2025-01-09 12:23:44,338 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 247 transitions. Word has length 163 [2025-01-09 12:23:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:23:44,339 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 247 transitions. [2025-01-09 12:23:44,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:23:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 247 transitions. [2025-01-09 12:23:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 12:23:44,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:23:44,344 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:23:44,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:23:44,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:23:44,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:23:44,345 INFO L85 PathProgramCache]: Analyzing trace with hash -248636786, now seen corresponding path program 1 times [2025-01-09 12:23:44,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:23:44,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64037947] [2025-01-09 12:23:44,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:23:44,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:23:44,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 12:23:44,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 12:23:44,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:23:44,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:23:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:23:51,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:23:51,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64037947] [2025-01-09 12:23:51,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64037947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:23:51,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:23:51,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:23:51,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389934246] [2025-01-09 12:23:51,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:23:51,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:23:51,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:23:51,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:23:51,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:23:51,143 INFO L87 Difference]: Start difference. First operand 164 states and 247 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:23:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:23:52,663 INFO L93 Difference]: Finished difference Result 306 states and 453 transitions. [2025-01-09 12:23:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:23:52,664 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-01-09 12:23:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:23:52,667 INFO L225 Difference]: With dead ends: 306 [2025-01-09 12:23:52,667 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 12:23:52,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:23:52,668 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 150 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:23:52,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 489 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:23:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 12:23:52,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 115. [2025-01-09 12:23:52,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 83 states have internal predecessors, (110), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 12:23:52,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 170 transitions. [2025-01-09 12:23:52,678 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 170 transitions. Word has length 163 [2025-01-09 12:23:52,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:23:52,679 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 170 transitions. [2025-01-09 12:23:52,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:23:52,679 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 170 transitions. [2025-01-09 12:23:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 12:23:52,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:23:52,680 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:23:52,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:23:52,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:23:52,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:23:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash -691535926, now seen corresponding path program 1 times [2025-01-09 12:23:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:23:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755259627] [2025-01-09 12:23:52,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:23:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:23:52,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 12:23:52,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 12:23:52,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:23:52,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:23:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:23:53,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:23:53,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755259627] [2025-01-09 12:23:53,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755259627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:23:53,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:23:53,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:23:53,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947804905] [2025-01-09 12:23:53,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:23:53,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:23:53,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:23:53,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:23:53,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:23:53,427 INFO L87 Difference]: Start difference. First operand 115 states and 170 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:23:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:23:54,163 INFO L93 Difference]: Finished difference Result 423 states and 625 transitions. [2025-01-09 12:23:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:23:54,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-01-09 12:23:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:23:54,166 INFO L225 Difference]: With dead ends: 423 [2025-01-09 12:23:54,166 INFO L226 Difference]: Without dead ends: 311 [2025-01-09 12:23:54,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:23:54,167 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 423 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:23:54,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 440 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:23:54,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-01-09 12:23:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 168. [2025-01-09 12:23:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 108 states have (on average 1.2962962962962963) internal successors, (140), 109 states have internal predecessors, (140), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:23:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2025-01-09 12:23:54,183 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 163 [2025-01-09 12:23:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:23:54,183 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2025-01-09 12:23:54,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:23:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2025-01-09 12:23:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 12:23:54,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:23:54,184 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:23:54,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:23:54,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:23:54,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:23:54,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1702653176, now seen corresponding path program 1 times [2025-01-09 12:23:54,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:23:54,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937337706] [2025-01-09 12:23:54,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:23:54,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:23:54,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 12:23:54,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 12:23:54,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:23:54,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:23:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:23:54,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:23:54,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937337706] [2025-01-09 12:23:54,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937337706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:23:54,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:23:54,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:23:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502159411] [2025-01-09 12:23:54,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:23:54,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:23:54,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:23:54,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:23:54,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:23:54,566 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:23:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:23:54,865 INFO L93 Difference]: Finished difference Result 333 states and 495 transitions. [2025-01-09 12:23:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 12:23:54,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-01-09 12:23:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:23:54,867 INFO L225 Difference]: With dead ends: 333 [2025-01-09 12:23:54,867 INFO L226 Difference]: Without dead ends: 221 [2025-01-09 12:23:54,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:23:54,868 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 136 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:23:54,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 391 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:23:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-01-09 12:23:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 168. [2025-01-09 12:23:54,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 108 states have (on average 1.2962962962962963) internal successors, (140), 109 states have internal predecessors, (140), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:23:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2025-01-09 12:23:54,895 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 163 [2025-01-09 12:23:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:23:54,895 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2025-01-09 12:23:54,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:23:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2025-01-09 12:23:54,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:23:54,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:23:54,896 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:23:54,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:23:54,896 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:23:54,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:23:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1732067532, now seen corresponding path program 1 times [2025-01-09 12:23:54,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:23:54,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758500644] [2025-01-09 12:23:54,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:23:54,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:23:54,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:23:54,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:23:54,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:23:54,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:24:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:24:00,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:24:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758500644] [2025-01-09 12:24:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758500644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:24:00,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:24:00,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:24:00,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720341127] [2025-01-09 12:24:00,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:24:00,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:24:00,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:24:00,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:24:00,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:24:00,394 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:24:01,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:24:01,609 INFO L93 Difference]: Finished difference Result 480 states and 697 transitions. [2025-01-09 12:24:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 12:24:01,610 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-01-09 12:24:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:24:01,612 INFO L225 Difference]: With dead ends: 480 [2025-01-09 12:24:01,612 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 12:24:01,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2025-01-09 12:24:01,613 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 627 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:24:01,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 530 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:24:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 12:24:01,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 173. [2025-01-09 12:24:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 114 states have internal predecessors, (148), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:24:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2025-01-09 12:24:01,633 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 164 [2025-01-09 12:24:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:24:01,634 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2025-01-09 12:24:01,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:24:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2025-01-09 12:24:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:24:01,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:24:01,635 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:24:01,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:24:01,635 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:24:01,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:24:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1339040522, now seen corresponding path program 1 times [2025-01-09 12:24:01,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:24:01,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264729846] [2025-01-09 12:24:01,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:24:01,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:24:01,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:24:01,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:24:01,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:24:01,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:24:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:24:06,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:24:06,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264729846] [2025-01-09 12:24:06,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264729846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:24:06,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:24:06,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:24:06,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947206049] [2025-01-09 12:24:06,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:24:06,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:24:06,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:24:06,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:24:06,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:24:06,436 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:24:06,996 INFO L93 Difference]: Finished difference Result 420 states and 616 transitions. [2025-01-09 12:24:06,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:24:06,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-01-09 12:24:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:24:06,999 INFO L225 Difference]: With dead ends: 420 [2025-01-09 12:24:06,999 INFO L226 Difference]: Without dead ends: 308 [2025-01-09 12:24:07,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:24:07,000 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 171 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:24:07,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 578 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:24:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-01-09 12:24:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 188. [2025-01-09 12:24:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 128 states have (on average 1.328125) internal successors, (170), 129 states have internal predecessors, (170), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:24:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 282 transitions. [2025-01-09 12:24:07,014 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 282 transitions. Word has length 164 [2025-01-09 12:24:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:24:07,014 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 282 transitions. [2025-01-09 12:24:07,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 282 transitions. [2025-01-09 12:24:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:24:07,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:24:07,015 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:24:07,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:24:07,016 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:24:07,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:24:07,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1861835186, now seen corresponding path program 1 times [2025-01-09 12:24:07,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:24:07,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741154945] [2025-01-09 12:24:07,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:24:07,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:24:07,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:24:07,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:24:07,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:24:07,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:24:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:24:11,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:24:11,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741154945] [2025-01-09 12:24:11,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741154945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:24:11,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:24:11,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:24:11,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366238050] [2025-01-09 12:24:11,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:24:11,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:24:11,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:24:11,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:24:11,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:24:11,877 INFO L87 Difference]: Start difference. First operand 188 states and 282 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:13,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:24:13,100 INFO L93 Difference]: Finished difference Result 478 states and 699 transitions. [2025-01-09 12:24:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 12:24:13,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-01-09 12:24:13,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:24:13,103 INFO L225 Difference]: With dead ends: 478 [2025-01-09 12:24:13,103 INFO L226 Difference]: Without dead ends: 353 [2025-01-09 12:24:13,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-01-09 12:24:13,104 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 435 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:24:13,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 498 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:24:13,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-09 12:24:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 189. [2025-01-09 12:24:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 129 states have (on average 1.3333333333333333) internal successors, (172), 130 states have internal predecessors, (172), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:24:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 284 transitions. [2025-01-09 12:24:13,123 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 284 transitions. Word has length 164 [2025-01-09 12:24:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:24:13,123 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 284 transitions. [2025-01-09 12:24:13,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 284 transitions. [2025-01-09 12:24:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:24:13,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:24:13,125 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:24:13,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:24:13,125 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:24:13,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:24:13,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2040105100, now seen corresponding path program 1 times [2025-01-09 12:24:13,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:24:13,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742451630] [2025-01-09 12:24:13,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:24:13,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:24:13,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:24:13,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:24:13,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:24:13,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:24:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:24:17,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:24:17,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742451630] [2025-01-09 12:24:17,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742451630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:24:17,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:24:17,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:24:17,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851811053] [2025-01-09 12:24:17,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:24:17,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:24:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:24:17,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:24:17,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:24:17,931 INFO L87 Difference]: Start difference. First operand 189 states and 284 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:24:18,936 INFO L93 Difference]: Finished difference Result 419 states and 618 transitions. [2025-01-09 12:24:18,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:24:18,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-01-09 12:24:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:24:18,939 INFO L225 Difference]: With dead ends: 419 [2025-01-09 12:24:18,939 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 12:24:18,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-01-09 12:24:18,940 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 176 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:24:18,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 522 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:24:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 12:24:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 189. [2025-01-09 12:24:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 129 states have (on average 1.3333333333333333) internal successors, (172), 130 states have internal predecessors, (172), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:24:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 284 transitions. [2025-01-09 12:24:18,957 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 284 transitions. Word has length 164 [2025-01-09 12:24:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:24:18,958 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 284 transitions. [2025-01-09 12:24:18,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 284 transitions. [2025-01-09 12:24:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:24:18,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:24:18,959 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:24:18,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:24:18,959 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:24:18,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:24:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash 720950282, now seen corresponding path program 1 times [2025-01-09 12:24:18,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:24:18,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779766370] [2025-01-09 12:24:18,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:24:18,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:24:18,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:24:18,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:24:18,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:24:19,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:24:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:24:23,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:24:23,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779766370] [2025-01-09 12:24:23,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779766370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:24:23,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:24:23,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:24:23,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671677657] [2025-01-09 12:24:23,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:24:23,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:24:23,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:24:23,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:24:23,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:24:23,060 INFO L87 Difference]: Start difference. First operand 189 states and 284 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:24:23,898 INFO L93 Difference]: Finished difference Result 448 states and 654 transitions. [2025-01-09 12:24:23,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:24:23,899 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-01-09 12:24:23,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:24:23,900 INFO L225 Difference]: With dead ends: 448 [2025-01-09 12:24:23,900 INFO L226 Difference]: Without dead ends: 323 [2025-01-09 12:24:23,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:24:23,901 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 211 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:24:23,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 499 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:24:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-01-09 12:24:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 189. [2025-01-09 12:24:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 129 states have (on average 1.3333333333333333) internal successors, (172), 130 states have internal predecessors, (172), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:24:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 284 transitions. [2025-01-09 12:24:23,921 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 284 transitions. Word has length 164 [2025-01-09 12:24:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:24:23,922 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 284 transitions. [2025-01-09 12:24:23,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:23,922 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 284 transitions. [2025-01-09 12:24:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:24:23,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:24:23,923 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:24:23,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:24:23,923 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:24:23,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:24:23,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1422014860, now seen corresponding path program 1 times [2025-01-09 12:24:23,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:24:23,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216764989] [2025-01-09 12:24:23,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:24:23,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:24:23,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:24:23,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:24:23,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:24:23,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:24:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:24:27,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:24:27,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216764989] [2025-01-09 12:24:27,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216764989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:24:27,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:24:27,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:24:27,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469334797] [2025-01-09 12:24:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:24:27,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:24:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:24:27,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:24:27,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:24:27,087 INFO L87 Difference]: Start difference. First operand 189 states and 284 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:27,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:24:27,642 INFO L93 Difference]: Finished difference Result 402 states and 593 transitions. [2025-01-09 12:24:27,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:24:27,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-01-09 12:24:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:24:27,644 INFO L225 Difference]: With dead ends: 402 [2025-01-09 12:24:27,644 INFO L226 Difference]: Without dead ends: 277 [2025-01-09 12:24:27,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:24:27,645 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 281 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:24:27,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 345 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:24:27,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-01-09 12:24:27,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 186. [2025-01-09 12:24:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 126 states have (on average 1.3333333333333333) internal successors, (168), 127 states have internal predecessors, (168), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 12:24:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 280 transitions. [2025-01-09 12:24:27,665 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 280 transitions. Word has length 164 [2025-01-09 12:24:27,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:24:27,666 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 280 transitions. [2025-01-09 12:24:27,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 280 transitions. [2025-01-09 12:24:27,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:24:27,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:24:27,668 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:24:27,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:24:27,668 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:24:27,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:24:27,668 INFO L85 PathProgramCache]: Analyzing trace with hash 452203854, now seen corresponding path program 1 times [2025-01-09 12:24:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:24:27,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976053916] [2025-01-09 12:24:27,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:24:27,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:24:27,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:24:27,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:24:27,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:24:27,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:24:27,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:24:27,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:24:27,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976053916] [2025-01-09 12:24:27,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976053916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:24:27,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:24:27,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:24:27,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151514424] [2025-01-09 12:24:27,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:24:27,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:24:27,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:24:27,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:24:27,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:24:27,807 INFO L87 Difference]: Start difference. First operand 186 states and 280 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:24:27,866 INFO L93 Difference]: Finished difference Result 339 states and 501 transitions. [2025-01-09 12:24:27,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:24:27,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-01-09 12:24:27,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:24:27,868 INFO L225 Difference]: With dead ends: 339 [2025-01-09 12:24:27,868 INFO L226 Difference]: Without dead ends: 213 [2025-01-09 12:24:27,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:24:27,868 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 61 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:24:27,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 333 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:24:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-01-09 12:24:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 173. [2025-01-09 12:24:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 116 states have internal predecessors, (154), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 12:24:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 258 transitions. [2025-01-09 12:24:27,883 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 258 transitions. Word has length 164 [2025-01-09 12:24:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:24:27,883 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 258 transitions. [2025-01-09 12:24:27,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 258 transitions. [2025-01-09 12:24:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:24:27,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:24:27,884 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:24:27,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:24:27,884 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:24:27,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:24:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash 59176844, now seen corresponding path program 1 times [2025-01-09 12:24:27,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:24:27,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318855891] [2025-01-09 12:24:27,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:24:27,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:24:27,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:24:27,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:24:27,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:24:27,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:24:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:24:32,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:24:32,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318855891] [2025-01-09 12:24:32,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318855891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:24:32,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:24:32,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:24:32,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236562039] [2025-01-09 12:24:32,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:24:32,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:24:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:24:32,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:24:32,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:24:32,736 INFO L87 Difference]: Start difference. First operand 173 states and 258 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:24:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:24:34,023 INFO L93 Difference]: Finished difference Result 374 states and 544 transitions. [2025-01-09 12:24:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:24:34,024 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-01-09 12:24:34,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:24:34,025 INFO L225 Difference]: With dead ends: 374 [2025-01-09 12:24:34,025 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 12:24:34,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2025-01-09 12:24:34,026 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 319 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:24:34,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 637 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:24:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 12:24:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 177. [2025-01-09 12:24:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 120 states have (on average 1.325) internal successors, (159), 120 states have internal predecessors, (159), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 12:24:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2025-01-09 12:24:34,046 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 164 [2025-01-09 12:24:34,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:24:34,046 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2025-01-09 12:24:34,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:24:34,047 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2025-01-09 12:24:34,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:24:34,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:24:34,048 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:24:34,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:24:34,048 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:24:34,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:24:34,049 INFO L85 PathProgramCache]: Analyzing trace with hash 760241422, now seen corresponding path program 1 times [2025-01-09 12:24:34,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:24:34,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954620101] [2025-01-09 12:24:34,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:24:34,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:24:34,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:24:34,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:24:34,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:24:34,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:24:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:24:38,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:24:38,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954620101] [2025-01-09 12:24:38,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954620101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:24:38,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:24:38,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:24:38,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292921494] [2025-01-09 12:24:38,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:24:38,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:24:38,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:24:38,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:24:38,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:24:38,596 INFO L87 Difference]: Start difference. First operand 177 states and 263 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:24:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:24:39,788 INFO L93 Difference]: Finished difference Result 363 states and 530 transitions. [2025-01-09 12:24:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 12:24:39,789 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-01-09 12:24:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:24:39,790 INFO L225 Difference]: With dead ends: 363 [2025-01-09 12:24:39,790 INFO L226 Difference]: Without dead ends: 254 [2025-01-09 12:24:39,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2025-01-09 12:24:39,791 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 215 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:24:39,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 713 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:24:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-09 12:24:39,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 177. [2025-01-09 12:24:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 120 states have (on average 1.325) internal successors, (159), 120 states have internal predecessors, (159), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 12:24:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2025-01-09 12:24:39,810 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 164 [2025-01-09 12:24:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:24:39,811 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2025-01-09 12:24:39,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-01-09 12:24:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2025-01-09 12:24:39,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:24:39,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:24:39,812 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:24:39,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 12:24:39,812 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:24:39,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:24:39,813 INFO L85 PathProgramCache]: Analyzing trace with hash -951940406, now seen corresponding path program 1 times [2025-01-09 12:24:39,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:24:39,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629859431] [2025-01-09 12:24:39,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:24:39,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:24:39,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:24:39,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:24:39,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:24:39,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:24:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:24:44,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:24:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629859431] [2025-01-09 12:24:44,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629859431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:24:44,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:24:44,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:24:44,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644593136] [2025-01-09 12:24:44,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:24:44,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:24:44,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:24:44,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:24:44,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:24:44,025 INFO L87 Difference]: Start difference. First operand 177 states and 263 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:44,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:24:44,835 INFO L93 Difference]: Finished difference Result 363 states and 529 transitions. [2025-01-09 12:24:44,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:24:44,835 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-01-09 12:24:44,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:24:44,837 INFO L225 Difference]: With dead ends: 363 [2025-01-09 12:24:44,837 INFO L226 Difference]: Without dead ends: 254 [2025-01-09 12:24:44,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-01-09 12:24:44,841 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 273 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:24:44,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 516 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:24:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-01-09 12:24:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 178. [2025-01-09 12:24:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 121 states have (on average 1.3305785123966942) internal successors, (161), 121 states have internal predecessors, (161), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 12:24:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 265 transitions. [2025-01-09 12:24:44,857 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 265 transitions. Word has length 164 [2025-01-09 12:24:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:24:44,857 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 265 transitions. [2025-01-09 12:24:44,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 265 transitions. [2025-01-09 12:24:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:24:44,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:24:44,859 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:24:44,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 12:24:44,859 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:24:44,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:24:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash -250875828, now seen corresponding path program 1 times [2025-01-09 12:24:44,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:24:44,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694042873] [2025-01-09 12:24:44,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:24:44,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:24:44,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:24:44,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:24:44,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:24:44,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:24:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-01-09 12:24:49,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:24:49,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694042873] [2025-01-09 12:24:49,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694042873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:24:49,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:24:49,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 12:24:49,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137860626] [2025-01-09 12:24:49,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:24:49,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 12:24:49,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:24:49,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 12:24:49,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:24:49,881 INFO L87 Difference]: Start difference. First operand 178 states and 265 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:24:50,546 INFO L93 Difference]: Finished difference Result 347 states and 510 transitions. [2025-01-09 12:24:50,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:24:50,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-01-09 12:24:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:24:50,548 INFO L225 Difference]: With dead ends: 347 [2025-01-09 12:24:50,548 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 12:24:50,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:24:50,549 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 157 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:24:50,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 529 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:24:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 12:24:50,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 176. [2025-01-09 12:24:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 119 states have (on average 1.3361344537815125) internal successors, (159), 119 states have internal predecessors, (159), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 12:24:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 263 transitions. [2025-01-09 12:24:50,566 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 263 transitions. Word has length 164 [2025-01-09 12:24:50,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:24:50,566 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 263 transitions. [2025-01-09 12:24:50,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-01-09 12:24:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 263 transitions. [2025-01-09 12:24:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 12:24:50,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:24:50,567 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:24:50,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 12:24:50,567 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:24:50,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:24:50,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1330871271, now seen corresponding path program 1 times [2025-01-09 12:24:50,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:24:50,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715273095] [2025-01-09 12:24:50,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:24:50,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:24:50,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 12:24:50,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 12:24:50,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:24:50,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat