./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.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_arrays_vsaR_p02.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', 'c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0']
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_arrays_vsaR_p02.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 c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 03:51:12,354 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 03:51:12,462 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:51:12,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 03:51:12,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 03:51:12,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 03:51:12,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 03:51:12,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 03:51:12,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 03:51:12,502 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 03:51:12,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 03:51:12,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 03:51:12,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 03:51:12,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 03:51:12,503 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 03:51:12,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 03:51:12,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 03:51:12,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 03:51:12,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 03:51:12,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 03:51:12,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 03:51:12,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 03:51:12,505 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 03:51:12,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 03:51:12,506 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 03:51:12,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 03:51:12,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 03:51:12,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 03:51:12,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 03:51:12,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 03:51:12,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 03:51:12,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 03:51:12,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 03:51:12,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 03:51:12,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 03:51:12,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 03:51:12,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 03:51:12,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 03:51:12,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 03:51:12,509 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 -> c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0
[2024-11-07 03:51:12,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 03:51:12,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 03:51:12,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 03:51:12,806 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 03:51:12,806 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 03:51:12,808 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_arrays_vsaR_p02.c
[2024-11-07 03:51:14,150 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 03:51:14,426 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 03:51:14,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c
[2024-11-07 03:51:14,438 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77b2d45fd/5599a0b9936a4f04af417dfc2d197d68/FLAG0d09b17c2
[2024-11-07 03:51:14,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77b2d45fd/5599a0b9936a4f04af417dfc2d197d68
[2024-11-07 03:51:14,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 03:51:14,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 03:51:14,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 03:51:14,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 03:51:14,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 03:51:14,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:51:14" (1/1) ...
[2024-11-07 03:51:14,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44ef2a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:14, skipping insertion in model container
[2024-11-07 03:51:14,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:51:14" (1/1) ...
[2024-11-07 03:51:14,770 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 03:51:14,930 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_arrays_vsaR_p02.c[1259,1272]
[2024-11-07 03:51:15,165 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 03:51:15,175 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 03:51:15,184 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_arrays_vsaR_p02.c[1259,1272]
[2024-11-07 03:51:15,307 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 03:51:15,319 INFO L204 MainTranslator]: Completed translation
[2024-11-07 03:51:15,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:15 WrapperNode
[2024-11-07 03:51:15,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 03:51:15,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 03:51:15,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 03:51:15,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 03:51:15,327 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:51:15" (1/1) ...
[2024-11-07 03:51:15,380 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:51:15" (1/1) ...
[2024-11-07 03:51:15,656 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2114
[2024-11-07 03:51:15,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 03:51:15,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 03:51:15,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 03:51:15,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 03:51:15,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:15" (1/1) ...
[2024-11-07 03:51:15,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:15" (1/1) ...
[2024-11-07 03:51:15,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:15" (1/1) ...
[2024-11-07 03:51:15,859 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:51:15,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:15" (1/1) ...
[2024-11-07 03:51:15,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:15" (1/1) ...
[2024-11-07 03:51:15,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:15" (1/1) ...
[2024-11-07 03:51:16,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:15" (1/1) ...
[2024-11-07 03:51:16,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:15" (1/1) ...
[2024-11-07 03:51:16,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:15" (1/1) ...
[2024-11-07 03:51:16,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 03:51:16,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 03:51:16,147 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 03:51:16,148 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 03:51:16,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:15" (1/1) ...
[2024-11-07 03:51:16,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 03:51:16,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 03:51:16,185 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:51:16,194 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:51:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 03:51:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 03:51:16,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 03:51:16,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 03:51:16,554 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 03:51:16,556 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 03:51:18,876 INFO L? ?]: Removed 1324 outVars from TransFormulas that were not future-live.
[2024-11-07 03:51:18,877 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 03:51:18,908 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 03:51:18,912 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 03:51:18,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:51:18 BoogieIcfgContainer
[2024-11-07 03:51:18,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 03:51:18,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 03:51:18,918 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 03:51:18,922 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 03:51:18,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:51:14" (1/3) ...
[2024-11-07 03:51:18,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36180da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:51:18, skipping insertion in model container
[2024-11-07 03:51:18,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:15" (2/3) ...
[2024-11-07 03:51:18,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36180da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:51:18, skipping insertion in model container
[2024-11-07 03:51:18,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:51:18" (3/3) ...
[2024-11-07 03:51:18,925 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c
[2024-11-07 03:51:18,938 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 03:51:18,939 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 03:51:19,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 03:51:19,015 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;@4566dd92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 03:51:19,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 03:51:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 531 states, 529 states have (on average 1.4990548204158791) internal successors, (793), 530 states have internal predecessors, (793), 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:51:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2024-11-07 03:51:19,032 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:51:19,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:51:19,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:51:19,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:51:19,039 INFO L85 PathProgramCache]: Analyzing trace with hash 387884158, now seen corresponding path program 1 times
[2024-11-07 03:51:19,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:51:19,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803738187]
[2024-11-07 03:51:19,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:51:19,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:51:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:51:19,936 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:51:19,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:51:19,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803738187]
[2024-11-07 03:51:19,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803738187] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:51:19,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:51:19,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 03:51:19,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254372683]
[2024-11-07 03:51:19,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:51:19,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 03:51:19,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:51:19,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 03:51:19,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 03:51:19,963 INFO L87 Difference]: Start difference. First operand has 531 states, 529 states have (on average 1.4990548204158791) internal successors, (793), 530 states have internal predecessors, (793), 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 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:51:20,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:51:20,083 INFO L93 Difference]: Finished difference Result 1007 states and 1507 transitions.
[2024-11-07 03:51:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 03:51:20,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41
[2024-11-07 03:51:20,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:51:20,104 INFO L225 Difference]: With dead ends: 1007
[2024-11-07 03:51:20,105 INFO L226 Difference]: Without dead ends: 530
[2024-11-07 03:51:20,112 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:51:20,114 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 0 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2355 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:51:20,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2355 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:51:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states.
[2024-11-07 03:51:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530.
[2024-11-07 03:51:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 1.4952741020793952) internal successors, (791), 529 states have internal predecessors, (791), 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:51:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 791 transitions.
[2024-11-07 03:51:20,172 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 791 transitions. Word has length 41
[2024-11-07 03:51:20,172 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:51:20,173 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 791 transitions.
[2024-11-07 03:51:20,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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:51:20,173 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 791 transitions.
[2024-11-07 03:51:20,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2024-11-07 03:51:20,175 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:51:20,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:51:20,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 03:51:20,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:51:20,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:51:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash -858797603, now seen corresponding path program 1 times
[2024-11-07 03:51:20,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:51:20,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662964035]
[2024-11-07 03:51:20,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:51:20,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:51:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:51:20,417 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:51:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:51:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662964035]
[2024-11-07 03:51:20,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662964035] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:51:20,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:51:20,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 03:51:20,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280738236]
[2024-11-07 03:51:20,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:51:20,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 03:51:20,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:51:20,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 03:51:20,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 03:51:20,421 INFO L87 Difference]: Start difference. First operand 530 states and 791 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:51:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:51:20,514 INFO L93 Difference]: Finished difference Result 1008 states and 1505 transitions.
[2024-11-07 03:51:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 03:51:20,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42
[2024-11-07 03:51:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:51:20,519 INFO L225 Difference]: With dead ends: 1008
[2024-11-07 03:51:20,519 INFO L226 Difference]: Without dead ends: 532
[2024-11-07 03:51:20,520 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:51:20,525 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 0 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2351 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:51:20,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2351 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:51:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states.
[2024-11-07 03:51:20,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532.
[2024-11-07 03:51:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.4934086629001884) internal successors, (793), 531 states have internal predecessors, (793), 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:51:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 793 transitions.
[2024-11-07 03:51:20,557 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 793 transitions. Word has length 42
[2024-11-07 03:51:20,558 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:51:20,558 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 793 transitions.
[2024-11-07 03:51:20,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:51:20,558 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 793 transitions.
[2024-11-07 03:51:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2024-11-07 03:51:20,559 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:51:20,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:51:20,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 03:51:20,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:51:20,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:51:20,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1950887625, now seen corresponding path program 1 times
[2024-11-07 03:51:20,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:51:20,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254218392]
[2024-11-07 03:51:20,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:51:20,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:51:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:51:20,941 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:51:20,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:51:20,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254218392]
[2024-11-07 03:51:20,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254218392] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:51:20,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:51:20,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 03:51:20,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051215210]
[2024-11-07 03:51:20,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:51:20,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 03:51:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:51:20,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 03:51:20,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 03:51:20,947 INFO L87 Difference]: Start difference. First operand 532 states and 793 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:51:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:51:21,034 INFO L93 Difference]: Finished difference Result 1014 states and 1512 transitions.
[2024-11-07 03:51:21,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 03:51:21,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 43
[2024-11-07 03:51:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:51:21,038 INFO L225 Difference]: With dead ends: 1014
[2024-11-07 03:51:21,038 INFO L226 Difference]: Without dead ends: 536
[2024-11-07 03:51:21,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-07 03:51:21,042 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 760 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 03:51:21,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 2342 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 03:51:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states.
[2024-11-07 03:51:21,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 535.
[2024-11-07 03:51:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.4906367041198503) internal successors, (796), 534 states have internal predecessors, (796), 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:51:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 796 transitions.
[2024-11-07 03:51:21,060 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 796 transitions. Word has length 43
[2024-11-07 03:51:21,060 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:51:21,061 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 796 transitions.
[2024-11-07 03:51:21,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:51:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 796 transitions.
[2024-11-07 03:51:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-11-07 03:51:21,063 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:51:21,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:51:21,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 03:51:21,063 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:51:21,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:51:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1216571104, now seen corresponding path program 1 times
[2024-11-07 03:51:21,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:51:21,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895059793]
[2024-11-07 03:51:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:51:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:51:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:51:21,833 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:51:21,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:51:21,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895059793]
[2024-11-07 03:51:21,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895059793] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:51:21,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:51:21,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 03:51:21,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90809000]
[2024-11-07 03:51:21,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:51:21,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 03:51:21,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:51:21,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 03:51:21,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:51:21,836 INFO L87 Difference]: Start difference. First operand 535 states and 796 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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:51:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:51:21,945 INFO L93 Difference]: Finished difference Result 1025 states and 1525 transitions.
[2024-11-07 03:51:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 03:51:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 44
[2024-11-07 03:51:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:51:21,949 INFO L225 Difference]: With dead ends: 1025
[2024-11-07 03:51:21,949 INFO L226 Difference]: Without dead ends: 544
[2024-11-07 03:51:21,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-11-07 03:51:21,953 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 771 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 3106 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:51:21,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 3106 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:51:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states.
[2024-11-07 03:51:21,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 539.
[2024-11-07 03:51:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.4888475836431228) internal successors, (801), 538 states have internal predecessors, (801), 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:51:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 801 transitions.
[2024-11-07 03:51:21,968 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 801 transitions. Word has length 44
[2024-11-07 03:51:21,969 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:51:21,969 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 801 transitions.
[2024-11-07 03:51:21,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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:51:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 801 transitions.
[2024-11-07 03:51:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-11-07 03:51:21,970 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:51:21,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:51:21,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 03:51:21,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:51:21,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:51:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash 560912804, now seen corresponding path program 1 times
[2024-11-07 03:51:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:51:21,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229710820]
[2024-11-07 03:51:21,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:51:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:51:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:51:22,340 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:51:22,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:51:22,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229710820]
[2024-11-07 03:51:22,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229710820] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:51:22,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:51:22,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 03:51:22,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577678332]
[2024-11-07 03:51:22,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:51:22,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 03:51:22,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:51:22,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 03:51:22,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:51:22,343 INFO L87 Difference]: Start difference. First operand 539 states and 801 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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:51:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:51:22,449 INFO L93 Difference]: Finished difference Result 1022 states and 1520 transitions.
[2024-11-07 03:51:22,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 03:51:22,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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 44
[2024-11-07 03:51:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:51:22,452 INFO L225 Difference]: With dead ends: 1022
[2024-11-07 03:51:22,452 INFO L226 Difference]: Without dead ends: 537
[2024-11-07 03:51:22,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-11-07 03:51:22,454 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 751 mSDsluCounter, 3088 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:51:22,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 3863 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:51:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states.
[2024-11-07 03:51:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 534.
[2024-11-07 03:51:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.4896810506566605) internal successors, (794), 533 states have internal predecessors, (794), 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:51:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 794 transitions.
[2024-11-07 03:51:22,473 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 794 transitions. Word has length 44
[2024-11-07 03:51:22,473 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:51:22,474 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 794 transitions.
[2024-11-07 03:51:22,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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:51:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 794 transitions.
[2024-11-07 03:51:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2024-11-07 03:51:22,475 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:51:22,475 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:51:22,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 03:51:22,475 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:51:22,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:51:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1978279468, now seen corresponding path program 1 times
[2024-11-07 03:51:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:51:22,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536985544]
[2024-11-07 03:51:22,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:51:22,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:51:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:51:22,662 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:51:22,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 03:51:22,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536985544]
[2024-11-07 03:51:22,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536985544] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:51:22,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:51:22,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 03:51:22,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765758506]
[2024-11-07 03:51:22,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:51:22,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 03:51:22,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 03:51:22,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 03:51:22,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 03:51:22,666 INFO L87 Difference]: Start difference. First operand 534 states and 794 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:51:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:51:23,233 INFO L93 Difference]: Finished difference Result 1108 states and 1643 transitions.
[2024-11-07 03:51:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 03:51:23,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 45
[2024-11-07 03:51:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:51:23,236 INFO L225 Difference]: With dead ends: 1108
[2024-11-07 03:51:23,236 INFO L226 Difference]: Without dead ends: 628
[2024-11-07 03:51:23,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 03:51:23,238 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 1011 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 03:51:23,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 1782 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 03:51:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states.
[2024-11-07 03:51:23,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 542.
[2024-11-07 03:51:23,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.4861367837338262) internal successors, (804), 541 states have internal predecessors, (804), 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:51:23,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 804 transitions.
[2024-11-07 03:51:23,251 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 804 transitions. Word has length 45
[2024-11-07 03:51:23,251 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:51:23,252 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 804 transitions.
[2024-11-07 03:51:23,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:51:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 804 transitions.
[2024-11-07 03:51:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2024-11-07 03:51:23,253 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:51:23,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:51:23,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 03:51:23,253 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:51:23,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:51:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1772973075, now seen corresponding path program 1 times
[2024-11-07 03:51:23,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 03:51:23,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736246553]
[2024-11-07 03:51:23,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:51:23,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 03:51:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 03:51:23,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 03:51:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 03:51:23,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 03:51:23,381 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 03:51:23,381 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 03:51:23,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 03:51:23,386 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:51:23,451 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 03:51:23,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:51:23 BoogieIcfgContainer
[2024-11-07 03:51:23,455 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 03:51:23,457 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 03:51:23,457 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 03:51:23,457 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 03:51:23,458 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:51:18" (3/4) ...
[2024-11-07 03:51:23,460 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 03:51:23,460 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 03:51:23,461 INFO L158 Benchmark]: Toolchain (without parser) took 8744.51ms. Allocated memory was 100.7MB in the beginning and 310.4MB in the end (delta: 209.7MB). Free memory was 75.6MB in the beginning and 179.9MB in the end (delta: -104.3MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB.
[2024-11-07 03:51:23,461 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 03:51:23,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.51ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 63.8MB in the end (delta: 11.6MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB.
[2024-11-07 03:51:23,462 INFO L158 Benchmark]: Boogie Procedure Inliner took 335.60ms. Allocated memory is still 100.7MB. Free memory was 63.8MB in the beginning and 33.5MB in the end (delta: 30.3MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB.
[2024-11-07 03:51:23,462 INFO L158 Benchmark]: Boogie Preprocessor took 487.04ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 33.5MB in the beginning and 162.7MB in the end (delta: -129.2MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB.
[2024-11-07 03:51:23,462 INFO L158 Benchmark]: RCFGBuilder took 2765.70ms. Allocated memory is still 234.9MB. Free memory was 162.7MB in the beginning and 123.0MB in the end (delta: 39.7MB). Peak memory consumption was 103.2MB. Max. memory is 16.1GB.
[2024-11-07 03:51:23,462 INFO L158 Benchmark]: TraceAbstraction took 4541.17ms. Allocated memory was 234.9MB in the beginning and 310.4MB in the end (delta: 75.5MB). Free memory was 121.4MB in the beginning and 179.9MB in the end (delta: -58.5MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB.
[2024-11-07 03:51:23,463 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 310.4MB. Free memory was 179.9MB in the beginning and 179.9MB in the end (delta: 20.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 03:51:23,466 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.45ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 603.51ms. Allocated memory is still 100.7MB. Free memory was 75.4MB in the beginning and 63.8MB in the end (delta: 11.6MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 335.60ms. Allocated memory is still 100.7MB. Free memory was 63.8MB in the beginning and 33.5MB in the end (delta: 30.3MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 487.04ms. Allocated memory was 100.7MB in the beginning and 234.9MB in the end (delta: 134.2MB). Free memory was 33.5MB in the beginning and 162.7MB in the end (delta: -129.2MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 2765.70ms. Allocated memory is still 234.9MB. Free memory was 162.7MB in the beginning and 123.0MB in the end (delta: 39.7MB). Peak memory consumption was 103.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 4541.17ms. Allocated memory was 234.9MB in the beginning and 310.4MB in the end (delta: 75.5MB). Free memory was 121.4MB in the beginning and 179.9MB in the end (delta: -58.5MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB.
* Witness Printer took 3.55ms. Allocated memory is still 310.4MB. Free memory was 179.9MB in the beginning and 179.9MB in the end (delta: 20.7kB). 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 bitwiseAnd at line 165.
Possible FailurePath:
[L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1);
[L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1);
[L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5);
[L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1);
[L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12);
[L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1);
[L35] const SORT_45 mask_SORT_45 = (SORT_45)-1 >> (sizeof(SORT_45) * 8 - 3);
[L36] const SORT_45 msb_SORT_45 = (SORT_45)1 << (3 - 1);
[L38] const SORT_86 mask_SORT_86 = (SORT_86)-1 >> (sizeof(SORT_86) * 8 - 4);
[L39] const SORT_86 msb_SORT_86 = (SORT_86)1 << (4 - 1);
[L41] const SORT_143 mask_SORT_143 = (SORT_143)-1 >> (sizeof(SORT_143) * 8 - 32);
[L42] const SORT_143 msb_SORT_143 = (SORT_143)1 << (32 - 1);
[L44] const SORT_167 mask_SORT_167 = (SORT_167)-1 >> (sizeof(SORT_167) * 8 - 2);
[L45] const SORT_167 msb_SORT_167 = (SORT_167)1 << (2 - 1);
[L47] const SORT_3 var_7 = 0;
[L48] const SORT_1 var_11 = 0;
[L49] const SORT_1 var_20 = 1;
[L50] const SORT_5 var_32 = 0;
[L51] const SORT_45 var_46 = 0;
[L52] const SORT_45 var_50 = 2;
[L53] const SORT_45 var_54 = 1;
[L54] const SORT_45 var_59 = 4;
[L55] const SORT_45 var_61 = 5;
[L56] const SORT_45 var_65 = 3;
[L57] const SORT_3 var_73 = 2;
[L58] const SORT_45 var_103 = 7;
[L59] const SORT_45 var_108 = 6;
[L60] const SORT_143 var_145 = 0;
[L61] const SORT_3 var_176 = 31;
[L63] SORT_1 input_2;
[L64] SORT_3 input_4;
[L65] SORT_5 input_6;
[L66] SORT_3 input_164;
[L67] SORT_3 input_165;
[L68] SORT_3 input_166;
[L69] SORT_3 input_175;
[L70] SORT_3 input_185;
[L71] SORT_3 input_186;
[L72] SORT_3 input_187;
[L73] SORT_3 input_190;
[L74] SORT_3 input_209;
[L75] SORT_3 input_210;
[L76] SORT_3 input_211;
[L77] SORT_3 input_214;
[L78] SORT_3 input_216;
[L79] SORT_167 input_230;
[L80] SORT_167 input_231;
[L81] SORT_167 input_232;
[L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L83] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L84] SORT_3 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L85] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L86] SORT_3 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L87] SORT_3 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_5=4095, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L88] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1;
[L89] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L89] SORT_5 state_33 = __VERIFIER_nondet_ushort() & mask_SORT_5;
[L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L90] SORT_3 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L91] SORT_3 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L92] SORT_3 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L93] SORT_3 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L94] SORT_3 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_3;
[L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_45
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_32=0, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L95] SORT_45 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_45;
[L97] SORT_3 init_9_arg_1 = var_7;
[L98] state_8 = init_9_arg_1
[L99] SORT_3 init_14_arg_1 = var_7;
[L100] state_13 = init_14_arg_1
[L101] SORT_3 init_25_arg_1 = var_7;
[L102] state_24 = init_25_arg_1
[L103] SORT_3 init_27_arg_1 = var_7;
[L104] state_26 = init_27_arg_1
[L105] SORT_3 init_29_arg_1 = var_7;
[L106] state_28 = init_29_arg_1
[L107] SORT_1 init_31_arg_1 = var_11;
[L108] state_30 = init_31_arg_1
[L109] SORT_5 init_34_arg_1 = var_32;
[L110] state_33 = init_34_arg_1
[L111] SORT_3 init_36_arg_1 = var_7;
[L112] state_35 = init_36_arg_1
[L113] SORT_3 init_38_arg_1 = var_7;
[L114] state_37 = init_38_arg_1
[L115] SORT_3 init_40_arg_1 = var_7;
[L116] state_39 = init_40_arg_1
[L117] SORT_3 init_42_arg_1 = var_7;
[L118] state_41 = init_42_arg_1
[L119] SORT_3 init_44_arg_1 = var_7;
[L120] state_43 = init_44_arg_1
[L121] SORT_45 init_48_arg_1 = var_46;
[L122] state_47 = init_48_arg_1
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L125] input_2 = __VERIFIER_nondet_uchar()
[L126] input_4 = __VERIFIER_nondet_uchar()
[L127] input_6 = __VERIFIER_nondet_ushort()
[L128] input_164 = __VERIFIER_nondet_uchar()
[L129] input_165 = __VERIFIER_nondet_uchar()
[L130] input_166 = __VERIFIER_nondet_uchar()
[L131] input_175 = __VERIFIER_nondet_uchar()
[L132] input_185 = __VERIFIER_nondet_uchar()
[L133] input_186 = __VERIFIER_nondet_uchar()
[L134] input_187 = __VERIFIER_nondet_uchar()
[L135] input_190 = __VERIFIER_nondet_uchar()
[L136] input_209 = __VERIFIER_nondet_uchar()
[L137] input_210 = __VERIFIER_nondet_uchar()
[L138] input_211 = __VERIFIER_nondet_uchar()
[L139] input_214 = __VERIFIER_nondet_uchar()
[L140] input_216 = __VERIFIER_nondet_uchar()
[L141] input_230 = __VERIFIER_nondet_uchar()
[L142] input_231 = __VERIFIER_nondet_uchar()
[L143] input_232 = __VERIFIER_nondet_uchar()
[L146] SORT_3 var_10_arg_0 = state_8;
[L147] SORT_1 var_10 = var_10_arg_0 >> 0;
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_10=0, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L148] EXPR var_10 & mask_SORT_1
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L148] var_10 = var_10 & mask_SORT_1
[L149] SORT_1 var_12_arg_0 = var_10;
[L150] SORT_1 var_12_arg_1 = var_11;
[L151] SORT_1 var_12 = var_12_arg_0 == var_12_arg_1;
[L152] SORT_3 var_15_arg_0 = state_13;
[L153] SORT_1 var_15 = var_15_arg_0 >> 0;
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_12=1, var_145=0, var_15=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L154] EXPR var_15 & mask_SORT_1
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_12=1, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L154] var_15 = var_15 & mask_SORT_1
[L155] SORT_1 var_16_arg_0 = var_15;
[L156] SORT_1 var_16_arg_1 = var_11;
[L157] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1;
[L158] SORT_1 var_17_arg_0 = var_12;
[L159] SORT_1 var_17_arg_1 = var_16;
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_17_arg_0=1, var_17_arg_1=1, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L160] EXPR var_17_arg_0 & var_17_arg_1
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L160] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1;
[L161] SORT_1 var_21_arg_0 = var_17;
[L162] SORT_1 var_21 = ~var_21_arg_0;
[L163] SORT_1 var_22_arg_0 = var_20;
[L164] SORT_1 var_22_arg_1 = var_21;
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_22_arg_0=1, var_22_arg_1=-2, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L165] EXPR var_22_arg_0 & var_22_arg_1
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L165] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1;
[L166] EXPR var_22 & mask_SORT_1
VAL [mask_SORT_167=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_45=7, mask_SORT_86=15, state_13=0, state_24=0, state_26=0, state_28=0, state_30=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_47=0, state_8=0, var_103=7, var_108=6, var_11=0, var_145=0, var_176=31, var_20=1, var_46=0, var_50=2, var_54=1, var_59=4, var_61=5, var_65=3, var_73=2, var_7=0]
[L166] var_22 = var_22 & mask_SORT_1
[L167] SORT_1 bad_23_arg_0 = var_22;
[L168] CALL __VERIFIER_assert(!(bad_23_arg_0))
[L21] COND TRUE !(cond)
[L21] reach_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 531 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3293 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3293 mSDsluCounter, 15799 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11294 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743 IncrementalHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 4505 mSDtfsCounter, 743 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=542occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 95 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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:51:23,499 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_arrays_vsaR_p02.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 c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 03:51:25,709 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 03:51:25,817 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:51:25,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 03:51:25,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 03:51:25,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 03:51:25,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 03:51:25,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 03:51:25,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 03:51:25,853 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 03:51:25,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 03:51:25,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 03:51:25,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 03:51:25,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 03:51:25,855 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 03:51:25,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 03:51:25,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 03:51:25,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 03:51:25,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 03:51:25,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 03:51:25,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 03:51:25,856 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 03:51:25,856 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 03:51:25,856 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 03:51:25,856 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 03:51:25,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 03:51:25,856 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 03:51:25,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 03:51:25,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 03:51:25,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 03:51:25,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 03:51:25,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 03:51:25,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 03:51:25,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 03:51:25,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 03:51:25,858 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 03:51:25,858 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 03:51:25,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 03:51:25,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 03:51:25,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 03:51:25,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 03:51:25,859 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 -> c9237163e2805f66062dc578af6664f7122718fcb3464bd31fd071298f5647b0
[2024-11-07 03:51:26,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 03:51:26,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 03:51:26,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 03:51:26,206 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 03:51:26,206 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 03:51:26,207 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_arrays_vsaR_p02.c
[2024-11-07 03:51:27,543 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 03:51:27,853 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 03:51:27,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p02.c
[2024-11-07 03:51:27,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a598ae85f/5e955da3a3984921a522730271384271/FLAG0a31c9c0a
[2024-11-07 03:51:27,898 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a598ae85f/5e955da3a3984921a522730271384271
[2024-11-07 03:51:27,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 03:51:27,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 03:51:27,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 03:51:27,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 03:51:27,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 03:51:27,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:51:27" (1/1) ...
[2024-11-07 03:51:27,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f27cd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:27, skipping insertion in model container
[2024-11-07 03:51:27,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:51:27" (1/1) ...
[2024-11-07 03:51:27,967 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 03:51:28,134 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_arrays_vsaR_p02.c[1259,1272]
[2024-11-07 03:51:28,350 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 03:51:28,367 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 03:51:28,375 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_arrays_vsaR_p02.c[1259,1272]
[2024-11-07 03:51:28,482 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 03:51:28,495 INFO L204 MainTranslator]: Completed translation
[2024-11-07 03:51:28,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:28 WrapperNode
[2024-11-07 03:51:28,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 03:51:28,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 03:51:28,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 03:51:28,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 03:51:28,505 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:51:28" (1/1) ...
[2024-11-07 03:51:28,562 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:51:28" (1/1) ...
[2024-11-07 03:51:28,631 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1072
[2024-11-07 03:51:28,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 03:51:28,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 03:51:28,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 03:51:28,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 03:51:28,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:28" (1/1) ...
[2024-11-07 03:51:28,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:28" (1/1) ...
[2024-11-07 03:51:28,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:28" (1/1) ...
[2024-11-07 03:51:28,685 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:51:28,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:28" (1/1) ...
[2024-11-07 03:51:28,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:28" (1/1) ...
[2024-11-07 03:51:28,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:28" (1/1) ...
[2024-11-07 03:51:28,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:28" (1/1) ...
[2024-11-07 03:51:28,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:28" (1/1) ...
[2024-11-07 03:51:28,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:28" (1/1) ...
[2024-11-07 03:51:28,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 03:51:28,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 03:51:28,738 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 03:51:28,738 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 03:51:28,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:28" (1/1) ...
[2024-11-07 03:51:28,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 03:51:28,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 03:51:28,777 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:51:28,781 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:51:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 03:51:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 03:51:28,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 03:51:28,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 03:51:29,100 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 03:51:29,101 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 03:51:30,794 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live.
[2024-11-07 03:51:30,794 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 03:51:30,803 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 03:51:30,804 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 03:51:30,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:51:30 BoogieIcfgContainer
[2024-11-07 03:51:30,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 03:51:30,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 03:51:30,809 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 03:51:30,815 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 03:51:30,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:51:27" (1/3) ...
[2024-11-07 03:51:30,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583b6e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:51:30, skipping insertion in model container
[2024-11-07 03:51:30,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:51:28" (2/3) ...
[2024-11-07 03:51:30,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@583b6e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:51:30, skipping insertion in model container
[2024-11-07 03:51:30,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:51:30" (3/3) ...
[2024-11-07 03:51:30,817 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p02.c
[2024-11-07 03:51:30,834 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 03:51:30,835 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 03:51:30,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 03:51:30,897 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;@76c631c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 03:51:30,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 03:51:30,903 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:51:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2024-11-07 03:51:30,908 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:51:30,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2024-11-07 03:51:30,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:51:30,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:51:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times
[2024-11-07 03:51:30,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 03:51:30,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213977022]
[2024-11-07 03:51:30,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:51:30,927 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:51:30,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 03:51:30,931 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:51:30,933 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:51:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:51:31,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 28 conjuncts are in the unsatisfiable core
[2024-11-07 03:51:31,229 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:51:31,440 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:51:31,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 03:51:31,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 03:51:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213977022]
[2024-11-07 03:51:31,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213977022] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 03:51:31,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 03:51:31,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 03:51:31,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164279525]
[2024-11-07 03:51:31,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 03:51:31,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 03:51:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 03:51:31,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 03:51:31,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 03:51:31,468 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:51:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:51:31,556 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions.
[2024-11-07 03:51:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 03:51:31,559 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:51:31,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:51:31,564 INFO L225 Difference]: With dead ends: 18
[2024-11-07 03:51:31,564 INFO L226 Difference]: Without dead ends: 10
[2024-11-07 03:51:31,567 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:51:31,571 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:51:31,572 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.1s Time]
[2024-11-07 03:51:31,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states.
[2024-11-07 03:51:31,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9.
[2024-11-07 03:51:31,593 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:51:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions.
[2024-11-07 03:51:31,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5
[2024-11-07 03:51:31,597 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:51:31,597 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions.
[2024-11-07 03:51:31,598 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:51:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions.
[2024-11-07 03:51:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2024-11-07 03:51:31,599 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:51:31,599 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1]
[2024-11-07 03:51:31,604 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:51:31,803 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:51:31,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:51:31,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:51:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times
[2024-11-07 03:51:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 03:51:31,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519867719]
[2024-11-07 03:51:31,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 03:51:31,806 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:51:31,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 03:51:31,809 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:51:31,810 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:51:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 03:51:32,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 33 conjuncts are in the unsatisfiable core
[2024-11-07 03:51:32,272 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:51:32,601 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:51:32,602 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 03:51:34,699 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:51:34,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 03:51:34,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519867719]
[2024-11-07 03:51:34,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519867719] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 03:51:34,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 03:51:34,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2024-11-07 03:51:34,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89755329]
[2024-11-07 03:51:34,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 03:51:34,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 03:51:34,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 03:51:34,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 03:51:34,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-11-07 03:51:34,703 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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:51:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:51:34,912 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2024-11-07 03:51:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 03:51:34,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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:51:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:51:34,913 INFO L225 Difference]: With dead ends: 15
[2024-11-07 03:51:34,913 INFO L226 Difference]: Without dead ends: 13
[2024-11-07 03:51:34,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2024-11-07 03:51:34,915 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 03:51:34,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 03:51:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2024-11-07 03:51:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12.
[2024-11-07 03:51:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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:51:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions.
[2024-11-07 03:51:34,918 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8
[2024-11-07 03:51:34,918 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:51:34,918 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions.
[2024-11-07 03:51:34,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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:51:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions.
[2024-11-07 03:51:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2024-11-07 03:51:34,919 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:51:34,919 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2024-11-07 03:51:34,924 INFO L540 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)] Forceful destruction successful, exit code 0
[2024-11-07 03:51:35,123 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:51:35,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:51:35,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:51:35,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times
[2024-11-07 03:51:35,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 03:51:35,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348294697]
[2024-11-07 03:51:35,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-07 03:51:35,127 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:51:35,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 03:51:35,130 INFO L229 MonitoredProcess]: Starting monitored process 4 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:51:35,131 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 (4)] Waiting until timeout for monitored process
[2024-11-07 03:51:35,699 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-07 03:51:35,699 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 03:51:35,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 39 conjuncts are in the unsatisfiable core
[2024-11-07 03:51:35,727 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:51:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:51:36,241 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 03:52:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:52:18,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 03:52:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348294697]
[2024-11-07 03:52:18,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348294697] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 03:52:18,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-07 03:52:18,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10
[2024-11-07 03:52:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303686358]
[2024-11-07 03:52:18,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-07 03:52:18,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-07 03:52:18,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 03:52:18,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-07 03:52:18,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-11-07 03:52:18,166 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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:52:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 03:52:18,642 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions.
[2024-11-07 03:52:18,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 03:52:18,642 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 11
[2024-11-07 03:52:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 03:52:18,643 INFO L225 Difference]: With dead ends: 18
[2024-11-07 03:52:18,643 INFO L226 Difference]: Without dead ends: 16
[2024-11-07 03:52:18,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182
[2024-11-07 03:52:18,644 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 03:52:18,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 23 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 03:52:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2024-11-07 03:52:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15.
[2024-11-07 03:52:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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:52:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions.
[2024-11-07 03:52:18,649 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11
[2024-11-07 03:52:18,650 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 03:52:18,650 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions.
[2024-11-07 03:52:18,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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:52:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2024-11-07 03:52:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2024-11-07 03:52:18,651 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 03:52:18,651 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1]
[2024-11-07 03:52:18,659 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 (4)] Ended with exit code 0
[2024-11-07 03:52:18,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:52:18,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 03:52:18,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 03:52:18,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times
[2024-11-07 03:52:18,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 03:52:18,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056950023]
[2024-11-07 03:52:18,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-07 03:52:18,857 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:52:18,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 03:52:18,859 INFO L229 MonitoredProcess]: Starting monitored process 5 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:52:18,862 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 (5)] Waiting until timeout for monitored process
[2024-11-07 03:52:19,443 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2024-11-07 03:52:19,444 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-07 03:52:19,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 58 conjuncts are in the unsatisfiable core
[2024-11-07 03:52:19,473 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 03:52:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 03:52:20,004 INFO L311 TraceCheckSpWp]: Computing backward predicates...