./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-85.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adaaa37c405e7d679e050e08a9505edbe41bf89f875de14489d406f30fd12a14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:35:58,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:35:59,048 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:35:59,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:35:59,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:35:59,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:35:59,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:35:59,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:35:59,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:35:59,078 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:35:59,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:35:59,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:35:59,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:35:59,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:35:59,079 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:35:59,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:35:59,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:35:59,079 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:35:59,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:35:59,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:35:59,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:35:59,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:35:59,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:35:59,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:35:59,080 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:35:59,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:35:59,081 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:35:59,081 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:35:59,081 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:35:59,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:35:59,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:35:59,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:35:59,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:35:59,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:35:59,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:35:59,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:35:59,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:35:59,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:35:59,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:35:59,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:35:59,082 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:35:59,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:35:59,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:35:59,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:35:59,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:35:59,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:35:59,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:35:59,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:35:59,083 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 -> adaaa37c405e7d679e050e08a9505edbe41bf89f875de14489d406f30fd12a14 [2025-01-09 12:35:59,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:35:59,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:35:59,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:35:59,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:35:59,379 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:35:59,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-85.i [2025-01-09 12:36:00,681 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d9dd8b45/da274ae7b4c045ddad889bd7c0797fb4/FLAG3bc80d319 [2025-01-09 12:36:00,974 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:36:00,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-85.i [2025-01-09 12:36:00,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d9dd8b45/da274ae7b4c045ddad889bd7c0797fb4/FLAG3bc80d319 [2025-01-09 12:36:01,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3d9dd8b45/da274ae7b4c045ddad889bd7c0797fb4 [2025-01-09 12:36:01,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:36:01,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:36:01,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:36:01,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:36:01,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:36:01,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703765b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01, skipping insertion in model container [2025-01-09 12:36:01,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:36:01,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-85.i[917,930] [2025-01-09 12:36:01,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:36:01,229 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:36:01,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-85.i[917,930] [2025-01-09 12:36:01,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:36:01,290 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:36:01,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01 WrapperNode [2025-01-09 12:36:01,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:36:01,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:36:01,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:36:01,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:36:01,297 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:36:01" (1/1) ... [2025-01-09 12:36:01,304 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:36:01" (1/1) ... [2025-01-09 12:36:01,333 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-01-09 12:36:01,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:36:01,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:36:01,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:36:01,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:36:01,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,361 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:36:01,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,376 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:36:01,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:36:01,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:36:01,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:36:01,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01" (1/1) ... [2025-01-09 12:36:01,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:36:01,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:36:01,411 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:36:01,416 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:36:01,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:36:01,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:36:01,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:36:01,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:36:01,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:36:01,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:36:01,503 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:36:01,505 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:36:01,771 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-01-09 12:36:01,772 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:36:01,783 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:36:01,783 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:36:01,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:36:01 BoogieIcfgContainer [2025-01-09 12:36:01,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:36:01,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:36:01,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:36:01,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:36:01,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:36:01" (1/3) ... [2025-01-09 12:36:01,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afd25e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:36:01, skipping insertion in model container [2025-01-09 12:36:01,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:36:01" (2/3) ... [2025-01-09 12:36:01,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afd25e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:36:01, skipping insertion in model container [2025-01-09 12:36:01,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:36:01" (3/3) ... [2025-01-09 12:36:01,793 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-85.i [2025-01-09 12:36:01,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:36:01,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-85.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:36:01,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:36:01,880 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;@673f1cdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:36:01,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:36:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 12:36:01,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:36:01,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:36:01,899 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:36:01,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:36:01,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:36:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash 791117099, now seen corresponding path program 1 times [2025-01-09 12:36:01,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:36:01,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250498265] [2025-01-09 12:36:01,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:36:01,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:36:01,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:36:02,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:36:02,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:36:02,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:36:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 12:36:02,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:36:02,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250498265] [2025-01-09 12:36:02,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250498265] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:36:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400933735] [2025-01-09 12:36:02,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:36:02,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:36:02,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:36:02,186 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:36:02,188 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:36:02,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:36:02,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:36:02,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:36:02,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:36:02,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:36:02,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:36:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 12:36:02,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:36:02,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400933735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:36:02,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:36:02,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:36:02,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233655733] [2025-01-09 12:36:02,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:36:02,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:36:02,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:36:02,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:36:02,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:36:02,420 INFO L87 Difference]: Start difference. First operand has 58 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 12:36:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:36:02,441 INFO L93 Difference]: Finished difference Result 110 states and 192 transitions. [2025-01-09 12:36:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:36:02,443 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 139 [2025-01-09 12:36:02,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:36:02,449 INFO L225 Difference]: With dead ends: 110 [2025-01-09 12:36:02,450 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 12:36:02,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:36:02,455 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:36:02,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:36:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 12:36:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 12:36:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 12:36:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2025-01-09 12:36:02,503 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 139 [2025-01-09 12:36:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:36:02,504 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2025-01-09 12:36:02,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 12:36:02,505 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2025-01-09 12:36:02,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:36:02,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:36:02,512 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:36:02,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:36:02,713 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:36:02,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:36:02,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:36:02,714 INFO L85 PathProgramCache]: Analyzing trace with hash -523542231, now seen corresponding path program 1 times [2025-01-09 12:36:02,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:36:02,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931414391] [2025-01-09 12:36:02,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:36:02,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:36:02,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:36:02,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:36:02,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:36:02,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:36:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:36:09,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:36:09,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931414391] [2025-01-09 12:36:09,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931414391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:36:09,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:36:09,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:36:09,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98436565] [2025-01-09 12:36:09,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:36:09,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:36:09,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:36:09,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:36:09,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:36:09,870 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:36:12,166 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2025-01-09 12:36:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:36:12,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2025-01-09 12:36:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:36:12,169 INFO L225 Difference]: With dead ends: 103 [2025-01-09 12:36:12,169 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 12:36:12,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:36:12,170 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 76 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:36:12,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 435 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:36:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 12:36:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2025-01-09 12:36:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 12:36:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2025-01-09 12:36:12,193 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 139 [2025-01-09 12:36:12,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:36:12,194 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2025-01-09 12:36:12,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2025-01-09 12:36:12,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 12:36:12,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:36:12,197 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:36:12,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:36:12,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:36:12,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:36:12,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1332888857, now seen corresponding path program 1 times [2025-01-09 12:36:12,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:36:12,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922493627] [2025-01-09 12:36:12,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:36:12,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:36:12,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 12:36:12,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 12:36:12,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:36:12,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:36:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:36:17,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:36:17,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922493627] [2025-01-09 12:36:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922493627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:36:17,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:36:17,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:36:17,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621689976] [2025-01-09 12:36:17,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:36:17,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:36:17,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:36:17,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:36:17,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:36:17,971 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:36:19,721 INFO L93 Difference]: Finished difference Result 108 states and 144 transitions. [2025-01-09 12:36:19,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:36:19,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2025-01-09 12:36:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:36:19,723 INFO L225 Difference]: With dead ends: 108 [2025-01-09 12:36:19,723 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 12:36:19,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:36:19,725 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 62 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:36:19,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 464 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:36:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 12:36:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 67. [2025-01-09 12:36:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 40 states have internal predecessors, (46), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 12:36:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2025-01-09 12:36:19,741 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 139 [2025-01-09 12:36:19,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:36:19,741 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2025-01-09 12:36:19,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2025-01-09 12:36:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:36:19,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:36:19,744 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:36:19,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:36:19,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:36:19,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:36:19,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2121038621, now seen corresponding path program 1 times [2025-01-09 12:36:19,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:36:19,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487387104] [2025-01-09 12:36:19,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:36:19,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:36:19,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:36:19,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:36:19,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:36:19,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:36:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:36:26,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:36:26,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487387104] [2025-01-09 12:36:26,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487387104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:36:26,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:36:26,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:36:26,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996786297] [2025-01-09 12:36:26,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:36:26,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:36:26,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:36:26,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:36:26,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:36:26,374 INFO L87 Difference]: Start difference. First operand 67 states and 96 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:36:29,189 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2025-01-09 12:36:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:36:29,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:36:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:36:29,193 INFO L225 Difference]: With dead ends: 135 [2025-01-09 12:36:29,193 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 12:36:29,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:36:29,195 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 158 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:36:29,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 339 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 12:36:29,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 12:36:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2025-01-09 12:36:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.196969696969697) internal successors, (79), 68 states have internal predecessors, (79), 33 states have call successors, (33), 5 states have call predecessors, (33), 5 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 12:36:29,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 145 transitions. [2025-01-09 12:36:29,219 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 145 transitions. Word has length 140 [2025-01-09 12:36:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:36:29,220 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 145 transitions. [2025-01-09 12:36:29,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:29,220 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 145 transitions. [2025-01-09 12:36:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:36:29,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:36:29,222 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:36:29,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:36:29,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:36:29,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:36:29,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2063780319, now seen corresponding path program 1 times [2025-01-09 12:36:29,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:36:29,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24828733] [2025-01-09 12:36:29,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:36:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:36:29,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:36:29,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:36:29,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:36:29,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:36:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:36:34,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:36:34,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24828733] [2025-01-09 12:36:34,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24828733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:36:34,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:36:34,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:36:34,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648290912] [2025-01-09 12:36:34,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:36:34,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:36:34,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:36:34,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:36:34,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:36:34,210 INFO L87 Difference]: Start difference. First operand 105 states and 145 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:36:35,468 INFO L93 Difference]: Finished difference Result 254 states and 337 transitions. [2025-01-09 12:36:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:36:35,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:36:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:36:35,471 INFO L225 Difference]: With dead ends: 254 [2025-01-09 12:36:35,471 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 12:36:35,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:36:35,472 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 77 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:36:35,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 363 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:36:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 12:36:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 103. [2025-01-09 12:36:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 69 states have internal predecessors, (79), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 12:36:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2025-01-09 12:36:35,500 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 140 [2025-01-09 12:36:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:36:35,501 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2025-01-09 12:36:35,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2025-01-09 12:36:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:36:35,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:36:35,503 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:36:35,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:36:35,503 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:36:35,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:36:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1003561797, now seen corresponding path program 1 times [2025-01-09 12:36:35,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:36:35,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132147577] [2025-01-09 12:36:35,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:36:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:36:35,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:36:35,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:36:35,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:36:35,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:36:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:36:41,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:36:41,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132147577] [2025-01-09 12:36:41,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132147577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:36:41,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:36:41,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:36:41,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319745437] [2025-01-09 12:36:41,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:36:41,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:36:41,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:36:41,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:36:41,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:36:41,745 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:36:44,570 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2025-01-09 12:36:44,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:36:44,571 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:36:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:36:44,573 INFO L225 Difference]: With dead ends: 135 [2025-01-09 12:36:44,573 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 12:36:44,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:36:44,574 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 83 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:36:44,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 377 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:36:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 12:36:44,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2025-01-09 12:36:44,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 71 states have internal predecessors, (83), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 12:36:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2025-01-09 12:36:44,602 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 140 [2025-01-09 12:36:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:36:44,602 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2025-01-09 12:36:44,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:44,603 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2025-01-09 12:36:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:36:44,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:36:44,604 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:36:44,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:36:44,606 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:36:44,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:36:44,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1005408839, now seen corresponding path program 1 times [2025-01-09 12:36:44,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:36:44,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314437104] [2025-01-09 12:36:44,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:36:44,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:36:44,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:36:44,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:36:44,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:36:44,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:36:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:36:48,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:36:48,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314437104] [2025-01-09 12:36:48,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314437104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:36:48,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:36:48,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:36:48,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143320797] [2025-01-09 12:36:48,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:36:48,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:36:48,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:36:48,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:36:48,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:36:48,302 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:36:50,061 INFO L93 Difference]: Finished difference Result 137 states and 174 transitions. [2025-01-09 12:36:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:36:50,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:36:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:36:50,063 INFO L225 Difference]: With dead ends: 137 [2025-01-09 12:36:50,063 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 12:36:50,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:36:50,063 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 98 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:36:50,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 496 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:36:50,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 12:36:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 105. [2025-01-09 12:36:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 71 states have internal predecessors, (83), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 12:36:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2025-01-09 12:36:50,088 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 140 [2025-01-09 12:36:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:36:50,089 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2025-01-09 12:36:50,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2025-01-09 12:36:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:36:50,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:36:50,090 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:36:50,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:36:50,091 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:36:50,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:36:50,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1440980251, now seen corresponding path program 1 times [2025-01-09 12:36:50,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:36:50,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718670007] [2025-01-09 12:36:50,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:36:50,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:36:50,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:36:50,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:36:50,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:36:50,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:36:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:36:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:36:55,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718670007] [2025-01-09 12:36:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718670007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:36:55,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:36:55,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:36:55,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954033318] [2025-01-09 12:36:55,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:36:55,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:36:55,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:36:55,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:36:55,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:36:55,985 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:36:58,580 INFO L93 Difference]: Finished difference Result 135 states and 173 transitions. [2025-01-09 12:36:58,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:36:58,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:36:58,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:36:58,581 INFO L225 Difference]: With dead ends: 135 [2025-01-09 12:36:58,581 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 12:36:58,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:36:58,582 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 83 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:36:58,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 483 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 12:36:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 12:36:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2025-01-09 12:36:58,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 71 states have internal predecessors, (83), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 12:36:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2025-01-09 12:36:58,604 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 140 [2025-01-09 12:36:58,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:36:58,604 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2025-01-09 12:36:58,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:36:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2025-01-09 12:36:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:36:58,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:36:58,606 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:36:58,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:36:58,606 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:36:58,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:36:58,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1383721949, now seen corresponding path program 1 times [2025-01-09 12:36:58,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:36:58,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807438199] [2025-01-09 12:36:58,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:36:58,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:36:58,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:36:58,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:36:58,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:36:58,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:37:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:37:02,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:37:02,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807438199] [2025-01-09 12:37:02,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807438199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:37:02,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:37:02,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:37:02,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110799540] [2025-01-09 12:37:02,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:37:02,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:37:02,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:37:02,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:37:02,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:37:02,339 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:37:04,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:37:04,021 INFO L93 Difference]: Finished difference Result 233 states and 306 transitions. [2025-01-09 12:37:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:37:04,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:37:04,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:37:04,023 INFO L225 Difference]: With dead ends: 233 [2025-01-09 12:37:04,023 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 12:37:04,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:37:04,025 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 78 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 12:37:04,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 443 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 12:37:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 12:37:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 89. [2025-01-09 12:37:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 57 states have internal predecessors, (68), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:37:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions. [2025-01-09 12:37:04,042 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 140 [2025-01-09 12:37:04,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:37:04,042 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 122 transitions. [2025-01-09 12:37:04,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:37:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions. [2025-01-09 12:37:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:37:04,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:37:04,044 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:37:04,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:37:04,044 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:37:04,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:37:04,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1683620167, now seen corresponding path program 1 times [2025-01-09 12:37:04,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:37:04,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519835565] [2025-01-09 12:37:04,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:37:04,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:37:04,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:37:04,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:37:04,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:37:04,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:37:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:37:09,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:37:09,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519835565] [2025-01-09 12:37:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519835565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:37:09,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:37:09,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:37:09,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108898786] [2025-01-09 12:37:09,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:37:09,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:37:09,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:37:09,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:37:09,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:37:09,895 INFO L87 Difference]: Start difference. First operand 89 states and 122 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:37:13,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:37:13,697 INFO L93 Difference]: Finished difference Result 137 states and 173 transitions. [2025-01-09 12:37:13,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:37:13,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:37:13,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:37:13,698 INFO L225 Difference]: With dead ends: 137 [2025-01-09 12:37:13,698 INFO L226 Difference]: Without dead ends: 135 [2025-01-09 12:37:13,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:37:13,699 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 73 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:37:13,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 393 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 12:37:13,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-01-09 12:37:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 91. [2025-01-09 12:37:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:37:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2025-01-09 12:37:13,718 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 140 [2025-01-09 12:37:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:37:13,718 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2025-01-09 12:37:13,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:37:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2025-01-09 12:37:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 12:37:13,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:37:13,720 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:37:13,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:37:13,720 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:37:13,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:37:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1685467209, now seen corresponding path program 1 times [2025-01-09 12:37:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:37:13,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44527138] [2025-01-09 12:37:13,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:37:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:37:13,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 12:37:13,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 12:37:13,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:37:13,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:37:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 12:37:17,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:37:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44527138] [2025-01-09 12:37:17,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44527138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:37:17,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:37:17,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:37:17,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774362317] [2025-01-09 12:37:17,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:37:17,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:37:17,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:37:17,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:37:17,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:37:17,041 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:37:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:37:18,990 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2025-01-09 12:37:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 12:37:18,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-01-09 12:37:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:37:18,992 INFO L225 Difference]: With dead ends: 139 [2025-01-09 12:37:18,992 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 12:37:18,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:37:18,993 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 77 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:37:18,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 589 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 12:37:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 12:37:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 84. [2025-01-09 12:37:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 52 states have internal predecessors, (59), 27 states have call successors, (27), 5 states have call predecessors, (27), 5 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 12:37:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2025-01-09 12:37:19,006 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 140 [2025-01-09 12:37:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:37:19,007 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2025-01-09 12:37:19,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 12:37:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2025-01-09 12:37:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 12:37:19,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:37:19,008 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:37:19,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:37:19,008 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:37:19,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:37:19,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1274186037, now seen corresponding path program 1 times [2025-01-09 12:37:19,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:37:19,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181664923] [2025-01-09 12:37:19,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:37:19,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:37:19,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 12:37:19,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 12:37:19,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:37:19,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat