./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p3.c --full-output --architecture 64bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p3.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', 'db87c07dbb7452fd246a98fbd617147a32e88270b5156b64dd08a046f6919e1f']
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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash db87c07dbb7452fd246a98fbd617147a32e88270b5156b64dd08a046f6919e1f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 03:48:24,145 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 03:48:24,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2024-11-07 03:48:24,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 03:48:24,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 03:48:24,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 03:48:24,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 03:48:24,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 03:48:24,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 03:48:24,235 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 03:48:24,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 03:48:24,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 03:48:24,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 03:48:24,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 03:48:24,236 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 03:48:24,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 03:48:24,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 03:48:24,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 03:48:24,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 03:48:24,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 03:48:24,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 03:48:24,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 03:48:24,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 03:48:24,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 03:48:24,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 03:48:24,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 03:48:24,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 03:48:24,238 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 -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db87c07dbb7452fd246a98fbd617147a32e88270b5156b64dd08a046f6919e1f
[2024-11-07 03:48:24,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 03:48:24,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 03:48:24,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 03:48:24,509 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 03:48:24,510 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 03:48:24,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p3.c
[2024-11-07 03:48:25,658 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 03:48:25,857 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 03:48:25,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p3.c
[2024-11-07 03:48:25,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d11297e9f/eb360404d1544909ae7115698b84f92b/FLAG5c3830a02
[2024-11-07 03:48:25,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d11297e9f/eb360404d1544909ae7115698b84f92b
[2024-11-07 03:48:25,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 03:48:25,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 03:48:25,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 03:48:25,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 03:48:25,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 03:48:25,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:48:25" (1/1) ...
[2024-11-07 03:48:25,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541b57e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:25, skipping insertion in model container
[2024-11-07 03:48:25,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:48:25" (1/1) ...
[2024-11-07 03:48:25,915 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 03:48:26,026 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p3.c[1259,1272]
[2024-11-07 03:48:26,092 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 03:48:26,104 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 03:48:26,111 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p3.c[1259,1272]
[2024-11-07 03:48:26,141 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 03:48:26,157 INFO L204 MainTranslator]: Completed translation
[2024-11-07 03:48:26,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26 WrapperNode
[2024-11-07 03:48:26,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 03:48:26,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 03:48:26,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 03:48:26,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 03:48:26,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (1/1) ...
[2024-11-07 03:48:26,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (1/1) ...
[2024-11-07 03:48:26,238 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 428
[2024-11-07 03:48:26,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 03:48:26,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 03:48:26,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 03:48:26,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 03:48:26,246 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (1/1) ...
[2024-11-07 03:48:26,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (1/1) ...
[2024-11-07 03:48:26,258 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (1/1) ...
[2024-11-07 03:48:26,288 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].
[2024-11-07 03:48:26,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (1/1) ...
[2024-11-07 03:48:26,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (1/1) ...
[2024-11-07 03:48:26,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (1/1) ...
[2024-11-07 03:48:26,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (1/1) ...
[2024-11-07 03:48:26,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (1/1) ...
[2024-11-07 03:48:26,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (1/1) ...
[2024-11-07 03:48:26,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 03:48:26,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 03:48:26,339 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 03:48:26,339 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 03:48:26,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (1/1) ...
[2024-11-07 03:48:26,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 03:48:26,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 03:48:26,369 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)
[2024-11-07 03:48:26,376 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
[2024-11-07 03:48:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 03:48:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 03:48:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 03:48:26,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 03:48:26,476 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 03:48:26,477 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 03:48:27,038 INFO L? ?]: Removed 211 outVars from TransFormulas that were not future-live.
[2024-11-07 03:48:27,038 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 03:48:27,045 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 03:48:27,045 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 03:48:27,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:48:27 BoogieIcfgContainer
[2024-11-07 03:48:27,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 03:48:27,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 03:48:27,047 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 03:48:27,051 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 03:48:27,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:48:25" (1/3) ...
[2024-11-07 03:48:27,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebc3731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:48:27, skipping insertion in model container
[2024-11-07 03:48:27,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:48:26" (2/3) ...
[2024-11-07 03:48:27,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebc3731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:48:27, skipping insertion in model container
[2024-11-07 03:48:27,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:48:27" (3/3) ...
[2024-11-07 03:48:27,053 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p3.c
[2024-11-07 03:48:27,063 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 03:48:27,063 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 03:48:27,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 03:48:27,115 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;@1d1ba952, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 03:48:27,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 03:48:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 109 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:27,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2024-11-07 03:48:27,124 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:27,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:27,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:27,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1135438275, now seen corresponding path program 1 times
[2024-11-07 03:48:27,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:27,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107987870]
[2024-11-07 03:48:27,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:27,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:27,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:27,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107987870]
[2024-11-07 03:48:27,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107987870] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:27,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:27,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 03:48:27,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42484992]
[2024-11-07 03:48:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:27,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 03:48:27,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:27,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 03:48:27,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 03:48:27,592 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 109 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:27,637 INFO L93 Difference]: Finished difference Result 201 states and 297 transitions.
[2024-11-07 03:48:27,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 03:48:27,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23
[2024-11-07 03:48:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:27,646 INFO L225 Difference]: With dead ends: 201
[2024-11-07 03:48:27,647 INFO L226 Difference]: Without dead ends: 109
[2024-11-07 03:48:27,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 03:48:27,654 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:27,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 459 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2024-11-07 03:48:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109.
[2024-11-07 03:48:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4722222222222223) internal successors, (159), 108 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions.
[2024-11-07 03:48:27,684 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 23
[2024-11-07 03:48:27,685 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:27,685 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions.
[2024-11-07 03:48:27,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions.
[2024-11-07 03:48:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2024-11-07 03:48:27,687 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:27,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:27,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 03:48:27,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:27,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:27,688 INFO L85 PathProgramCache]: Analyzing trace with hash 840543427, now seen corresponding path program 1 times
[2024-11-07 03:48:27,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:27,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086360346]
[2024-11-07 03:48:27,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:27,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:27,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:27,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086360346]
[2024-11-07 03:48:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086360346] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:27,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:27,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 03:48:27,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011785420]
[2024-11-07 03:48:27,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:27,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 03:48:27,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:27,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 03:48:27,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 03:48:27,843 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:27,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:27,870 INFO L93 Difference]: Finished difference Result 202 states and 295 transitions.
[2024-11-07 03:48:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 03:48:27,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24
[2024-11-07 03:48:27,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:27,873 INFO L225 Difference]: With dead ends: 202
[2024-11-07 03:48:27,873 INFO L226 Difference]: Without dead ends: 111
[2024-11-07 03:48:27,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 03:48:27,873 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:27,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 455 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states.
[2024-11-07 03:48:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111.
[2024-11-07 03:48:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.4636363636363636) internal successors, (161), 110 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions.
[2024-11-07 03:48:27,883 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 24
[2024-11-07 03:48:27,883 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:27,884 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions.
[2024-11-07 03:48:27,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions.
[2024-11-07 03:48:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-11-07 03:48:27,884 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:27,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:27,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 03:48:27,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:27,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash -810923364, now seen corresponding path program 1 times
[2024-11-07 03:48:27,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:27,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523150911]
[2024-11-07 03:48:27,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:27,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:28,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523150911]
[2024-11-07 03:48:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523150911] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:28,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:28,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 03:48:28,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755156077]
[2024-11-07 03:48:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:28,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 03:48:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:28,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 03:48:28,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:48:28,163 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:28,264 INFO L93 Difference]: Finished difference Result 215 states and 313 transitions.
[2024-11-07 03:48:28,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 03:48:28,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25
[2024-11-07 03:48:28,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:28,266 INFO L225 Difference]: With dead ends: 215
[2024-11-07 03:48:28,268 INFO L226 Difference]: Without dead ends: 122
[2024-11-07 03:48:28,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-07 03:48:28,269 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 26 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:28,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 855 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:48:28,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states.
[2024-11-07 03:48:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121.
[2024-11-07 03:48:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.45) internal successors, (174), 120 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 174 transitions.
[2024-11-07 03:48:28,277 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 174 transitions. Word has length 25
[2024-11-07 03:48:28,277 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:28,277 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 174 transitions.
[2024-11-07 03:48:28,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions.
[2024-11-07 03:48:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-07 03:48:28,278 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:28,278 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:28,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 03:48:28,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:28,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1540066410, now seen corresponding path program 1 times
[2024-11-07 03:48:28,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:28,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137735641]
[2024-11-07 03:48:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:28,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:28,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:28,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137735641]
[2024-11-07 03:48:28,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137735641] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:28,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:28,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-07 03:48:28,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983266179]
[2024-11-07 03:48:28,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:28,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 03:48:28,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:28,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 03:48:28,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2024-11-07 03:48:28,529 INFO L87 Difference]: Start difference. First operand 121 states and 174 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:28,682 INFO L93 Difference]: Finished difference Result 297 states and 429 transitions.
[2024-11-07 03:48:28,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-07 03:48:28,684 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26
[2024-11-07 03:48:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:28,685 INFO L225 Difference]: With dead ends: 297
[2024-11-07 03:48:28,685 INFO L226 Difference]: Without dead ends: 204
[2024-11-07 03:48:28,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182
[2024-11-07 03:48:28,685 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 142 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:28,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1106 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:48:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2024-11-07 03:48:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 123.
[2024-11-07 03:48:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.4426229508196722) internal successors, (176), 122 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:28,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions.
[2024-11-07 03:48:28,696 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 26
[2024-11-07 03:48:28,696 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:28,696 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions.
[2024-11-07 03:48:28,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions.
[2024-11-07 03:48:28,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-07 03:48:28,697 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:28,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:28,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 03:48:28,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:28,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:28,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1685236529, now seen corresponding path program 1 times
[2024-11-07 03:48:28,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:28,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217582848]
[2024-11-07 03:48:28,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:28,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:28,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:28,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217582848]
[2024-11-07 03:48:28,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217582848] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:28,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:28,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 03:48:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532859446]
[2024-11-07 03:48:28,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:28,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 03:48:28,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:28,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 03:48:28,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:48:28,847 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:28,929 INFO L93 Difference]: Finished difference Result 299 states and 428 transitions.
[2024-11-07 03:48:28,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 03:48:28,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26
[2024-11-07 03:48:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:28,930 INFO L225 Difference]: With dead ends: 299
[2024-11-07 03:48:28,930 INFO L226 Difference]: Without dead ends: 197
[2024-11-07 03:48:28,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-11-07 03:48:28,931 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 127 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:28,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 832 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:48:28,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states.
[2024-11-07 03:48:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 124.
[2024-11-07 03:48:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 123 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions.
[2024-11-07 03:48:28,942 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 26
[2024-11-07 03:48:28,943 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:28,943 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions.
[2024-11-07 03:48:28,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions.
[2024-11-07 03:48:28,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2024-11-07 03:48:28,943 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:28,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:28,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 03:48:28,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:28,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:28,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1487729941, now seen corresponding path program 1 times
[2024-11-07 03:48:28,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:28,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670394352]
[2024-11-07 03:48:28,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:28,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:29,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:29,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670394352]
[2024-11-07 03:48:29,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670394352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:29,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:29,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 03:48:29,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239678543]
[2024-11-07 03:48:29,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:29,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 03:48:29,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:29,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 03:48:29,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 03:48:29,055 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:29,089 INFO L93 Difference]: Finished difference Result 283 states and 405 transitions.
[2024-11-07 03:48:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 03:48:29,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27
[2024-11-07 03:48:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:29,090 INFO L225 Difference]: With dead ends: 283
[2024-11-07 03:48:29,090 INFO L226 Difference]: Without dead ends: 181
[2024-11-07 03:48:29,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-07 03:48:29,091 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 113 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:29,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 574 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:29,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2024-11-07 03:48:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 120.
[2024-11-07 03:48:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions.
[2024-11-07 03:48:29,103 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 27
[2024-11-07 03:48:29,103 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:29,103 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions.
[2024-11-07 03:48:29,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:29,103 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions.
[2024-11-07 03:48:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2024-11-07 03:48:29,104 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:29,104 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:29,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 03:48:29,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:29,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:29,105 INFO L85 PathProgramCache]: Analyzing trace with hash -294429514, now seen corresponding path program 1 times
[2024-11-07 03:48:29,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:29,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680130040]
[2024-11-07 03:48:29,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:29,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:29,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:29,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680130040]
[2024-11-07 03:48:29,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680130040] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:29,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:29,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 03:48:29,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031592805]
[2024-11-07 03:48:29,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:29,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 03:48:29,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:29,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 03:48:29,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:48:29,451 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:29,535 INFO L93 Difference]: Finished difference Result 277 states and 399 transitions.
[2024-11-07 03:48:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 03:48:29,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71
[2024-11-07 03:48:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:29,537 INFO L225 Difference]: With dead ends: 277
[2024-11-07 03:48:29,537 INFO L226 Difference]: Without dead ends: 184
[2024-11-07 03:48:29,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-11-07 03:48:29,538 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 116 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:29,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 859 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2024-11-07 03:48:29,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 137.
[2024-11-07 03:48:29,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.411764705882353) internal successors, (192), 136 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions.
[2024-11-07 03:48:29,546 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 71
[2024-11-07 03:48:29,547 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:29,547 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions.
[2024-11-07 03:48:29,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions.
[2024-11-07 03:48:29,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73
[2024-11-07 03:48:29,548 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:29,548 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:29,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 03:48:29,549 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:29,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash -381187736, now seen corresponding path program 1 times
[2024-11-07 03:48:29,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:29,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842891955]
[2024-11-07 03:48:29,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:29,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:29,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:29,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842891955]
[2024-11-07 03:48:29,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842891955] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:29,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:29,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-07 03:48:29,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161311483]
[2024-11-07 03:48:29,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:29,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 03:48:29,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:29,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 03:48:29,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-11-07 03:48:29,979 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:30,121 INFO L93 Difference]: Finished difference Result 289 states and 415 transitions.
[2024-11-07 03:48:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-07 03:48:30,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72
[2024-11-07 03:48:30,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:30,122 INFO L225 Difference]: With dead ends: 289
[2024-11-07 03:48:30,122 INFO L226 Difference]: Without dead ends: 196
[2024-11-07 03:48:30,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182
[2024-11-07 03:48:30,123 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 111 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:30,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 972 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:48:30,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2024-11-07 03:48:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 155.
[2024-11-07 03:48:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4090909090909092) internal successors, (217), 154 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 217 transitions.
[2024-11-07 03:48:30,129 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 217 transitions. Word has length 72
[2024-11-07 03:48:30,129 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:30,129 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 217 transitions.
[2024-11-07 03:48:30,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:30,129 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 217 transitions.
[2024-11-07 03:48:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2024-11-07 03:48:30,130 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:30,131 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:30,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 03:48:30,131 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:30,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:30,131 INFO L85 PathProgramCache]: Analyzing trace with hash -918316270, now seen corresponding path program 1 times
[2024-11-07 03:48:30,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:30,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466650820]
[2024-11-07 03:48:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:30,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:30,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:30,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466650820]
[2024-11-07 03:48:30,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466650820] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 03:48:30,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635261534]
[2024-11-07 03:48:30,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:30,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:48:30,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 03:48:30,550 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)
[2024-11-07 03:48:30,552 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
[2024-11-07 03:48:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:30,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 37 conjuncts are in the unsatisfiable core
[2024-11-07 03:48:30,738 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:48:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:31,003 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 03:48:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635261534] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 03:48:31,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 03:48:31,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27
[2024-11-07 03:48:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327789530]
[2024-11-07 03:48:31,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 03:48:31,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-11-07 03:48:31,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:31,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-11-07 03:48:31,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702
[2024-11-07 03:48:31,455 INFO L87 Difference]: Start difference. First operand 155 states and 217 transitions. Second operand has 27 states, 27 states have (on average 7.518518518518518) internal successors, (203), 27 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:32,127 INFO L93 Difference]: Finished difference Result 402 states and 581 transitions.
[2024-11-07 03:48:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2024-11-07 03:48:32,128 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.518518518518518) internal successors, (203), 27 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73
[2024-11-07 03:48:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:32,129 INFO L225 Difference]: With dead ends: 402
[2024-11-07 03:48:32,130 INFO L226 Difference]: Without dead ends: 309
[2024-11-07 03:48:32,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=1824, Unknown=0, NotChecked=0, Total=2070
[2024-11-07 03:48:32,132 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 472 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:32,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 2476 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 03:48:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states.
[2024-11-07 03:48:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304.
[2024-11-07 03:48:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.4158415841584158) internal successors, (429), 303 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:32,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 429 transitions.
[2024-11-07 03:48:32,142 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 429 transitions. Word has length 73
[2024-11-07 03:48:32,142 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:32,142 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 429 transitions.
[2024-11-07 03:48:32,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.518518518518518) internal successors, (203), 27 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 429 transitions.
[2024-11-07 03:48:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2024-11-07 03:48:32,145 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:32,146 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:32,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 03:48:32,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:48:32,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:32,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:32,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2141902503, now seen corresponding path program 1 times
[2024-11-07 03:48:32,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:32,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589572371]
[2024-11-07 03:48:32,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:32,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:32,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589572371]
[2024-11-07 03:48:32,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589572371] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:32,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:32,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-07 03:48:32,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516000556]
[2024-11-07 03:48:32,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:32,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-07 03:48:32,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:32,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-07 03:48:32,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2024-11-07 03:48:32,973 INFO L87 Difference]: Start difference. First operand 304 states and 429 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:33,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:33,185 INFO L93 Difference]: Finished difference Result 896 states and 1283 transitions.
[2024-11-07 03:48:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-11-07 03:48:33,186 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75
[2024-11-07 03:48:33,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:33,188 INFO L225 Difference]: With dead ends: 896
[2024-11-07 03:48:33,188 INFO L226 Difference]: Without dead ends: 654
[2024-11-07 03:48:33,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306
[2024-11-07 03:48:33,188 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 154 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:33,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 2152 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:48:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states.
[2024-11-07 03:48:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 420.
[2024-11-07 03:48:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4200477326968974) internal successors, (595), 419 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 595 transitions.
[2024-11-07 03:48:33,198 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 595 transitions. Word has length 75
[2024-11-07 03:48:33,198 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:33,198 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 595 transitions.
[2024-11-07 03:48:33,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 595 transitions.
[2024-11-07 03:48:33,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2024-11-07 03:48:33,199 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:33,199 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:33,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 03:48:33,199 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:33,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:33,200 INFO L85 PathProgramCache]: Analyzing trace with hash 637726711, now seen corresponding path program 1 times
[2024-11-07 03:48:33,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:33,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704750055]
[2024-11-07 03:48:33,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:33,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:33,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:33,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704750055]
[2024-11-07 03:48:33,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704750055] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:33,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:33,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-07 03:48:33,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833338347]
[2024-11-07 03:48:33,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:33,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-07 03:48:33,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:33,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-07 03:48:33,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2024-11-07 03:48:33,687 INFO L87 Difference]: Start difference. First operand 420 states and 595 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:33,869 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions.
[2024-11-07 03:48:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 03:48:33,870 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75
[2024-11-07 03:48:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:33,871 INFO L225 Difference]: With dead ends: 842
[2024-11-07 03:48:33,872 INFO L226 Difference]: Without dead ends: 484
[2024-11-07 03:48:33,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272
[2024-11-07 03:48:33,873 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 120 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:33,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1218 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:48:33,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states.
[2024-11-07 03:48:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 464.
[2024-11-07 03:48:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.4190064794816415) internal successors, (657), 463 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 657 transitions.
[2024-11-07 03:48:33,903 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 657 transitions. Word has length 75
[2024-11-07 03:48:33,903 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:33,903 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 657 transitions.
[2024-11-07 03:48:33,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:33,903 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 657 transitions.
[2024-11-07 03:48:33,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76
[2024-11-07 03:48:33,904 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:33,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:33,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-07 03:48:33,904 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:33,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:33,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1735322176, now seen corresponding path program 1 times
[2024-11-07 03:48:33,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:33,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798310693]
[2024-11-07 03:48:33,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:34,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:34,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798310693]
[2024-11-07 03:48:34,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798310693] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:34,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:34,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 03:48:34,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870240040]
[2024-11-07 03:48:34,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:34,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 03:48:34,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:34,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 03:48:34,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 03:48:34,035 INFO L87 Difference]: Start difference. First operand 464 states and 657 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:34,071 INFO L93 Difference]: Finished difference Result 859 states and 1221 transitions.
[2024-11-07 03:48:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 03:48:34,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75
[2024-11-07 03:48:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:34,073 INFO L225 Difference]: With dead ends: 859
[2024-11-07 03:48:34,073 INFO L226 Difference]: Without dead ends: 479
[2024-11-07 03:48:34,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-07 03:48:34,074 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 74 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:34,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 561 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states.
[2024-11-07 03:48:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 459.
[2024-11-07 03:48:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.4126637554585153) internal successors, (647), 458 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 647 transitions.
[2024-11-07 03:48:34,089 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 647 transitions. Word has length 75
[2024-11-07 03:48:34,089 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:34,089 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 647 transitions.
[2024-11-07 03:48:34,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 647 transitions.
[2024-11-07 03:48:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2024-11-07 03:48:34,090 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:34,090 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:34,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-07 03:48:34,090 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:34,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:34,090 INFO L85 PathProgramCache]: Analyzing trace with hash 848106007, now seen corresponding path program 1 times
[2024-11-07 03:48:34,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:34,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483250552]
[2024-11-07 03:48:34,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:34,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:34,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:34,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483250552]
[2024-11-07 03:48:34,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483250552] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 03:48:34,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094647680]
[2024-11-07 03:48:34,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:34,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:48:34,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 03:48:34,449 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 03:48:34,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-07 03:48:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:34,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 03:48:34,603 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:48:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:34,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 03:48:34,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094647680] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:34,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 03:48:34,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13
[2024-11-07 03:48:34,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350339369]
[2024-11-07 03:48:34,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:34,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 03:48:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:34,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 03:48:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156
[2024-11-07 03:48:34,651 INFO L87 Difference]: Start difference. First operand 459 states and 647 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:34,665 INFO L93 Difference]: Finished difference Result 841 states and 1192 transitions.
[2024-11-07 03:48:34,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 03:48:34,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76
[2024-11-07 03:48:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:34,667 INFO L225 Difference]: With dead ends: 841
[2024-11-07 03:48:34,667 INFO L226 Difference]: Without dead ends: 459
[2024-11-07 03:48:34,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156
[2024-11-07 03:48:34,670 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 2 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:34,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 301 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states.
[2024-11-07 03:48:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459.
[2024-11-07 03:48:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.3995633187772927) internal successors, (641), 458 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 641 transitions.
[2024-11-07 03:48:34,680 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 641 transitions. Word has length 76
[2024-11-07 03:48:34,680 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:34,680 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 641 transitions.
[2024-11-07 03:48:34,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 641 transitions.
[2024-11-07 03:48:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2024-11-07 03:48:34,681 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:34,681 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:34,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-07 03:48:34,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:48:34,882 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:34,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:34,882 INFO L85 PathProgramCache]: Analyzing trace with hash -12892934, now seen corresponding path program 1 times
[2024-11-07 03:48:34,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:34,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768939193]
[2024-11-07 03:48:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:34,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-07 03:48:35,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:35,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768939193]
[2024-11-07 03:48:35,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768939193] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 03:48:35,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314049573]
[2024-11-07 03:48:35,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:35,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:48:35,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 03:48:35,263 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 03:48:35,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-07 03:48:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:35,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 65 conjuncts are in the unsatisfiable core
[2024-11-07 03:48:35,423 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:48:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:35,795 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 03:48:36,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:36,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314049573] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 03:48:36,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 03:48:36,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 18] total 42
[2024-11-07 03:48:36,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618133534]
[2024-11-07 03:48:36,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 03:48:36,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-11-07 03:48:36,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:36,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-11-07 03:48:36,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1595, Unknown=0, NotChecked=0, Total=1722
[2024-11-07 03:48:36,563 INFO L87 Difference]: Start difference. First operand 459 states and 641 transitions. Second operand has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:37,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:37,415 INFO L93 Difference]: Finished difference Result 1555 states and 2194 transitions.
[2024-11-07 03:48:37,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2024-11-07 03:48:37,416 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2024-11-07 03:48:37,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:37,419 INFO L225 Difference]: With dead ends: 1555
[2024-11-07 03:48:37,419 INFO L226 Difference]: Without dead ends: 1149
[2024-11-07 03:48:37,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=287, Invalid=3373, Unknown=0, NotChecked=0, Total=3660
[2024-11-07 03:48:37,422 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 515 mSDsluCounter, 3914 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 4043 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:37,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 4043 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 03:48:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states.
[2024-11-07 03:48:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 849.
[2024-11-07 03:48:37,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 848 states have (on average 1.3950471698113207) internal successors, (1183), 848 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1183 transitions.
[2024-11-07 03:48:37,446 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1183 transitions. Word has length 77
[2024-11-07 03:48:37,446 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:37,447 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1183 transitions.
[2024-11-07 03:48:37,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.785714285714286) internal successors, (201), 42 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1183 transitions.
[2024-11-07 03:48:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2024-11-07 03:48:37,449 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:37,450 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:37,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-07 03:48:37,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:48:37,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:37,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:37,652 INFO L85 PathProgramCache]: Analyzing trace with hash -976199200, now seen corresponding path program 1 times
[2024-11-07 03:48:37,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:37,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085933125]
[2024-11-07 03:48:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:37,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:37,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:37,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085933125]
[2024-11-07 03:48:37,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085933125] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:37,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:37,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 03:48:37,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450709298]
[2024-11-07 03:48:37,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:37,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 03:48:37,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:37,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 03:48:37,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:48:37,826 INFO L87 Difference]: Start difference. First operand 849 states and 1183 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:37,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:37,874 INFO L93 Difference]: Finished difference Result 1651 states and 2330 transitions.
[2024-11-07 03:48:37,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 03:48:37,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2024-11-07 03:48:37,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:37,878 INFO L225 Difference]: With dead ends: 1651
[2024-11-07 03:48:37,878 INFO L226 Difference]: Without dead ends: 953
[2024-11-07 03:48:37,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:48:37,880 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 62 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:37,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 839 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:37,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states.
[2024-11-07 03:48:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953.
[2024-11-07 03:48:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 952 states have (on average 1.39390756302521) internal successors, (1327), 952 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1327 transitions.
[2024-11-07 03:48:37,898 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1327 transitions. Word has length 77
[2024-11-07 03:48:37,898 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:37,898 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1327 transitions.
[2024-11-07 03:48:37,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:37,898 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1327 transitions.
[2024-11-07 03:48:37,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2024-11-07 03:48:37,899 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:37,899 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:37,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-07 03:48:37,900 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:37,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:37,900 INFO L85 PathProgramCache]: Analyzing trace with hash -532765172, now seen corresponding path program 1 times
[2024-11-07 03:48:37,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:37,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747756606]
[2024-11-07 03:48:37,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:37,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:38,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:38,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747756606]
[2024-11-07 03:48:38,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747756606] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:38,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:38,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2024-11-07 03:48:38,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475219901]
[2024-11-07 03:48:38,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:38,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-07 03:48:38,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:38,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-07 03:48:38,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240
[2024-11-07 03:48:38,518 INFO L87 Difference]: Start difference. First operand 953 states and 1327 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:38,922 INFO L93 Difference]: Finished difference Result 1703 states and 2386 transitions.
[2024-11-07 03:48:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-07 03:48:38,923 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2024-11-07 03:48:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:38,927 INFO L225 Difference]: With dead ends: 1703
[2024-11-07 03:48:38,928 INFO L226 Difference]: Without dead ends: 981
[2024-11-07 03:48:38,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552
[2024-11-07 03:48:38,930 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 144 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:38,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1723 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 03:48:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states.
[2024-11-07 03:48:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 977.
[2024-11-07 03:48:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.3924180327868851) internal successors, (1359), 976 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1359 transitions.
[2024-11-07 03:48:38,953 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1359 transitions. Word has length 77
[2024-11-07 03:48:38,954 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:38,954 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1359 transitions.
[2024-11-07 03:48:38,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1359 transitions.
[2024-11-07 03:48:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2024-11-07 03:48:38,955 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:38,955 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:38,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-07 03:48:38,955 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:38,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:38,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1079905829, now seen corresponding path program 1 times
[2024-11-07 03:48:38,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:38,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947024905]
[2024-11-07 03:48:38,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:38,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:39,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:39,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947024905]
[2024-11-07 03:48:39,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947024905] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:39,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:39,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 03:48:39,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329785147]
[2024-11-07 03:48:39,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:39,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 03:48:39,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:39,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 03:48:39,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 03:48:39,096 INFO L87 Difference]: Start difference. First operand 977 states and 1359 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:39,124 INFO L93 Difference]: Finished difference Result 1775 states and 2478 transitions.
[2024-11-07 03:48:39,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 03:48:39,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2024-11-07 03:48:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:39,127 INFO L225 Difference]: With dead ends: 1775
[2024-11-07 03:48:39,127 INFO L226 Difference]: Without dead ends: 945
[2024-11-07 03:48:39,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-07 03:48:39,129 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 65 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:39,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 570 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states.
[2024-11-07 03:48:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945.
[2024-11-07 03:48:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 1.3845338983050848) internal successors, (1307), 944 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1307 transitions.
[2024-11-07 03:48:39,146 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1307 transitions. Word has length 77
[2024-11-07 03:48:39,146 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:39,146 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1307 transitions.
[2024-11-07 03:48:39,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1307 transitions.
[2024-11-07 03:48:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2024-11-07 03:48:39,147 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:39,147 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:39,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-07 03:48:39,147 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:39,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash -732527509, now seen corresponding path program 1 times
[2024-11-07 03:48:39,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:39,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956750613]
[2024-11-07 03:48:39,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:39,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:39,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:39,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956750613]
[2024-11-07 03:48:39,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956750613] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:39,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:39,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 03:48:39,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434187117]
[2024-11-07 03:48:39,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:39,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 03:48:39,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:39,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 03:48:39,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 03:48:39,268 INFO L87 Difference]: Start difference. First operand 945 states and 1307 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:39,321 INFO L93 Difference]: Finished difference Result 1723 states and 2398 transitions.
[2024-11-07 03:48:39,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 03:48:39,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77
[2024-11-07 03:48:39,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:39,323 INFO L225 Difference]: With dead ends: 1723
[2024-11-07 03:48:39,324 INFO L226 Difference]: Without dead ends: 849
[2024-11-07 03:48:39,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-07 03:48:39,325 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 65 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:39,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 558 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:39,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states.
[2024-11-07 03:48:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849.
[2024-11-07 03:48:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 848 states have (on average 1.392688679245283) internal successors, (1181), 848 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1181 transitions.
[2024-11-07 03:48:39,337 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1181 transitions. Word has length 77
[2024-11-07 03:48:39,337 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:39,337 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1181 transitions.
[2024-11-07 03:48:39,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1181 transitions.
[2024-11-07 03:48:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2024-11-07 03:48:39,338 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:39,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:39,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-07 03:48:39,339 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:39,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:39,339 INFO L85 PathProgramCache]: Analyzing trace with hash 511191027, now seen corresponding path program 1 times
[2024-11-07 03:48:39,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:39,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763812890]
[2024-11-07 03:48:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:39,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:39,467 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:39,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763812890]
[2024-11-07 03:48:39,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763812890] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:39,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:39,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 03:48:39,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018187669]
[2024-11-07 03:48:39,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:39,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 03:48:39,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:39,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 03:48:39,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:48:39,469 INFO L87 Difference]: Start difference. First operand 849 states and 1181 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:39,522 INFO L93 Difference]: Finished difference Result 1575 states and 2204 transitions.
[2024-11-07 03:48:39,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 03:48:39,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78
[2024-11-07 03:48:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:39,525 INFO L225 Difference]: With dead ends: 1575
[2024-11-07 03:48:39,525 INFO L226 Difference]: Without dead ends: 853
[2024-11-07 03:48:39,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:48:39,526 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 48 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:39,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 821 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:39,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states.
[2024-11-07 03:48:39,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 851.
[2024-11-07 03:48:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.3870588235294117) internal successors, (1179), 850 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:39,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1179 transitions.
[2024-11-07 03:48:39,540 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1179 transitions. Word has length 78
[2024-11-07 03:48:39,540 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:39,540 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1179 transitions.
[2024-11-07 03:48:39,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:39,540 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1179 transitions.
[2024-11-07 03:48:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2024-11-07 03:48:39,541 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:39,541 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:39,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-07 03:48:39,542 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:39,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:39,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1932179732, now seen corresponding path program 1 times
[2024-11-07 03:48:39,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:39,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068681570]
[2024-11-07 03:48:39,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:39,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:39,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:39,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068681570]
[2024-11-07 03:48:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068681570] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:39,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-07 03:48:39,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81443695]
[2024-11-07 03:48:39,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:39,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-07 03:48:39,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:39,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-07 03:48:39,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2024-11-07 03:48:39,840 INFO L87 Difference]: Start difference. First operand 851 states and 1179 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:39,939 INFO L93 Difference]: Finished difference Result 1569 states and 2190 transitions.
[2024-11-07 03:48:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-07 03:48:39,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78
[2024-11-07 03:48:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:39,942 INFO L225 Difference]: With dead ends: 1569
[2024-11-07 03:48:39,942 INFO L226 Difference]: Without dead ends: 855
[2024-11-07 03:48:39,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2024-11-07 03:48:39,944 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 55 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:39,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1139 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:48:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states.
[2024-11-07 03:48:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 849.
[2024-11-07 03:48:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 848 states have (on average 1.383254716981132) internal successors, (1173), 848 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1173 transitions.
[2024-11-07 03:48:39,960 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1173 transitions. Word has length 78
[2024-11-07 03:48:39,960 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:39,960 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1173 transitions.
[2024-11-07 03:48:39,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:39,961 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1173 transitions.
[2024-11-07 03:48:39,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2024-11-07 03:48:39,961 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:39,961 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:39,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-11-07 03:48:39,962 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:39,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:39,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1836513061, now seen corresponding path program 1 times
[2024-11-07 03:48:39,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:39,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632182724]
[2024-11-07 03:48:39,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:40,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:40,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632182724]
[2024-11-07 03:48:40,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632182724] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:40,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:40,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 03:48:40,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260345541]
[2024-11-07 03:48:40,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:40,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 03:48:40,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:40,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 03:48:40,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:48:40,134 INFO L87 Difference]: Start difference. First operand 849 states and 1173 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:40,177 INFO L93 Difference]: Finished difference Result 1732 states and 2404 transitions.
[2024-11-07 03:48:40,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 03:48:40,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78
[2024-11-07 03:48:40,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:40,180 INFO L225 Difference]: With dead ends: 1732
[2024-11-07 03:48:40,180 INFO L226 Difference]: Without dead ends: 922
[2024-11-07 03:48:40,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:48:40,182 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 9 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:40,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 872 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states.
[2024-11-07 03:48:40,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 917.
[2024-11-07 03:48:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 916 states have (on average 1.3820960698689957) internal successors, (1266), 916 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1266 transitions.
[2024-11-07 03:48:40,198 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1266 transitions. Word has length 78
[2024-11-07 03:48:40,198 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:40,198 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1266 transitions.
[2024-11-07 03:48:40,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1266 transitions.
[2024-11-07 03:48:40,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2024-11-07 03:48:40,199 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:40,199 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:40,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-11-07 03:48:40,199 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:40,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:40,200 INFO L85 PathProgramCache]: Analyzing trace with hash -360021799, now seen corresponding path program 1 times
[2024-11-07 03:48:40,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:40,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618180327]
[2024-11-07 03:48:40,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:40,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:40,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:40,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:40,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618180327]
[2024-11-07 03:48:40,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618180327] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:40,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:40,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-07 03:48:40,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843488369]
[2024-11-07 03:48:40,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:40,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-07 03:48:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:40,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-07 03:48:40,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-11-07 03:48:40,563 INFO L87 Difference]: Start difference. First operand 917 states and 1266 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:40,719 INFO L93 Difference]: Finished difference Result 1671 states and 2329 transitions.
[2024-11-07 03:48:40,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-07 03:48:40,719 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2024-11-07 03:48:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:40,721 INFO L225 Difference]: With dead ends: 1671
[2024-11-07 03:48:40,722 INFO L226 Difference]: Without dead ends: 901
[2024-11-07 03:48:40,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306
[2024-11-07 03:48:40,723 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 86 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:40,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1075 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:48:40,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states.
[2024-11-07 03:48:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 899.
[2024-11-07 03:48:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 1.3830734966592428) internal successors, (1242), 898 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1242 transitions.
[2024-11-07 03:48:40,736 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1242 transitions. Word has length 79
[2024-11-07 03:48:40,736 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:40,736 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1242 transitions.
[2024-11-07 03:48:40,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1242 transitions.
[2024-11-07 03:48:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2024-11-07 03:48:40,737 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:40,737 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:40,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-11-07 03:48:40,737 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:40,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash 253785349, now seen corresponding path program 1 times
[2024-11-07 03:48:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:40,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889433471]
[2024-11-07 03:48:40,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:40,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:40,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:40,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889433471]
[2024-11-07 03:48:40,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889433471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:40,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:40,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-07 03:48:40,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613847251]
[2024-11-07 03:48:40,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:40,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 03:48:40,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:40,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 03:48:40,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-07 03:48:40,987 INFO L87 Difference]: Start difference. First operand 899 states and 1242 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:41,042 INFO L93 Difference]: Finished difference Result 1653 states and 2307 transitions.
[2024-11-07 03:48:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-07 03:48:41,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2024-11-07 03:48:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:41,045 INFO L225 Difference]: With dead ends: 1653
[2024-11-07 03:48:41,045 INFO L226 Difference]: Without dead ends: 905
[2024-11-07 03:48:41,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-07 03:48:41,048 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 52 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:41,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 812 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states.
[2024-11-07 03:48:41,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 903.
[2024-11-07 03:48:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 902 states have (on average 1.3813747228381374) internal successors, (1246), 902 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1246 transitions.
[2024-11-07 03:48:41,062 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1246 transitions. Word has length 79
[2024-11-07 03:48:41,062 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:41,062 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1246 transitions.
[2024-11-07 03:48:41,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1246 transitions.
[2024-11-07 03:48:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2024-11-07 03:48:41,063 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:41,063 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:41,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-11-07 03:48:41,064 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:41,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1820180491, now seen corresponding path program 1 times
[2024-11-07 03:48:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:41,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986563682]
[2024-11-07 03:48:41,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:41,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:41,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:41,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986563682]
[2024-11-07 03:48:41,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986563682] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:41,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:41,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2024-11-07 03:48:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242132011]
[2024-11-07 03:48:41,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-07 03:48:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:41,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-07 03:48:41,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182
[2024-11-07 03:48:41,367 INFO L87 Difference]: Start difference. First operand 903 states and 1246 transitions. Second operand has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:41,621 INFO L93 Difference]: Finished difference Result 1725 states and 2389 transitions.
[2024-11-07 03:48:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-11-07 03:48:41,622 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2024-11-07 03:48:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:41,624 INFO L225 Difference]: With dead ends: 1725
[2024-11-07 03:48:41,624 INFO L226 Difference]: Without dead ends: 927
[2024-11-07 03:48:41,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506
[2024-11-07 03:48:41,626 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 145 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:41,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1561 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:48:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states.
[2024-11-07 03:48:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 925.
[2024-11-07 03:48:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 1.3766233766233766) internal successors, (1272), 924 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1272 transitions.
[2024-11-07 03:48:41,639 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1272 transitions. Word has length 79
[2024-11-07 03:48:41,639 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:41,639 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1272 transitions.
[2024-11-07 03:48:41,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 14 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1272 transitions.
[2024-11-07 03:48:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2024-11-07 03:48:41,640 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:41,640 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:41,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-11-07 03:48:41,640 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:41,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:41,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1630624354, now seen corresponding path program 1 times
[2024-11-07 03:48:41,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:41,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804544305]
[2024-11-07 03:48:41,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:41,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:41,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:41,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804544305]
[2024-11-07 03:48:41,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804544305] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:41,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:41,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 03:48:41,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981062761]
[2024-11-07 03:48:41,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:41,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 03:48:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:41,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 03:48:41,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 03:48:41,759 INFO L87 Difference]: Start difference. First operand 925 states and 1272 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:41,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:41,795 INFO L93 Difference]: Finished difference Result 1780 states and 2451 transitions.
[2024-11-07 03:48:41,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 03:48:41,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2024-11-07 03:48:41,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:41,797 INFO L225 Difference]: With dead ends: 1780
[2024-11-07 03:48:41,798 INFO L226 Difference]: Without dead ends: 907
[2024-11-07 03:48:41,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-07 03:48:41,799 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 63 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:41,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 557 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states.
[2024-11-07 03:48:41,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 907.
[2024-11-07 03:48:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 1.3730684326710816) internal successors, (1244), 906 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1244 transitions.
[2024-11-07 03:48:41,824 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1244 transitions. Word has length 79
[2024-11-07 03:48:41,824 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:41,824 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1244 transitions.
[2024-11-07 03:48:41,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1244 transitions.
[2024-11-07 03:48:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2024-11-07 03:48:41,827 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:41,828 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:41,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-11-07 03:48:41,828 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:41,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:41,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1316786568, now seen corresponding path program 1 times
[2024-11-07 03:48:41,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:41,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766106085]
[2024-11-07 03:48:41,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:41,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:41,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:41,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766106085]
[2024-11-07 03:48:41,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766106085] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:41,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:41,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 03:48:41,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609253753]
[2024-11-07 03:48:41,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:41,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 03:48:41,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:41,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 03:48:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 03:48:41,939 INFO L87 Difference]: Start difference. First operand 907 states and 1244 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:41,965 INFO L93 Difference]: Finished difference Result 1766 states and 2427 transitions.
[2024-11-07 03:48:41,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 03:48:41,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2024-11-07 03:48:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:41,968 INFO L225 Difference]: With dead ends: 1766
[2024-11-07 03:48:41,968 INFO L226 Difference]: Without dead ends: 902
[2024-11-07 03:48:41,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-07 03:48:41,969 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 70 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:41,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 565 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states.
[2024-11-07 03:48:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902.
[2024-11-07 03:48:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.3706992230854607) internal successors, (1235), 901 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1235 transitions.
[2024-11-07 03:48:41,984 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1235 transitions. Word has length 79
[2024-11-07 03:48:41,984 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:41,985 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1235 transitions.
[2024-11-07 03:48:41,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1235 transitions.
[2024-11-07 03:48:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2024-11-07 03:48:41,985 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:41,985 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:41,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-11-07 03:48:41,985 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:41,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:41,986 INFO L85 PathProgramCache]: Analyzing trace with hash 162259169, now seen corresponding path program 1 times
[2024-11-07 03:48:41,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:41,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105211351]
[2024-11-07 03:48:41,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:41,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:42,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:42,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105211351]
[2024-11-07 03:48:42,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105211351] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 03:48:42,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683540073]
[2024-11-07 03:48:42,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:42,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:48:42,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 03:48:42,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 03:48:42,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-07 03:48:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:42,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 73 conjuncts are in the unsatisfiable core
[2024-11-07 03:48:42,826 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:48:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:43,551 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 03:48:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:44,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683540073] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 03:48:44,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 03:48:44,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 55
[2024-11-07 03:48:44,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392064687]
[2024-11-07 03:48:44,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 03:48:44,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states
[2024-11-07 03:48:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:44,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants.
[2024-11-07 03:48:44,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=2731, Unknown=0, NotChecked=0, Total=2970
[2024-11-07 03:48:44,292 INFO L87 Difference]: Start difference. First operand 902 states and 1235 transitions. Second operand has 55 states, 55 states have (on average 3.327272727272727) internal successors, (183), 55 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:44,914 INFO L93 Difference]: Finished difference Result 2092 states and 2918 transitions.
[2024-11-07 03:48:44,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2024-11-07 03:48:44,914 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.327272727272727) internal successors, (183), 55 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2024-11-07 03:48:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:44,917 INFO L225 Difference]: With dead ends: 2092
[2024-11-07 03:48:44,917 INFO L226 Difference]: Without dead ends: 1340
[2024-11-07 03:48:44,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=252, Invalid=2940, Unknown=0, NotChecked=0, Total=3192
[2024-11-07 03:48:44,919 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 173 mSDsluCounter, 3751 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 3893 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:44,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 3893 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-07 03:48:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states.
[2024-11-07 03:48:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1252.
[2024-11-07 03:48:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1251 states have (on average 1.3948840927258193) internal successors, (1745), 1251 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1745 transitions.
[2024-11-07 03:48:44,935 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1745 transitions. Word has length 80
[2024-11-07 03:48:44,935 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:44,935 INFO L471 AbstractCegarLoop]: Abstraction has 1252 states and 1745 transitions.
[2024-11-07 03:48:44,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.327272727272727) internal successors, (183), 55 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1745 transitions.
[2024-11-07 03:48:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2024-11-07 03:48:44,936 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:44,936 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:44,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-07 03:48:45,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2024-11-07 03:48:45,137 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:45,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:45,137 INFO L85 PathProgramCache]: Analyzing trace with hash -739006641, now seen corresponding path program 1 times
[2024-11-07 03:48:45,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:45,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715982746]
[2024-11-07 03:48:45,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:45,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:45,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715982746]
[2024-11-07 03:48:45,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715982746] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:45,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:45,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2024-11-07 03:48:45,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41556520]
[2024-11-07 03:48:45,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:45,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-07 03:48:45,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:45,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-07 03:48:45,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210
[2024-11-07 03:48:45,753 INFO L87 Difference]: Start difference. First operand 1252 states and 1745 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:46,045 INFO L93 Difference]: Finished difference Result 2370 states and 3336 transitions.
[2024-11-07 03:48:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-11-07 03:48:46,045 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2024-11-07 03:48:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:46,048 INFO L225 Difference]: With dead ends: 2370
[2024-11-07 03:48:46,048 INFO L226 Difference]: Without dead ends: 1274
[2024-11-07 03:48:46,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600
[2024-11-07 03:48:46,050 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 84 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:46,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1805 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:48:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states.
[2024-11-07 03:48:46,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1268.
[2024-11-07 03:48:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 1267 states have (on average 1.3914759273875297) internal successors, (1763), 1267 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1763 transitions.
[2024-11-07 03:48:46,075 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1763 transitions. Word has length 80
[2024-11-07 03:48:46,075 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:46,075 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1763 transitions.
[2024-11-07 03:48:46,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1763 transitions.
[2024-11-07 03:48:46,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2024-11-07 03:48:46,077 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:46,077 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:46,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-11-07 03:48:46,077 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:46,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:46,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2272830, now seen corresponding path program 1 times
[2024-11-07 03:48:46,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:46,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138468389]
[2024-11-07 03:48:46,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:46,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:46,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138468389]
[2024-11-07 03:48:46,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138468389] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:46,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:46,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 03:48:46,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965982624]
[2024-11-07 03:48:46,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:46,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 03:48:46,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:46,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 03:48:46,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:48:46,297 INFO L87 Difference]: Start difference. First operand 1268 states and 1763 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:46,360 INFO L93 Difference]: Finished difference Result 2416 states and 3388 transitions.
[2024-11-07 03:48:46,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 03:48:46,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80
[2024-11-07 03:48:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:46,364 INFO L225 Difference]: With dead ends: 2416
[2024-11-07 03:48:46,364 INFO L226 Difference]: Without dead ends: 1190
[2024-11-07 03:48:46,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-11-07 03:48:46,365 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 57 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:46,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 839 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:48:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states.
[2024-11-07 03:48:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190.
[2024-11-07 03:48:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 1.4087468460891506) internal successors, (1675), 1189 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1675 transitions.
[2024-11-07 03:48:46,381 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1675 transitions. Word has length 80
[2024-11-07 03:48:46,381 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:46,381 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1675 transitions.
[2024-11-07 03:48:46,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1675 transitions.
[2024-11-07 03:48:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2024-11-07 03:48:46,382 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:46,382 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:46,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-11-07 03:48:46,382 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:46,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1995355135, now seen corresponding path program 1 times
[2024-11-07 03:48:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:46,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934516877]
[2024-11-07 03:48:46,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:47,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:47,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934516877]
[2024-11-07 03:48:47,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934516877] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:48:47,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:48:47,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2024-11-07 03:48:47,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572245396]
[2024-11-07 03:48:47,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:48:47,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-11-07 03:48:47,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:47,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-11-07 03:48:47,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552
[2024-11-07 03:48:47,469 INFO L87 Difference]: Start difference. First operand 1190 states and 1675 transitions. Second operand has 24 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:48,107 INFO L93 Difference]: Finished difference Result 2472 states and 3495 transitions.
[2024-11-07 03:48:48,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2024-11-07 03:48:48,108 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2024-11-07 03:48:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:48,112 INFO L225 Difference]: With dead ends: 2472
[2024-11-07 03:48:48,112 INFO L226 Difference]: Without dead ends: 1388
[2024-11-07 03:48:48,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812
[2024-11-07 03:48:48,114 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 41 mSDsluCounter, 2760 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:48,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2896 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 03:48:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states.
[2024-11-07 03:48:48,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1321.
[2024-11-07 03:48:48,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.4174242424242425) internal successors, (1871), 1320 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1871 transitions.
[2024-11-07 03:48:48,153 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1871 transitions. Word has length 81
[2024-11-07 03:48:48,153 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:48,154 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1871 transitions.
[2024-11-07 03:48:48,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1871 transitions.
[2024-11-07 03:48:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2024-11-07 03:48:48,154 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:48,155 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:48,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-11-07 03:48:48,155 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:48,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:48,155 INFO L85 PathProgramCache]: Analyzing trace with hash -96855278, now seen corresponding path program 1 times
[2024-11-07 03:48:48,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:48,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098863564]
[2024-11-07 03:48:48,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:48,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:48,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:48,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098863564]
[2024-11-07 03:48:48,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098863564] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 03:48:48,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904686759]
[2024-11-07 03:48:48,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:48,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:48:48,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 03:48:48,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 03:48:48,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-07 03:48:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:48,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 86 conjuncts are in the unsatisfiable core
[2024-11-07 03:48:48,741 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:48:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:49,534 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 03:48:51,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:51,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904686759] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 03:48:51,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 03:48:51,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26, 29] total 70
[2024-11-07 03:48:51,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758780002]
[2024-11-07 03:48:51,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 03:48:51,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states
[2024-11-07 03:48:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:48:51,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants.
[2024-11-07 03:48:51,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=4462, Unknown=0, NotChecked=0, Total=4830
[2024-11-07 03:48:51,060 INFO L87 Difference]: Start difference. First operand 1321 states and 1871 transitions. Second operand has 70 states, 70 states have (on average 3.3) internal successors, (231), 70 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:54,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:48:54,577 INFO L93 Difference]: Finished difference Result 4329 states and 6210 transitions.
[2024-11-07 03:48:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states.
[2024-11-07 03:48:54,578 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 3.3) internal successors, (231), 70 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2024-11-07 03:48:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:48:54,582 INFO L225 Difference]: With dead ends: 4329
[2024-11-07 03:48:54,582 INFO L226 Difference]: Without dead ends: 1925
[2024-11-07 03:48:54,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3494 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1153, Invalid=12419, Unknown=0, NotChecked=0, Total=13572
[2024-11-07 03:48:54,587 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 1273 mSDsluCounter, 9972 mSDsCounter, 0 mSdLazyCounter, 4341 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 10254 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 4341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2024-11-07 03:48:54,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 10254 Invalid, 4350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 4341 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2024-11-07 03:48:54,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states.
[2024-11-07 03:48:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1490.
[2024-11-07 03:48:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1489 states have (on average 1.4163868368032237) internal successors, (2109), 1489 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2109 transitions.
[2024-11-07 03:48:54,608 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2109 transitions. Word has length 81
[2024-11-07 03:48:54,608 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:48:54,608 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 2109 transitions.
[2024-11-07 03:48:54,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 3.3) internal successors, (231), 70 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:48:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2109 transitions.
[2024-11-07 03:48:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2024-11-07 03:48:54,609 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:48:54,609 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:48:54,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-07 03:48:54,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:48:54,810 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:48:54,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:48:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash -681089849, now seen corresponding path program 1 times
[2024-11-07 03:48:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:48:54,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199106825]
[2024-11-07 03:48:54,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:48:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:48:55,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:48:55,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199106825]
[2024-11-07 03:48:55,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199106825] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 03:48:55,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592192208]
[2024-11-07 03:48:55,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:48:55,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:48:55,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 03:48:55,452 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 03:48:55,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-07 03:48:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:48:55,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 118 conjuncts are in the unsatisfiable core
[2024-11-07 03:48:55,659 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:49:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:49:05,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 03:49:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592192208] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:49:05,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 03:49:05,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [19] total 32
[2024-11-07 03:49:05,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514714897]
[2024-11-07 03:49:05,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:49:05,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-07 03:49:05,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:49:05,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-07 03:49:05,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992
[2024-11-07 03:49:05,499 INFO L87 Difference]: Start difference. First operand 1490 states and 2109 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:49:05,871 INFO L93 Difference]: Finished difference Result 2979 states and 4244 transitions.
[2024-11-07 03:49:05,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-11-07 03:49:05,871 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81
[2024-11-07 03:49:05,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:49:05,875 INFO L225 Difference]: With dead ends: 2979
[2024-11-07 03:49:05,875 INFO L226 Difference]: Without dead ends: 1708
[2024-11-07 03:49:05,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992
[2024-11-07 03:49:05,877 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 176 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 03:49:05,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1586 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 03:49:05,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states.
[2024-11-07 03:49:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1566.
[2024-11-07 03:49:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 1.4166134185303514) internal successors, (2217), 1565 states have internal predecessors, (2217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2217 transitions.
[2024-11-07 03:49:05,897 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2217 transitions. Word has length 81
[2024-11-07 03:49:05,897 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:49:05,897 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2217 transitions.
[2024-11-07 03:49:05,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2217 transitions.
[2024-11-07 03:49:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2024-11-07 03:49:05,898 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:49:05,898 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:49:05,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-11-07 03:49:06,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31
[2024-11-07 03:49:06,099 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:49:06,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:49:06,099 INFO L85 PathProgramCache]: Analyzing trace with hash -257691458, now seen corresponding path program 1 times
[2024-11-07 03:49:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:49:06,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720328066]
[2024-11-07 03:49:06,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:49:06,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:49:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:49:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:49:06,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:49:06,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720328066]
[2024-11-07 03:49:06,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720328066] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:49:06,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:49:06,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-07 03:49:06,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532777189]
[2024-11-07 03:49:06,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:49:06,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-07 03:49:06,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:49:06,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-07 03:49:06,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-11-07 03:49:06,548 INFO L87 Difference]: Start difference. First operand 1566 states and 2217 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:49:06,625 INFO L93 Difference]: Finished difference Result 2601 states and 3689 transitions.
[2024-11-07 03:49:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 03:49:06,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82
[2024-11-07 03:49:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:49:06,631 INFO L225 Difference]: With dead ends: 2601
[2024-11-07 03:49:06,634 INFO L226 Difference]: Without dead ends: 1305
[2024-11-07 03:49:06,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2024-11-07 03:49:06,635 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 13 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:49:06,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1130 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:49:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states.
[2024-11-07 03:49:06,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1238.
[2024-11-07 03:49:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1237 states have (on average 1.3896523848019402) internal successors, (1719), 1237 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1719 transitions.
[2024-11-07 03:49:06,648 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1719 transitions. Word has length 82
[2024-11-07 03:49:06,648 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:49:06,648 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1719 transitions.
[2024-11-07 03:49:06,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1719 transitions.
[2024-11-07 03:49:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2024-11-07 03:49:06,649 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:49:06,649 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:49:06,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-11-07 03:49:06,649 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:49:06,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:49:06,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2045733220, now seen corresponding path program 1 times
[2024-11-07 03:49:06,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:49:06,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627849030]
[2024-11-07 03:49:06,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:49:06,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:49:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:49:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:49:07,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:49:07,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627849030]
[2024-11-07 03:49:07,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627849030] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:49:07,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:49:07,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2024-11-07 03:49:07,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192583233]
[2024-11-07 03:49:07,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:49:07,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-11-07 03:49:07,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:49:07,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-11-07 03:49:07,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380
[2024-11-07 03:49:07,407 INFO L87 Difference]: Start difference. First operand 1238 states and 1719 transitions. Second operand has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:49:07,755 INFO L93 Difference]: Finished difference Result 2771 states and 3863 transitions.
[2024-11-07 03:49:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2024-11-07 03:49:07,756 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82
[2024-11-07 03:49:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:49:07,759 INFO L225 Difference]: With dead ends: 2771
[2024-11-07 03:49:07,759 INFO L226 Difference]: Without dead ends: 1721
[2024-11-07 03:49:07,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380
[2024-11-07 03:49:07,761 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 26 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 03:49:07,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2458 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 03:49:07,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states.
[2024-11-07 03:49:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1564.
[2024-11-07 03:49:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 1.400511836212412) internal successors, (2189), 1563 states have internal predecessors, (2189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2189 transitions.
[2024-11-07 03:49:07,785 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2189 transitions. Word has length 82
[2024-11-07 03:49:07,785 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:49:07,785 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2189 transitions.
[2024-11-07 03:49:07,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:07,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2189 transitions.
[2024-11-07 03:49:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2024-11-07 03:49:07,786 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:49:07,786 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:49:07,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-11-07 03:49:07,787 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:49:07,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:49:07,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1832821765, now seen corresponding path program 1 times
[2024-11-07 03:49:07,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:49:07,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428995622]
[2024-11-07 03:49:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:49:07,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:49:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:49:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:49:08,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:49:08,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428995622]
[2024-11-07 03:49:08,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428995622] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 03:49:08,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814557874]
[2024-11-07 03:49:08,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:49:08,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:49:08,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 03:49:08,397 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 03:49:08,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-07 03:49:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:49:08,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 71 conjuncts are in the unsatisfiable core
[2024-11-07 03:49:08,614 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:49:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:49:09,460 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 03:49:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:49:09,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814557874] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 03:49:09,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 03:49:09,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 53
[2024-11-07 03:49:09,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506244855]
[2024-11-07 03:49:09,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 03:49:09,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states
[2024-11-07 03:49:09,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:49:09,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants.
[2024-11-07 03:49:09,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2529, Unknown=0, NotChecked=0, Total=2756
[2024-11-07 03:49:09,943 INFO L87 Difference]: Start difference. First operand 1564 states and 2189 transitions. Second operand has 53 states, 53 states have (on average 3.6226415094339623) internal successors, (192), 53 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:10,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:49:10,500 INFO L93 Difference]: Finished difference Result 3314 states and 4679 transitions.
[2024-11-07 03:49:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2024-11-07 03:49:10,500 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.6226415094339623) internal successors, (192), 53 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82
[2024-11-07 03:49:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:49:10,504 INFO L225 Difference]: With dead ends: 3314
[2024-11-07 03:49:10,504 INFO L226 Difference]: Without dead ends: 2022
[2024-11-07 03:49:10,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=251, Invalid=2829, Unknown=0, NotChecked=0, Total=3080
[2024-11-07 03:49:10,507 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 157 mSDsluCounter, 4472 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 4645 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 03:49:10,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 4645 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 03:49:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states.
[2024-11-07 03:49:10,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1877.
[2024-11-07 03:49:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1876 states have (on average 1.4147121535181237) internal successors, (2654), 1876 states have internal predecessors, (2654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2654 transitions.
[2024-11-07 03:49:10,529 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2654 transitions. Word has length 82
[2024-11-07 03:49:10,529 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:49:10,529 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2654 transitions.
[2024-11-07 03:49:10,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.6226415094339623) internal successors, (192), 53 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2654 transitions.
[2024-11-07 03:49:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2024-11-07 03:49:10,530 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:49:10,530 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:49:10,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-11-07 03:49:10,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:49:10,731 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:49:10,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:49:10,731 INFO L85 PathProgramCache]: Analyzing trace with hash -158571857, now seen corresponding path program 1 times
[2024-11-07 03:49:10,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:49:10,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846768475]
[2024-11-07 03:49:10,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:49:10,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:49:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:49:11,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:49:11,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:49:11,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846768475]
[2024-11-07 03:49:11,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846768475] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 03:49:11,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810483117]
[2024-11-07 03:49:11,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:49:11,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:49:11,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 03:49:11,256 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 03:49:11,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-07 03:49:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:49:11,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 59 conjuncts are in the unsatisfiable core
[2024-11-07 03:49:11,452 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:49:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:49:11,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 03:49:11,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810483117] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:49:11,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 03:49:11,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [16] total 30
[2024-11-07 03:49:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287132497]
[2024-11-07 03:49:11,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:49:11,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-11-07 03:49:11,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:49:11,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-11-07 03:49:11,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=808, Unknown=0, NotChecked=0, Total=870
[2024-11-07 03:49:11,851 INFO L87 Difference]: Start difference. First operand 1877 states and 2654 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:49:12,482 INFO L93 Difference]: Finished difference Result 5197 states and 7435 transitions.
[2024-11-07 03:49:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2024-11-07 03:49:12,482 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83
[2024-11-07 03:49:12,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:49:12,486 INFO L225 Difference]: With dead ends: 5197
[2024-11-07 03:49:12,487 INFO L226 Difference]: Without dead ends: 3460
[2024-11-07 03:49:12,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=1691, Unknown=0, NotChecked=0, Total=1806
[2024-11-07 03:49:12,488 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 163 mSDsluCounter, 3579 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 3834 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 03:49:12,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 3834 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 03:49:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states.
[2024-11-07 03:49:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 2656.
[2024-11-07 03:49:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2656 states, 2655 states have (on average 1.4335216572504708) internal successors, (3806), 2655 states have internal predecessors, (3806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 3806 transitions.
[2024-11-07 03:49:12,515 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 3806 transitions. Word has length 83
[2024-11-07 03:49:12,515 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:49:12,515 INFO L471 AbstractCegarLoop]: Abstraction has 2656 states and 3806 transitions.
[2024-11-07 03:49:12,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 3806 transitions.
[2024-11-07 03:49:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2024-11-07 03:49:12,516 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:49:12,516 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:49:12,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-11-07 03:49:12,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 03:49:12,717 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:49:12,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:49:12,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1747522211, now seen corresponding path program 1 times
[2024-11-07 03:49:12,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:49:12,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661246653]
[2024-11-07 03:49:12,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:49:12,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:49:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 03:49:12,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 03:49:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 03:49:12,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 03:49:12,901 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 03:49:12,902 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 03:49:12,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-11-07 03:49:12,905 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:49:12,949 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 03:49:12,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:49:12 BoogieIcfgContainer
[2024-11-07 03:49:12,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 03:49:12,954 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 03:49:12,954 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 03:49:12,955 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 03:49:12,955 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:48:27" (3/4) ...
[2024-11-07 03:49:12,957 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 03:49:12,958 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 03:49:12,959 INFO L158 Benchmark]: Toolchain (without parser) took 47069.25ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 91.6MB in the beginning and 264.7MB in the end (delta: -173.0MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB.
[2024-11-07 03:49:12,959 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 03:49:12,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.58ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 76.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 03:49:12,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.61ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 67.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 03:49:12,960 INFO L158 Benchmark]: Boogie Preprocessor took 97.64ms. Allocated memory is still 117.4MB. Free memory was 67.5MB in the beginning and 62.4MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 03:49:12,960 INFO L158 Benchmark]: RCFGBuilder took 707.49ms. Allocated memory is still 117.4MB. Free memory was 62.4MB in the beginning and 55.9MB in the end (delta: 6.5MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB.
[2024-11-07 03:49:12,960 INFO L158 Benchmark]: TraceAbstraction took 45906.63ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 55.0MB in the beginning and 264.7MB in the end (delta: -209.7MB). Peak memory consumption was 114.2MB. Max. memory is 16.1GB.
[2024-11-07 03:49:12,960 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 352.3MB. Free memory was 264.7MB in the beginning and 264.7MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 03:49:12,961 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.83ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 268.58ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 76.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 79.61ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 67.5MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 97.64ms. Allocated memory is still 117.4MB. Free memory was 67.5MB in the beginning and 62.4MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 707.49ms. Allocated memory is still 117.4MB. Free memory was 62.4MB in the beginning and 55.9MB in the end (delta: 6.5MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 45906.63ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 55.0MB in the beginning and 264.7MB in the end (delta: -209.7MB). Peak memory consumption was 114.2MB. Max. memory is 16.1GB.
* Witness Printer took 3.23ms. Allocated memory is still 352.3MB. Free memory was 264.7MB in the beginning and 264.7MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of bitwiseOr at line 168, overapproximation of bitwiseAnd at line 111.
Possible FailurePath:
[L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3);
[L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1);
[L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1);
[L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1);
[L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8);
[L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1);
[L35] const SORT_3 var_14 = 0;
[L36] const SORT_3 var_29 = 1;
[L38] SORT_1 input_2;
[L39] SORT_3 input_4;
[L40] SORT_3 input_5;
[L41] SORT_3 input_6;
[L42] SORT_3 input_7;
[L43] SORT_3 input_8;
[L44] SORT_3 input_9;
[L45] SORT_3 input_10;
[L46] SORT_3 input_11;
[L47] SORT_12 input_13;
[L48] SORT_12 input_33;
[L49] SORT_12 input_35;
[L50] SORT_3 input_37;
[L51] SORT_3 input_39;
[L52] SORT_12 input_83;
[L53] SORT_3 input_89;
[L54] SORT_1 input_92;
[L55] SORT_3 input_94;
[L56] SORT_3 input_96;
[L57] SORT_3 input_98;
[L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_3=1, var_14=0, var_29=1]
[L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_3=1, var_14=0, var_29=1]
[L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_3=1, var_14=0, var_29=1]
[L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_3=1, var_14=0, var_29=1]
[L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L64] SORT_3 init_16_arg_1 = var_14;
[L65] state_15 = init_16_arg_1
[L66] SORT_3 init_18_arg_1 = var_14;
[L67] state_17 = init_18_arg_1
[L68] SORT_3 init_21_arg_1 = var_14;
[L69] state_20 = init_21_arg_1
[L70] SORT_3 init_25_arg_1 = var_14;
[L71] state_24 = init_25_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1]
[L74] input_2 = __VERIFIER_nondet_uchar()
[L75] input_4 = __VERIFIER_nondet_uchar()
[L76] input_5 = __VERIFIER_nondet_uchar()
[L77] input_6 = __VERIFIER_nondet_uchar()
[L78] input_7 = __VERIFIER_nondet_uchar()
[L79] input_8 = __VERIFIER_nondet_uchar()
[L80] input_9 = __VERIFIER_nondet_uchar()
[L81] input_10 = __VERIFIER_nondet_uchar()
[L82] input_11 = __VERIFIER_nondet_uchar()
[L83] input_13 = __VERIFIER_nondet_uchar()
[L84] input_33 = __VERIFIER_nondet_uchar()
[L85] input_35 = __VERIFIER_nondet_uchar()
[L86] input_37 = __VERIFIER_nondet_uchar()
[L87] input_39 = __VERIFIER_nondet_uchar()
[L88] input_83 = __VERIFIER_nondet_uchar()
[L89] input_89 = __VERIFIER_nondet_uchar()
[L90] input_92 = __VERIFIER_nondet_uchar()
[L91] input_94 = __VERIFIER_nondet_uchar()
[L92] input_96 = __VERIFIER_nondet_uchar()
[L93] input_98 = __VERIFIER_nondet_uchar()
[L96] SORT_3 var_19_arg_0 = state_15;
[L97] SORT_3 var_19_arg_1 = state_17;
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_19_arg_0=0, var_19_arg_1=0, var_29=1]
[L98] EXPR var_19_arg_0 | var_19_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1]
[L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1;
[L99] SORT_3 var_22_arg_0 = var_19;
[L100] SORT_3 var_22_arg_1 = state_20;
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_22_arg_0=0, var_22_arg_1=0, var_29=1]
[L101] EXPR var_22_arg_0 | var_22_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_29=1]
[L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1;
[L102] SORT_3 var_23_arg_0 = var_22;
[L103] SORT_3 var_23 = ~var_23_arg_0;
[L104] SORT_3 var_26_arg_0 = var_23;
[L105] SORT_3 var_26_arg_1 = state_24;
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_26_arg_0=-1, var_26_arg_1=0, var_29=1]
[L106] EXPR var_26_arg_0 | var_26_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1]
[L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1;
[L107] SORT_3 var_30_arg_0 = var_26;
[L108] SORT_3 var_30 = ~var_30_arg_0;
[L109] SORT_3 var_31_arg_0 = var_29;
[L110] SORT_3 var_31_arg_1 = var_30;
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-256]
[L111] EXPR var_31_arg_0 & var_31_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1]
[L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1;
[L112] EXPR var_31 & mask_SORT_3
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1]
[L112] var_31 = var_31 & mask_SORT_3
[L113] SORT_3 bad_32_arg_0 = var_31;
[L114] CALL __VERIFIER_assert(!(bad_32_arg_0))
[L21] COND FALSE !(!(cond))
[L114] RET __VERIFIER_assert(!(bad_32_arg_0))
[L116] SORT_3 var_41_arg_0 = state_17;
[L117] SORT_3 var_41 = ~var_41_arg_0;
[L118] SORT_3 var_42_arg_0 = state_15;
[L119] SORT_3 var_42 = ~var_42_arg_0;
[L120] SORT_3 var_43_arg_0 = var_42;
[L121] SORT_3 var_43_arg_1 = state_20;
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1, var_43_arg_0=-1, var_43_arg_1=0]
[L122] EXPR var_43_arg_0 & var_43_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_41=-1, var_42=-1]
[L122] SORT_3 var_43 = var_43_arg_0 & var_43_arg_1;
[L123] SORT_3 var_44_arg_0 = var_43;
[L124] SORT_3 var_44 = ~var_44_arg_0;
[L125] SORT_3 var_45_arg_0 = var_41;
[L126] SORT_3 var_45_arg_1 = var_44;
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_45_arg_0=-1, var_45_arg_1=-1]
[L127] EXPR var_45_arg_0 | var_45_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1]
[L127] SORT_3 var_45 = var_45_arg_0 | var_45_arg_1;
[L128] SORT_3 var_46_arg_0 = var_45;
[L129] SORT_3 var_46 = ~var_46_arg_0;
[L130] SORT_3 var_47_arg_0 = state_17;
[L131] SORT_3 var_47_arg_1 = state_20;
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256, var_47_arg_0=0, var_47_arg_1=0]
[L132] EXPR var_47_arg_0 & var_47_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_42=-1, var_46=-256]
[L132] SORT_3 var_47 = var_47_arg_0 & var_47_arg_1;
[L133] SORT_3 var_48_arg_0 = var_42;
[L134] SORT_3 var_48_arg_1 = var_47;
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256, var_48_arg_0=-1, var_48_arg_1=0]
[L135] EXPR var_48_arg_0 | var_48_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_46=-256]
[L135] SORT_3 var_48 = var_48_arg_0 | var_48_arg_1;
[L136] SORT_3 var_49_arg_0 = var_48;
[L137] SORT_3 var_49 = ~var_49_arg_0;
[L138] SORT_3 var_50_arg_0 = var_46;
[L139] SORT_3 var_50_arg_1 = var_49;
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1, var_50_arg_0=-256, var_50_arg_1=-256]
[L140] EXPR var_50_arg_0 | var_50_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_29=1]
[L140] SORT_3 var_50 = var_50_arg_0 | var_50_arg_1;
[L141] SORT_3 next_100_arg_1 = var_50;
[L142] SORT_3 var_52_arg_0 = state_20;
[L143] SORT_3 var_52 = ~var_52_arg_0;
[L144] SORT_3 var_53_arg_0 = state_17;
[L145] SORT_3 var_53_arg_1 = var_52;
VAL [mask_SORT_3=1, next_100_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53_arg_0=0, var_53_arg_1=-1]
[L146] EXPR var_53_arg_0 | var_53_arg_1
VAL [mask_SORT_3=1, next_100_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1]
[L146] SORT_3 var_53 = var_53_arg_0 | var_53_arg_1;
[L147] SORT_3 var_54_arg_0 = state_17;
[L148] SORT_3 var_54_arg_1 = var_52;
VAL [mask_SORT_3=1, next_100_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255, var_54_arg_0=0, var_54_arg_1=-1]
[L149] EXPR var_54_arg_0 & var_54_arg_1
VAL [mask_SORT_3=1, next_100_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_53=255]
[L149] SORT_3 var_54 = var_54_arg_0 & var_54_arg_1;
[L150] SORT_3 var_55_arg_0 = var_54;
[L151] SORT_3 var_55 = ~var_55_arg_0;
[L152] SORT_3 var_56_arg_0 = var_53;
[L153] SORT_3 var_56_arg_1 = var_55;
VAL [mask_SORT_3=1, next_100_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_56_arg_0=255, var_56_arg_1=-1]
[L154] EXPR var_56_arg_0 & var_56_arg_1
VAL [mask_SORT_3=1, next_100_arg_1=0, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1]
[L154] SORT_3 var_56 = var_56_arg_0 & var_56_arg_1;
[L155] SORT_3 var_57_arg_0 = var_56;
[L156] SORT_3 var_57 = ~var_57_arg_0;
[L157] SORT_3 next_101_arg_1 = var_57;
[L158] SORT_1 var_59_arg_0 = input_2;
[L159] SORT_3 var_59 = var_59_arg_0 >> 0;
[L160] SORT_1 var_60_arg_0 = input_2;
[L161] SORT_3 var_60 = var_60_arg_0 >> 2;
[L162] SORT_3 var_61_arg_0 = var_60;
[L163] SORT_3 var_61 = ~var_61_arg_0;
[L164] SORT_1 var_62_arg_0 = input_2;
[L165] SORT_3 var_62 = var_62_arg_0 >> 1;
[L166] SORT_3 var_63_arg_0 = var_61;
[L167] SORT_3 var_63_arg_1 = var_62;
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=2, var_63_arg_0=-1, var_63_arg_1=1]
[L168] EXPR var_63_arg_0 | var_63_arg_1
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_59=2]
[L168] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1;
[L169] SORT_3 var_64_arg_0 = var_59;
[L170] SORT_3 var_64_arg_1 = var_63;
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_64_arg_0=2, var_64_arg_1=256]
[L171] EXPR var_64_arg_0 | var_64_arg_1
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1]
[L171] SORT_3 var_64 = var_64_arg_0 | var_64_arg_1;
[L172] SORT_3 var_65_arg_0 = var_64;
[L173] SORT_3 var_65 = ~var_65_arg_0;
[L174] SORT_3 var_66_arg_0 = state_15;
[L175] SORT_3 var_66_arg_1 = state_17;
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_65=-3, var_66_arg_0=0, var_66_arg_1=0]
[L176] EXPR var_66_arg_0 | var_66_arg_1
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_65=-3]
[L176] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1;
[L177] SORT_3 var_67_arg_0 = var_65;
[L178] SORT_3 var_67_arg_1 = var_66;
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_65=-3, var_67_arg_0=-3, var_67_arg_1=0]
[L179] EXPR var_67_arg_0 | var_67_arg_1
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_52=-1, var_65=-3]
[L179] SORT_3 var_67 = var_67_arg_0 | var_67_arg_1;
[L180] SORT_3 var_68_arg_0 = var_67;
[L181] SORT_3 var_68_arg_1 = var_52;
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_65=-3, var_68_arg_0=253, var_68_arg_1=-1]
[L182] EXPR var_68_arg_0 & var_68_arg_1
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, state_15=0, state_17=0, state_20=0, var_29=1, var_65=-3]
[L182] SORT_3 var_68 = var_68_arg_0 & var_68_arg_1;
[L183] SORT_3 next_102_arg_1 = var_68;
[L184] SORT_3 var_85_arg_0 = var_65;
[L185] SORT_3 var_85_arg_1 = state_17;
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, next_102_arg_1=2, state_15=0, state_20=0, var_29=1, var_85_arg_0=-3, var_85_arg_1=0]
[L186] EXPR var_85_arg_0 | var_85_arg_1
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, next_102_arg_1=2, state_15=0, state_20=0, var_29=1]
[L186] SORT_3 var_85 = var_85_arg_0 | var_85_arg_1;
[L187] SORT_3 var_86_arg_0 = var_85;
[L188] SORT_3 var_86_arg_1 = state_15;
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, next_102_arg_1=2, state_20=0, var_29=1, var_86_arg_0=253, var_86_arg_1=0]
[L189] EXPR var_86_arg_0 | var_86_arg_1
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, next_102_arg_1=2, state_20=0, var_29=1]
[L189] SORT_3 var_86 = var_86_arg_0 | var_86_arg_1;
[L190] SORT_3 var_87_arg_0 = var_86;
[L191] SORT_3 var_87_arg_1 = state_20;
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, next_102_arg_1=2, var_29=1, var_87_arg_0=253, var_87_arg_1=0]
[L192] EXPR var_87_arg_0 | var_87_arg_1
VAL [mask_SORT_3=1, next_100_arg_1=0, next_101_arg_1=-256, next_102_arg_1=2, var_29=1]
[L192] SORT_3 var_87 = var_87_arg_0 | var_87_arg_1;
[L193] SORT_3 next_103_arg_1 = var_87;
[L195] state_15 = next_100_arg_1
[L196] state_17 = next_101_arg_1
[L197] state_20 = next_102_arg_1
[L198] state_24 = next_103_arg_1
[L74] input_2 = __VERIFIER_nondet_uchar()
[L75] input_4 = __VERIFIER_nondet_uchar()
[L76] input_5 = __VERIFIER_nondet_uchar()
[L77] input_6 = __VERIFIER_nondet_uchar()
[L78] input_7 = __VERIFIER_nondet_uchar()
[L79] input_8 = __VERIFIER_nondet_uchar()
[L80] input_9 = __VERIFIER_nondet_uchar()
[L81] input_10 = __VERIFIER_nondet_uchar()
[L82] input_11 = __VERIFIER_nondet_uchar()
[L83] input_13 = __VERIFIER_nondet_uchar()
[L84] input_33 = __VERIFIER_nondet_uchar()
[L85] input_35 = __VERIFIER_nondet_uchar()
[L86] input_37 = __VERIFIER_nondet_uchar()
[L87] input_39 = __VERIFIER_nondet_uchar()
[L88] input_83 = __VERIFIER_nondet_uchar()
[L89] input_89 = __VERIFIER_nondet_uchar()
[L90] input_92 = __VERIFIER_nondet_uchar()
[L91] input_94 = __VERIFIER_nondet_uchar()
[L92] input_96 = __VERIFIER_nondet_uchar()
[L93] input_98 = __VERIFIER_nondet_uchar()
[L96] SORT_3 var_19_arg_0 = state_15;
[L97] SORT_3 var_19_arg_1 = state_17;
VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=2, state_24=253, var_19_arg_0=0, var_19_arg_1=-256, var_29=1]
[L98] EXPR var_19_arg_0 | var_19_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=2, state_24=253, var_29=1]
[L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1;
[L99] SORT_3 var_22_arg_0 = var_19;
[L100] SORT_3 var_22_arg_1 = state_20;
VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=2, state_24=253, var_22_arg_0=0, var_22_arg_1=2, var_29=1]
[L101] EXPR var_22_arg_0 | var_22_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=2, state_24=253, var_29=1]
[L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1;
[L102] SORT_3 var_23_arg_0 = var_22;
[L103] SORT_3 var_23 = ~var_23_arg_0;
[L104] SORT_3 var_26_arg_0 = var_23;
[L105] SORT_3 var_26_arg_1 = state_24;
VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=2, var_26_arg_0=-3, var_26_arg_1=253, var_29=1]
[L106] EXPR var_26_arg_0 | var_26_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=2, var_29=1]
[L106] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1;
[L107] SORT_3 var_30_arg_0 = var_26;
[L108] SORT_3 var_30 = ~var_30_arg_0;
[L109] SORT_3 var_31_arg_0 = var_29;
[L110] SORT_3 var_31_arg_1 = var_30;
VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=2, var_29=1, var_31_arg_0=1, var_31_arg_1=-254]
[L111] EXPR var_31_arg_0 & var_31_arg_1
VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=2, var_29=1]
[L111] SORT_3 var_31 = var_31_arg_0 & var_31_arg_1;
[L112] EXPR var_31 & mask_SORT_3
VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=2, var_29=1]
[L112] var_31 = var_31 & mask_SORT_3
[L113] SORT_3 bad_32_arg_0 = var_31;
[L114] CALL __VERIFIER_assert(!(bad_32_arg_0))
[L21] COND TRUE !(cond)
[L21] reach_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.8s, OverallIterations: 37, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4999 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4999 mSDsluCounter, 61295 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55702 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14381 IncrementalHoareTripleChecker+Invalid, 14458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 5593 mSDtfsCounter, 14381 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1627 GetRequests, 932 SyntacticMatches, 6 SemanticMatches, 689 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7278 ImplicationChecksByTransitivity, 16.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2656occurred in iteration=36, InterpolantAutomatonStates: 457, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 36 MinimizatonAttempts, 2817 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 28.5s InterpolantComputationTime, 3210 NumberOfCodeBlocks, 3210 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3471 ConstructedInterpolants, 5 QuantifiedInterpolants, 21562 SizeOfPredicates, 25 NumberOfNonLiveVariables, 3391 ConjunctsInSsa, 522 ConjunctsInUnsatCore, 49 InterpolantComputations, 31 PerfectInterpolantSequences, 439/522 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-07 03:49:12,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash db87c07dbb7452fd246a98fbd617147a32e88270b5156b64dd08a046f6919e1f
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 03:49:14,834 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 03:49:14,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf
[2024-11-07 03:49:14,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 03:49:14,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 03:49:14,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 03:49:14,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 03:49:14,927 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 03:49:14,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 03:49:14,927 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 03:49:14,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 03:49:14,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 03:49:14,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 03:49:14,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 03:49:14,928 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 03:49:14,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 03:49:14,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 03:49:14,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 03:49:14,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 03:49:14,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 03:49:14,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 03:49:14,928 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 03:49:14,929 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 03:49:14,929 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 03:49:14,929 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 03:49:14,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 03:49:14,929 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 03:49:14,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 03:49:14,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 03:49:14,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 03:49:14,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 03:49:14,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 03:49:14,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 03:49:14,930 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 03:49:14,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 03:49:14,930 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 03:49:14,930 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 03:49:14,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 03:49:14,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 03:49:14,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 03:49:14,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 03:49:14,930 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 -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> db87c07dbb7452fd246a98fbd617147a32e88270b5156b64dd08a046f6919e1f
[2024-11-07 03:49:15,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 03:49:15,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 03:49:15,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 03:49:15,166 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 03:49:15,166 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 03:49:15,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p3.c
[2024-11-07 03:49:16,380 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 03:49:16,590 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 03:49:16,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p3.c
[2024-11-07 03:49:16,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ea9eca3f/f47f48c52c1442d1843935c6a2a8a8e6/FLAG9e2280ff9
[2024-11-07 03:49:16,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ea9eca3f/f47f48c52c1442d1843935c6a2a8a8e6
[2024-11-07 03:49:16,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 03:49:16,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 03:49:16,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 03:49:16,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 03:49:16,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 03:49:16,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:16,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2985e123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16, skipping insertion in model container
[2024-11-07 03:49:16,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:16,643 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 03:49:16,775 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p3.c[1259,1272]
[2024-11-07 03:49:16,834 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 03:49:16,849 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 03:49:16,860 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p3.c[1259,1272]
[2024-11-07 03:49:16,897 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 03:49:16,912 INFO L204 MainTranslator]: Completed translation
[2024-11-07 03:49:16,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16 WrapperNode
[2024-11-07 03:49:16,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 03:49:16,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 03:49:16,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 03:49:16,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 03:49:16,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:16,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:16,957 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 228
[2024-11-07 03:49:16,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 03:49:16,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 03:49:16,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 03:49:16,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 03:49:16,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:16,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:16,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:16,995 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].
[2024-11-07 03:49:16,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:16,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:17,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:17,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:17,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:17,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:17,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 03:49:17,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 03:49:17,017 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 03:49:17,017 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 03:49:17,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (1/1) ...
[2024-11-07 03:49:17,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 03:49:17,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 03:49:17,049 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)
[2024-11-07 03:49:17,052 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
[2024-11-07 03:49:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 03:49:17,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 03:49:17,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 03:49:17,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 03:49:17,165 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 03:49:17,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 03:49:17,306 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live.
[2024-11-07 03:49:17,306 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 03:49:17,315 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 03:49:17,315 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 03:49:17,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:49:17 BoogieIcfgContainer
[2024-11-07 03:49:17,316 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 03:49:17,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 03:49:17,338 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 03:49:17,345 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 03:49:17,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:49:16" (1/3) ...
[2024-11-07 03:49:17,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e3ce99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:49:17, skipping insertion in model container
[2024-11-07 03:49:17,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:16" (2/3) ...
[2024-11-07 03:49:17,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e3ce99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:49:17, skipping insertion in model container
[2024-11-07 03:49:17,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:49:17" (3/3) ...
[2024-11-07 03:49:17,347 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p3.c
[2024-11-07 03:49:17,359 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 03:49:17,359 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 03:49:17,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 03:49:17,398 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;@16de6615, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 03:49:17,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 03:49:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-07 03:49:17,407 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:49:17,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-07 03:49:17,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:49:17,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:49:17,413 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times
[2024-11-07 03:49:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 03:49:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431545782]
[2024-11-07 03:49:17,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:49:17,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 03:49:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 03:49:17,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 03:49:17,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-07 03:49:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:49:17,527 WARN L253 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 26 conjuncts are in the unsatisfiable core
[2024-11-07 03:49:17,539 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:49:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:49:17,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 03:49:17,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 03:49:17,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431545782]
[2024-11-07 03:49:17,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431545782] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:49:17,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:49:17,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 03:49:17,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521414215]
[2024-11-07 03:49:17,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:49:17,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 03:49:17,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 03:49:17,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 03:49:17,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 03:49:17,761 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:49:17,797 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions.
[2024-11-07 03:49:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 03:49:17,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5
[2024-11-07 03:49:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:49:17,803 INFO L225 Difference]: With dead ends: 18
[2024-11-07 03:49:17,804 INFO L226 Difference]: Without dead ends: 10
[2024-11-07 03:49:17,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 03:49:17,810 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:49:17,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:49:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states.
[2024-11-07 03:49:17,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9.
[2024-11-07 03:49:17,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:17,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2024-11-07 03:49:17,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5
[2024-11-07 03:49:17,828 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:49:17,828 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2024-11-07 03:49:17,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2024-11-07 03:49:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 03:49:17,829 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:49:17,829 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:49:17,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-07 03:49:18,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 03:49:18,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:49:18,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:49:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times
[2024-11-07 03:49:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 03:49:18,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653285774]
[2024-11-07 03:49:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:49:18,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 03:49:18,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 03:49:18,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 03:49:18,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-07 03:49:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:49:18,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 31 conjuncts are in the unsatisfiable core
[2024-11-07 03:49:18,130 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:49:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:49:18,301 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 03:49:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:49:18,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 03:49:18,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653285774]
[2024-11-07 03:49:18,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653285774] provided 1 perfect and 1 imperfect interpolant sequences
[2024-11-07 03:49:18,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 03:49:18,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7
[2024-11-07 03:49:18,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479116819]
[2024-11-07 03:49:18,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:49:18,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 03:49:18,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 03:49:18,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 03:49:18,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:49:18,380 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:49:18,401 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions.
[2024-11-07 03:49:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 03:49:18,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8
[2024-11-07 03:49:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:49:18,402 INFO L225 Difference]: With dead ends: 9
[2024-11-07 03:49:18,402 INFO L226 Difference]: Without dead ends: 0
[2024-11-07 03:49:18,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:49:18,403 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:49:18,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:49:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-07 03:49:18,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-07 03:49:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-07 03:49:18,404 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8
[2024-11-07 03:49:18,404 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:49:18,404 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-07 03:49:18,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 03:49:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-07 03:49:18,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-07 03:49:18,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 03:49:18,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-07 03:49:18,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 03:49:18,611 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1]
[2024-11-07 03:49:18,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-07 03:49:18,631 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 03:49:18,636 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression
[2024-11-07 03:49:18,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:49:18 BoogieIcfgContainer
[2024-11-07 03:49:18,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 03:49:18,638 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 03:49:18,638 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 03:49:18,638 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 03:49:18,638 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:49:17" (3/4) ...
[2024-11-07 03:49:18,640 INFO L142 WitnessPrinter]: Generating witness for correct program
[2024-11-07 03:49:18,645 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-07 03:49:18,645 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-07 03:49:18,645 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-07 03:49:18,646 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-07 03:49:18,704 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 03:49:18,705 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-07 03:49:18,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 03:49:18,706 INFO L158 Benchmark]: Toolchain (without parser) took 2084.36ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 59.9MB in the beginning and 44.2MB in the end (delta: 15.7MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB.
[2024-11-07 03:49:18,706 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 03:49:18,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.76ms. Allocated memory is still 83.9MB. Free memory was 59.9MB in the beginning and 45.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 03:49:18,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.03ms. Allocated memory is still 83.9MB. Free memory was 45.4MB in the beginning and 43.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 03:49:18,707 INFO L158 Benchmark]: Boogie Preprocessor took 55.26ms. Allocated memory is still 83.9MB. Free memory was 43.2MB in the beginning and 41.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 03:49:18,707 INFO L158 Benchmark]: RCFGBuilder took 299.47ms. Allocated memory is still 83.9MB. Free memory was 41.0MB in the beginning and 21.7MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 03:49:18,707 INFO L158 Benchmark]: TraceAbstraction took 1299.16ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 58.2MB in the beginning and 50.3MB in the end (delta: 7.9MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB.
[2024-11-07 03:49:18,707 INFO L158 Benchmark]: Witness Printer took 67.67ms. Allocated memory is still 109.1MB. Free memory was 50.3MB in the beginning and 44.2MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 03:49:18,708 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 65.0MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 289.76ms. Allocated memory is still 83.9MB. Free memory was 59.9MB in the beginning and 45.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 47.03ms. Allocated memory is still 83.9MB. Free memory was 45.4MB in the beginning and 43.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 55.26ms. Allocated memory is still 83.9MB. Free memory was 43.2MB in the beginning and 41.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 299.47ms. Allocated memory is still 83.9MB. Free memory was 41.0MB in the beginning and 21.7MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 1299.16ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 58.2MB in the beginning and 50.3MB in the end (delta: 7.9MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB.
* Witness Printer took 67.67ms. Allocated memory is still 109.1MB. Free memory was 50.3MB in the beginning and 44.2MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- PositiveResult [Line: 21]: a call to reach_error is unreachable
For all program executions holds that a call to reach_error is unreachable at this location
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 7 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 2 QuantifiedInterpolants, 196 SizeOfPredicates, 9 NumberOfNonLiveVariables, 122 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- InvariantResult [Line: 72]: Loop Invariant
Derived loop invariant: null
RESULT: Ultimate proved your program to be correct!
[2024-11-07 03:49:18,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE