./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
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/hardness-nfm22/hardness_codestructure_steplocals_file-84.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 04:26:26,189 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 04:26:26,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 04:26:26,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 04:26:26,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 04:26:26,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 04:26:26,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 04:26:26,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 04:26:26,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 04:26:26,303 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 04:26:26,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 04:26:26,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 04:26:26,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 04:26:26,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 04:26:26,304 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 04:26:26,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 04:26:26,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 04:26:26,306 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 04:26:26,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 04:26:26,306 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 04:26:26,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 04:26:26,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 04:26:26,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 04:26:26,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 04:26:26,307 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 04:26:26,307 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 04:26:26,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 04:26:26,307 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 04:26:26,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 04:26:26,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 04:26:26,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 04:26:26,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 04:26:26,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 04:26:26,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 04:26:26,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 04:26:26,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 04:26:26,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 04:26:26,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 04:26:26,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 04:26:26,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 04:26:26,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 04:26:26,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 04:26:26,308 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d
[2024-11-07 04:26:26,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 04:26:26,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 04:26:26,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 04:26:26,636 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 04:26:26,636 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 04:26:26,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i
[2024-11-07 04:26:27,968 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 04:26:28,254 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 04:26:28,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i
[2024-11-07 04:26:28,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77dfe1d72/858f9bdaa8f84012bbb0480958b073af/FLAG398b933cb
[2024-11-07 04:26:28,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/77dfe1d72/858f9bdaa8f84012bbb0480958b073af
[2024-11-07 04:26:28,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 04:26:28,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 04:26:28,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 04:26:28,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 04:26:28,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 04:26:28,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5698c391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28, skipping insertion in model container
[2024-11-07 04:26:28,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,319 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 04:26:28,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i[917,930]
[2024-11-07 04:26:28,546 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 04:26:28,564 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 04:26:28,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i[917,930]
[2024-11-07 04:26:28,608 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 04:26:28,626 INFO L204 MainTranslator]: Completed translation
[2024-11-07 04:26:28,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28 WrapperNode
[2024-11-07 04:26:28,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 04:26:28,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 04:26:28,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 04:26:28,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 04:26:28,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,694 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194
[2024-11-07 04:26:28,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 04:26:28,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 04:26:28,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 04:26:28,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 04:26:28,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,734 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 04:26:28,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 04:26:28,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 04:26:28,774 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 04:26:28,775 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 04:26:28,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (1/1) ...
[2024-11-07 04:26:28,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 04:26:28,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 04:26:28,808 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 04:26:28,814 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 04:26:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 04:26:28,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 04:26:28,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 04:26:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 04:26:28,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 04:26:28,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 04:26:28,921 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 04:26:28,923 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 04:26:29,346 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live.
[2024-11-07 04:26:29,347 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 04:26:29,356 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 04:26:29,356 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 04:26:29,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:26:29 BoogieIcfgContainer
[2024-11-07 04:26:29,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 04:26:29,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 04:26:29,359 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 04:26:29,363 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 04:26:29,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:26:28" (1/3) ...
[2024-11-07 04:26:29,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e111917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:26:29, skipping insertion in model container
[2024-11-07 04:26:29,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:28" (2/3) ...
[2024-11-07 04:26:29,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e111917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:26:29, skipping insertion in model container
[2024-11-07 04:26:29,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:26:29" (3/3) ...
[2024-11-07 04:26:29,366 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-84.i
[2024-11-07 04:26:29,377 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 04:26:29,377 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 04:26:29,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 04:26:29,435 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;@1557ca67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 04:26:29,435 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 04:26:29,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-07 04:26:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2024-11-07 04:26:29,450 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:26:29,450 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:26:29,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:26:29,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:26:29,455 INFO L85 PathProgramCache]: Analyzing trace with hash -480624851, now seen corresponding path program 1 times
[2024-11-07 04:26:29,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:26:29,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373584331]
[2024-11-07 04:26:29,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:26:29,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:26:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:26:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:26:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:26:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:26:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:26:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:26:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:26:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:26:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:26:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:26:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:26:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:26:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:26:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:26:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:26:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:26:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:26:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:26:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:26:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:26:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:26:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:26:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:26:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:26:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:26:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:26:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:26:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:26:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373584331]
[2024-11-07 04:26:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373584331] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:26:29,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:26:29,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 04:26:29,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601331832]
[2024-11-07 04:26:29,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:26:29,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 04:26:29,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:26:30,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 04:26:30,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 04:26:30,020 INFO L87 Difference]: Start difference. First operand has 87 states, 58 states have (on average 1.396551724137931) internal successors, (81), 59 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-07 04:26:30,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:26:30,052 INFO L93 Difference]: Finished difference Result 167 states and 286 transitions.
[2024-11-07 04:26:30,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 04:26:30,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 167
[2024-11-07 04:26:30,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:26:30,059 INFO L225 Difference]: With dead ends: 167
[2024-11-07 04:26:30,061 INFO L226 Difference]: Without dead ends: 83
[2024-11-07 04:26:30,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 04:26:30,069 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 04:26:30,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 04:26:30,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2024-11-07 04:26:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2024-11-07 04:26:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-07 04:26:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 126 transitions.
[2024-11-07 04:26:30,115 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 126 transitions. Word has length 167
[2024-11-07 04:26:30,115 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:26:30,115 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 126 transitions.
[2024-11-07 04:26:30,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-07 04:26:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 126 transitions.
[2024-11-07 04:26:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2024-11-07 04:26:30,120 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:26:30,120 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:26:30,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 04:26:30,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:26:30,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:26:30,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1430748969, now seen corresponding path program 1 times
[2024-11-07 04:26:30,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:26:30,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370972554]
[2024-11-07 04:26:30,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:26:30,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:26:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:26:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:26:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:26:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:26:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:26:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:26:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:26:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:26:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:26:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:26:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:26:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:26:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:26:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:26:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:26:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:26:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:26:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:26:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:26:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:26:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:26:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:26:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:26:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:26:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:26:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:26:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:26:37,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:26:37,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370972554]
[2024-11-07 04:26:37,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370972554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:26:37,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:26:37,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 04:26:37,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738736230]
[2024-11-07 04:26:37,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:26:37,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 04:26:37,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:26:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 04:26:37,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-07 04:26:37,872 INFO L87 Difference]: Start difference. First operand 83 states and 126 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:26:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:26:39,250 INFO L93 Difference]: Finished difference Result 199 states and 300 transitions.
[2024-11-07 04:26:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 04:26:39,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167
[2024-11-07 04:26:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:26:39,253 INFO L225 Difference]: With dead ends: 199
[2024-11-07 04:26:39,254 INFO L226 Difference]: Without dead ends: 119
[2024-11-07 04:26:39,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-07 04:26:39,255 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 126 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-07 04:26:39,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 319 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-07 04:26:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2024-11-07 04:26:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 99.
[2024-11-07 04:26:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-07 04:26:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 151 transitions.
[2024-11-07 04:26:39,273 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 151 transitions. Word has length 167
[2024-11-07 04:26:39,277 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:26:39,278 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 151 transitions.
[2024-11-07 04:26:39,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:26:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 151 transitions.
[2024-11-07 04:26:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2024-11-07 04:26:39,283 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:26:39,284 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:26:39,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 04:26:39,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:26:39,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:26:39,285 INFO L85 PathProgramCache]: Analyzing trace with hash -930101558, now seen corresponding path program 1 times
[2024-11-07 04:26:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:26:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740918018]
[2024-11-07 04:26:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:26:39,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:26:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:26:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:26:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:26:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:26:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:26:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:26:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:26:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:26:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:26:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:26:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:26:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:26:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:26:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:26:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:26:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:26:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:26:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:26:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:26:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:26:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:26:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:26:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:26:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:26:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:26:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:26:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:26:45,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:26:45,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740918018]
[2024-11-07 04:26:45,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740918018] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:26:45,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:26:45,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 04:26:45,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678549440]
[2024-11-07 04:26:45,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:26:45,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 04:26:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:26:45,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 04:26:45,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 04:26:45,968 INFO L87 Difference]: Start difference. First operand 99 states and 151 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:26:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:26:46,704 INFO L93 Difference]: Finished difference Result 197 states and 301 transitions.
[2024-11-07 04:26:46,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 04:26:46,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168
[2024-11-07 04:26:46,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:26:46,711 INFO L225 Difference]: With dead ends: 197
[2024-11-07 04:26:46,711 INFO L226 Difference]: Without dead ends: 101
[2024-11-07 04:26:46,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-11-07 04:26:46,714 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 115 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 04:26:46,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 285 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 04:26:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2024-11-07 04:26:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83.
[2024-11-07 04:26:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26)
[2024-11-07 04:26:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions.
[2024-11-07 04:26:46,730 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 168
[2024-11-07 04:26:46,731 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:26:46,733 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions.
[2024-11-07 04:26:46,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:26:46,734 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions.
[2024-11-07 04:26:46,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2024-11-07 04:26:46,738 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:26:46,738 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:26:46,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 04:26:46,739 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:26:46,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:26:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash 351059748, now seen corresponding path program 1 times
[2024-11-07 04:26:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:26:46,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019199206]
[2024-11-07 04:26:46,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:26:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:26:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:49,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:26:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:26:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:26:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:26:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:26:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:26:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:26:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:26:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:26:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:26:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:26:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:26:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:26:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:26:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:26:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:26:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:26:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:26:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:26:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:26:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:26:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:26:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:26:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:26:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:26:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:26:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:26:50,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:26:50,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019199206]
[2024-11-07 04:26:50,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019199206] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:26:50,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:26:50,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-07 04:26:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794989794]
[2024-11-07 04:26:50,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:26:50,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-07 04:26:50,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:26:50,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-07 04:26:50,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-11-07 04:26:50,128 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-07 04:26:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:26:51,419 INFO L93 Difference]: Finished difference Result 353 states and 512 transitions.
[2024-11-07 04:26:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 04:26:51,420 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169
[2024-11-07 04:26:51,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:26:51,423 INFO L225 Difference]: With dead ends: 353
[2024-11-07 04:26:51,423 INFO L226 Difference]: Without dead ends: 273
[2024-11-07 04:26:51,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306
[2024-11-07 04:26:51,427 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 366 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-07 04:26:51,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 686 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-07 04:26:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states.
[2024-11-07 04:26:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 241.
[2024-11-07 04:26:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 178 states have (on average 1.3426966292134832) internal successors, (239), 180 states have internal predecessors, (239), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58)
[2024-11-07 04:26:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 355 transitions.
[2024-11-07 04:26:51,482 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 355 transitions. Word has length 169
[2024-11-07 04:26:51,482 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:26:51,484 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 355 transitions.
[2024-11-07 04:26:51,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-07 04:26:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 355 transitions.
[2024-11-07 04:26:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2024-11-07 04:26:51,489 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:26:51,490 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:26:51,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 04:26:51,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:26:51,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:26:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash -928803930, now seen corresponding path program 1 times
[2024-11-07 04:26:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:26:51,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858251352]
[2024-11-07 04:26:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:26:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:26:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:26:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:26:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:26:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:26:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:26:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:26:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:26:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:26:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:26:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:26:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:26:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:26:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:26:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:26:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:26:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:26:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:26:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:26:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:26:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:26:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:26:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:26:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:26:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:26:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:26:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:26:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:26:54,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:26:54,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858251352]
[2024-11-07 04:26:54,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858251352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:26:54,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:26:54,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-11-07 04:26:54,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482488023]
[2024-11-07 04:26:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:26:54,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-07 04:26:54,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:26:54,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-07 04:26:54,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-11-07 04:26:54,294 INFO L87 Difference]: Start difference. First operand 241 states and 355 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-07 04:26:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:26:55,437 INFO L93 Difference]: Finished difference Result 490 states and 716 transitions.
[2024-11-07 04:26:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 04:26:55,439 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169
[2024-11-07 04:26:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:26:55,441 INFO L225 Difference]: With dead ends: 490
[2024-11-07 04:26:55,441 INFO L226 Difference]: Without dead ends: 252
[2024-11-07 04:26:55,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306
[2024-11-07 04:26:55,443 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 383 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-07 04:26:55,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 518 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-07 04:26:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states.
[2024-11-07 04:26:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 232.
[2024-11-07 04:26:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 169 states have (on average 1.3372781065088757) internal successors, (226), 171 states have internal predecessors, (226), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58)
[2024-11-07 04:26:55,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions.
[2024-11-07 04:26:55,481 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 169
[2024-11-07 04:26:55,483 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:26:55,484 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions.
[2024-11-07 04:26:55,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-07 04:26:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions.
[2024-11-07 04:26:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2024-11-07 04:26:55,485 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:26:55,486 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:26:55,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 04:26:55,486 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:26:55,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:26:55,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1237288154, now seen corresponding path program 1 times
[2024-11-07 04:26:55,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:26:55,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529750836]
[2024-11-07 04:26:55,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:26:55,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:26:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:26:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:26:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:26:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:26:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:26:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:26:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:26:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:26:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:26:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:26:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:26:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:26:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:26:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:26:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:26:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:26:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:26:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:26:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:26:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:26:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:26:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:26:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:26:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:26:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:26:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:26:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:26:56,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:26:56,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529750836]
[2024-11-07 04:26:56,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529750836] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:26:56,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:26:56,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-07 04:26:56,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910621697]
[2024-11-07 04:26:56,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:26:56,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-07 04:26:56,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:26:56,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-07 04:26:56,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-11-07 04:26:56,995 INFO L87 Difference]: Start difference. First operand 232 states and 342 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:26:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:26:58,042 INFO L93 Difference]: Finished difference Result 513 states and 741 transitions.
[2024-11-07 04:26:58,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 04:26:58,043 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169
[2024-11-07 04:26:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:26:58,048 INFO L225 Difference]: With dead ends: 513
[2024-11-07 04:26:58,049 INFO L226 Difference]: Without dead ends: 284
[2024-11-07 04:26:58,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272
[2024-11-07 04:26:58,051 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 257 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-07 04:26:58,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 597 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-07 04:26:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states.
[2024-11-07 04:26:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 219.
[2024-11-07 04:26:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 156 states have (on average 1.3333333333333333) internal successors, (208), 158 states have internal predecessors, (208), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58)
[2024-11-07 04:26:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 324 transitions.
[2024-11-07 04:26:58,082 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 324 transitions. Word has length 169
[2024-11-07 04:26:58,083 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:26:58,083 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 324 transitions.
[2024-11-07 04:26:58,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:26:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 324 transitions.
[2024-11-07 04:26:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2024-11-07 04:26:58,085 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:26:58,085 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:26:58,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 04:26:58,085 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:26:58,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:26:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1777815464, now seen corresponding path program 1 times
[2024-11-07 04:26:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:26:58,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521784785]
[2024-11-07 04:26:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:26:58,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:26:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:26:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:26:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:26:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:26:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:26:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:26:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:26:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:26:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:26:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:26:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:26:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:26:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:26:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:26:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:26:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:26:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:26:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:26:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:26:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:26:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:26:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:26:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:26:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:26:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:26:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:26:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:26:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:26:59,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:26:59,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521784785]
[2024-11-07 04:26:59,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521784785] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:26:59,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:26:59,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-07 04:26:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918713285]
[2024-11-07 04:26:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:26:59,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-07 04:26:59,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:26:59,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-07 04:26:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-11-07 04:26:59,814 INFO L87 Difference]: Start difference. First operand 219 states and 324 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:27:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:27:00,748 INFO L93 Difference]: Finished difference Result 475 states and 691 transitions.
[2024-11-07 04:27:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 04:27:00,750 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169
[2024-11-07 04:27:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:27:00,753 INFO L225 Difference]: With dead ends: 475
[2024-11-07 04:27:00,753 INFO L226 Difference]: Without dead ends: 263
[2024-11-07 04:27:00,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272
[2024-11-07 04:27:00,755 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 264 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-07 04:27:00,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 559 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-07 04:27:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states.
[2024-11-07 04:27:00,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 208.
[2024-11-07 04:27:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 147 states have internal predecessors, (192), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58)
[2024-11-07 04:27:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 308 transitions.
[2024-11-07 04:27:00,790 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 308 transitions. Word has length 169
[2024-11-07 04:27:00,791 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:27:00,791 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 308 transitions.
[2024-11-07 04:27:00,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:27:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 308 transitions.
[2024-11-07 04:27:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-07 04:27:00,795 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:27:00,796 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:27:00,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 04:27:00,796 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:27:00,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:27:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash 134084039, now seen corresponding path program 1 times
[2024-11-07 04:27:00,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:27:00,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439028147]
[2024-11-07 04:27:00,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:27:00,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:27:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:27:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:27:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:27:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:27:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:27:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:27:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:27:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:27:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:27:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:27:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:27:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:27:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:27:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:27:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:27:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:27:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:27:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:27:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:27:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:27:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:27:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:27:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:27:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:27:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:27:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:27:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:27:06,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:27:06,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439028147]
[2024-11-07 04:27:06,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439028147] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:27:06,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:27:06,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2024-11-07 04:27:06,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622259292]
[2024-11-07 04:27:06,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:27:06,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-07 04:27:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:27:06,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-07 04:27:06,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210
[2024-11-07 04:27:06,680 INFO L87 Difference]: Start difference. First operand 208 states and 308 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-07 04:27:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:27:10,140 INFO L93 Difference]: Finished difference Result 442 states and 634 transitions.
[2024-11-07 04:27:10,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-07 04:27:10,141 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170
[2024-11-07 04:27:10,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:27:10,144 INFO L225 Difference]: With dead ends: 442
[2024-11-07 04:27:10,144 INFO L226 Difference]: Without dead ends: 362
[2024-11-07 04:27:10,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420
[2024-11-07 04:27:10,145 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 466 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2024-11-07 04:27:10,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 663 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2024-11-07 04:27:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states.
[2024-11-07 04:27:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 294.
[2024-11-07 04:27:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 223 states have (on average 1.345291479820628) internal successors, (300), 227 states have internal predecessors, (300), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64)
[2024-11-07 04:27:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 428 transitions.
[2024-11-07 04:27:10,181 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 428 transitions. Word has length 170
[2024-11-07 04:27:10,181 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:27:10,181 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 428 transitions.
[2024-11-07 04:27:10,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-07 04:27:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 428 transitions.
[2024-11-07 04:27:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-07 04:27:10,184 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:27:10,184 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:27:10,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 04:27:10,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:27:10,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:27:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1145779639, now seen corresponding path program 1 times
[2024-11-07 04:27:10,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:27:10,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150847315]
[2024-11-07 04:27:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:27:10,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:27:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:27:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:27:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:27:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:27:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:27:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:27:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:27:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:27:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:27:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:27:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:27:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:27:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:27:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:27:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:27:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:27:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:27:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:27:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:27:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:27:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:27:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:27:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:27:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:27:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:27:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:27:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:27:15,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:27:15,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150847315]
[2024-11-07 04:27:15,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150847315] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:27:15,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:27:15,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2024-11-07 04:27:15,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544657241]
[2024-11-07 04:27:15,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:27:15,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-07 04:27:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:27:15,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-07 04:27:15,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210
[2024-11-07 04:27:15,446 INFO L87 Difference]: Start difference. First operand 294 states and 428 transitions. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-07 04:27:18,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:27:18,689 INFO L93 Difference]: Finished difference Result 507 states and 728 transitions.
[2024-11-07 04:27:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-07 04:27:18,690 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170
[2024-11-07 04:27:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:27:18,694 INFO L225 Difference]: With dead ends: 507
[2024-11-07 04:27:18,694 INFO L226 Difference]: Without dead ends: 341
[2024-11-07 04:27:18,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420
[2024-11-07 04:27:18,696 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 402 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1428 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2024-11-07 04:27:18,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 653 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1428 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2024-11-07 04:27:18,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states.
[2024-11-07 04:27:18,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 285.
[2024-11-07 04:27:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 214 states have (on average 1.341121495327103) internal successors, (287), 218 states have internal predecessors, (287), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 60 states have call predecessors, (64), 64 states have call successors, (64)
[2024-11-07 04:27:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 415 transitions.
[2024-11-07 04:27:18,730 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 415 transitions. Word has length 170
[2024-11-07 04:27:18,731 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:27:18,731 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 415 transitions.
[2024-11-07 04:27:18,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26)
[2024-11-07 04:27:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 415 transitions.
[2024-11-07 04:27:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-07 04:27:18,736 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:27:18,737 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:27:18,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-07 04:27:18,737 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:27:18,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:27:18,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1454263863, now seen corresponding path program 1 times
[2024-11-07 04:27:18,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:27:18,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845964297]
[2024-11-07 04:27:18,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:27:18,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:27:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:27:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:27:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:27:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:27:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:27:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:27:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:27:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:27:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:27:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:27:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:27:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:27:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:27:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:27:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:27:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:27:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:27:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:27:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:27:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:27:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:27:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:27:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:27:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:27:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:27:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:27:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:27:23,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:27:23,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845964297]
[2024-11-07 04:27:23,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845964297] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:27:23,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:27:23,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2024-11-07 04:27:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038074285]
[2024-11-07 04:27:23,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:27:23,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-07 04:27:23,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:27:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-07 04:27:23,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182
[2024-11-07 04:27:23,512 INFO L87 Difference]: Start difference. First operand 285 states and 415 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:27:26,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:27:26,239 INFO L93 Difference]: Finished difference Result 526 states and 747 transitions.
[2024-11-07 04:27:26,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-07 04:27:26,240 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170
[2024-11-07 04:27:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:27:26,246 INFO L225 Difference]: With dead ends: 526
[2024-11-07 04:27:26,246 INFO L226 Difference]: Without dead ends: 369
[2024-11-07 04:27:26,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272
[2024-11-07 04:27:26,248 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 268 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2024-11-07 04:27:26,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 936 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2024-11-07 04:27:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states.
[2024-11-07 04:27:26,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 303.
[2024-11-07 04:27:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 229 states have (on average 1.3406113537117903) internal successors, (307), 233 states have internal predecessors, (307), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66)
[2024-11-07 04:27:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 439 transitions.
[2024-11-07 04:27:26,287 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 439 transitions. Word has length 170
[2024-11-07 04:27:26,287 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:27:26,287 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 439 transitions.
[2024-11-07 04:27:26,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:27:26,287 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 439 transitions.
[2024-11-07 04:27:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-07 04:27:26,289 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:27:26,289 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:27:26,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 04:27:26,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:27:26,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:27:26,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1560839755, now seen corresponding path program 1 times
[2024-11-07 04:27:26,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:27:26,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461953216]
[2024-11-07 04:27:26,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:27:26,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:27:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:27:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:27:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:27:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:27:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:27:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:27:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:27:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:27:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:27:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:27:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:27:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:27:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:27:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:27:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:27:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:27:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:27:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:27:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:27:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:27:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:27:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:27:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:27:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:27:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:27:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:27:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:27:31,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:27:31,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461953216]
[2024-11-07 04:27:31,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461953216] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:27:31,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:27:31,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2024-11-07 04:27:31,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920070379]
[2024-11-07 04:27:31,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:27:31,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-07 04:27:31,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:27:31,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-07 04:27:31,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182
[2024-11-07 04:27:31,812 INFO L87 Difference]: Start difference. First operand 303 states and 439 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:27:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:27:35,892 INFO L93 Difference]: Finished difference Result 581 states and 820 transitions.
[2024-11-07 04:27:35,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-07 04:27:35,893 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170
[2024-11-07 04:27:35,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:27:35,896 INFO L225 Difference]: With dead ends: 581
[2024-11-07 04:27:35,896 INFO L226 Difference]: Without dead ends: 406
[2024-11-07 04:27:35,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272
[2024-11-07 04:27:35,898 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 140 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time
[2024-11-07 04:27:35,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1159 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time]
[2024-11-07 04:27:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states.
[2024-11-07 04:27:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 322.
[2024-11-07 04:27:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 245 states have (on average 1.3346938775510204) internal successors, (327), 250 states have internal predecessors, (327), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 63 states have call predecessors, (68), 68 states have call successors, (68)
[2024-11-07 04:27:35,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 463 transitions.
[2024-11-07 04:27:35,940 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 463 transitions. Word has length 170
[2024-11-07 04:27:35,940 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:27:35,940 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 463 transitions.
[2024-11-07 04:27:35,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:27:35,941 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 463 transitions.
[2024-11-07 04:27:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-07 04:27:35,942 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:27:35,942 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:27:35,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-07 04:27:35,943 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:27:35,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:27:35,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1218389949, now seen corresponding path program 1 times
[2024-11-07 04:27:35,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:27:35,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427447960]
[2024-11-07 04:27:35,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:27:35,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:27:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:27:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:27:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:27:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:27:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:27:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:27:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:27:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:27:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:27:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:27:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:27:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:27:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:27:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:27:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:27:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:27:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:27:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:27:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:27:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:27:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:27:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:27:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:27:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:27:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:27:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:27:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:27:36,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:27:36,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427447960]
[2024-11-07 04:27:36,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427447960] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:27:36,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:27:36,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 04:27:36,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267597935]
[2024-11-07 04:27:36,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:27:36,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 04:27:36,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:27:36,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 04:27:36,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 04:27:36,032 INFO L87 Difference]: Start difference. First operand 322 states and 463 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:27:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:27:36,146 INFO L93 Difference]: Finished difference Result 847 states and 1202 transitions.
[2024-11-07 04:27:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 04:27:36,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170
[2024-11-07 04:27:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:27:36,152 INFO L225 Difference]: With dead ends: 847
[2024-11-07 04:27:36,152 INFO L226 Difference]: Without dead ends: 532
[2024-11-07 04:27:36,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 04:27:36,154 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 41 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 04:27:36,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 204 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 04:27:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states.
[2024-11-07 04:27:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 422.
[2024-11-07 04:27:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 339 states have (on average 1.3539823008849559) internal successors, (459), 345 states have internal predecessors, (459), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72)
[2024-11-07 04:27:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 603 transitions.
[2024-11-07 04:27:36,199 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 603 transitions. Word has length 170
[2024-11-07 04:27:36,200 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:27:36,200 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 603 transitions.
[2024-11-07 04:27:36,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:27:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 603 transitions.
[2024-11-07 04:27:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-07 04:27:36,202 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:27:36,202 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:27:36,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-07 04:27:36,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:27:36,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:27:36,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1587107223, now seen corresponding path program 1 times
[2024-11-07 04:27:36,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:27:36,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816392895]
[2024-11-07 04:27:36,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:27:36,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:27:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:27:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:27:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:27:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:27:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:27:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:27:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:27:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:27:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:27:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:27:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:27:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:27:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:27:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:27:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:27:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:27:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:27:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:27:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:27:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:27:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:27:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:27:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:27:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:27:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:27:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:27:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:27:36,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:27:36,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816392895]
[2024-11-07 04:27:36,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816392895] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:27:36,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:27:36,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 04:27:36,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36114766]
[2024-11-07 04:27:36,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:27:36,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 04:27:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:27:36,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 04:27:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 04:27:36,406 INFO L87 Difference]: Start difference. First operand 422 states and 603 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:27:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:27:36,538 INFO L93 Difference]: Finished difference Result 830 states and 1185 transitions.
[2024-11-07 04:27:36,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 04:27:36,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170
[2024-11-07 04:27:36,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:27:36,542 INFO L225 Difference]: With dead ends: 830
[2024-11-07 04:27:36,543 INFO L226 Difference]: Without dead ends: 411
[2024-11-07 04:27:36,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 04:27:36,544 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 78 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 04:27:36,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 320 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 04:27:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states.
[2024-11-07 04:27:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409.
[2024-11-07 04:27:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 326 states have (on average 1.3466257668711656) internal successors, (439), 332 states have internal predecessors, (439), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72)
[2024-11-07 04:27:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 583 transitions.
[2024-11-07 04:27:36,589 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 583 transitions. Word has length 170
[2024-11-07 04:27:36,589 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:27:36,589 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 583 transitions.
[2024-11-07 04:27:36,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:27:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 583 transitions.
[2024-11-07 04:27:36,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-07 04:27:36,592 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:27:36,592 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:27:36,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-07 04:27:36,592 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:27:36,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:27:36,593 INFO L85 PathProgramCache]: Analyzing trace with hash -844172460, now seen corresponding path program 1 times
[2024-11-07 04:27:36,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:27:36,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885209648]
[2024-11-07 04:27:36,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:27:36,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:27:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:27:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:27:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:27:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:27:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:27:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:27:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:27:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:27:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:27:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:27:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:27:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:27:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:27:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:27:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:27:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:27:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:27:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:27:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:27:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:27:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:27:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:27:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:27:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:27:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:27:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:27:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked.
[2024-11-07 04:27:38,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:27:38,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885209648]
[2024-11-07 04:27:38,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885209648] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:27:38,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:27:38,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 04:27:38,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076370599]
[2024-11-07 04:27:38,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:27:38,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 04:27:38,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:27:38,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 04:27:38,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-11-07 04:27:38,385 INFO L87 Difference]: Start difference. First operand 409 states and 583 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:27:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:27:39,382 INFO L93 Difference]: Finished difference Result 675 states and 960 transitions.
[2024-11-07 04:27:39,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 04:27:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171
[2024-11-07 04:27:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:27:39,387 INFO L225 Difference]: With dead ends: 675
[2024-11-07 04:27:39,387 INFO L226 Difference]: Without dead ends: 421
[2024-11-07 04:27:39,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-11-07 04:27:39,389 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 69 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-07 04:27:39,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 788 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-07 04:27:39,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states.
[2024-11-07 04:27:39,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 396.
[2024-11-07 04:27:39,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 313 states have (on average 1.3386581469648562) internal successors, (419), 319 states have internal predecessors, (419), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72)
[2024-11-07 04:27:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 563 transitions.
[2024-11-07 04:27:39,432 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 563 transitions. Word has length 171
[2024-11-07 04:27:39,433 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:27:39,433 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 563 transitions.
[2024-11-07 04:27:39,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26)
[2024-11-07 04:27:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 563 transitions.
[2024-11-07 04:27:39,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-07 04:27:39,435 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:27:39,435 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:27:39,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-07 04:27:39,436 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:27:39,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:27:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1526818079, now seen corresponding path program 1 times
[2024-11-07 04:27:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:27:39,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018356722]
[2024-11-07 04:27:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:27:39,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:27:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:27:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:27:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:27:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:27:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:27:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:27:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:27:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:27:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:27:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:27:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-07 04:27:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 04:27:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70
[2024-11-07 04:27:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-07 04:27:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-07 04:27:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86
[2024-11-07 04:27:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92
[2024-11-07 04:27:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-11-07 04:27:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-07 04:27:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-11-07 04:27:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-07 04:27:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-11-07 04:27:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124
[2024-11-07 04:27:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-11-07 04:27:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135
[2024-11-07 04:27:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141
[2024-11-07 04:27:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 90 proven. 54 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked.
[2024-11-07 04:27:39,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:27:39,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018356722]
[2024-11-07 04:27:39,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018356722] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 04:27:39,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744601361]
[2024-11-07 04:27:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:27:39,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 04:27:39,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 04:27:39,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 04:27:39,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-07 04:27:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:27:39,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 04:27:39,956 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 04:27:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 750 proven. 54 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked.
[2024-11-07 04:27:40,414 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 04:27:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 90 proven. 57 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked.
[2024-11-07 04:27:40,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744601361] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 04:27:40,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 04:27:40,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21
[2024-11-07 04:27:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786024624]
[2024-11-07 04:27:40,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 04:27:40,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2024-11-07 04:27:40,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:27:40,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2024-11-07 04:27:40,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420
[2024-11-07 04:27:40,797 INFO L87 Difference]: Start difference. First operand 396 states and 563 transitions. Second operand has 21 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 6 states have call successors, (40), 3 states have call predecessors, (40), 7 states have return successors, (41), 6 states have call predecessors, (41), 6 states have call successors, (41)
[2024-11-07 04:27:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:27:41,299 INFO L93 Difference]: Finished difference Result 838 states and 1177 transitions.
[2024-11-07 04:27:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-07 04:27:41,300 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 6 states have call successors, (40), 3 states have call predecessors, (40), 7 states have return successors, (41), 6 states have call predecessors, (41), 6 states have call successors, (41) Word has length 171
[2024-11-07 04:27:41,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:27:41,305 INFO L225 Difference]: With dead ends: 838
[2024-11-07 04:27:41,306 INFO L226 Difference]: Without dead ends: 445
[2024-11-07 04:27:41,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812
[2024-11-07 04:27:41,309 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 141 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 04:27:41,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 514 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 04:27:41,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states.
[2024-11-07 04:27:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 421.
[2024-11-07 04:27:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 334 states have (on average 1.3173652694610778) internal successors, (440), 340 states have internal predecessors, (440), 72 states have call successors, (72), 14 states have call predecessors, (72), 14 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72)
[2024-11-07 04:27:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 584 transitions.
[2024-11-07 04:27:41,361 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 584 transitions. Word has length 171
[2024-11-07 04:27:41,361 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:27:41,361 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 584 transitions.
[2024-11-07 04:27:41,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 6 states have call successors, (40), 3 states have call predecessors, (40), 7 states have return successors, (41), 6 states have call predecessors, (41), 6 states have call successors, (41)
[2024-11-07 04:27:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 584 transitions.
[2024-11-07 04:27:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2024-11-07 04:27:41,363 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:27:41,363 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:27:41,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 04:27:41,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-11-07 04:27:41,568 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:27:41,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:27:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1757031967, now seen corresponding path program 1 times
[2024-11-07 04:27:41,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:27:41,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109884882]
[2024-11-07 04:27:41,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:27:41,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:27:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 04:27:41,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [393398137]
[2024-11-07 04:27:41,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:27:41,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 04:27:41,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 04:27:41,651 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 04:27:41,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-07 04:27:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 04:27:41,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 04:27:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 04:27:41,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 04:27:41,970 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 04:27:41,972 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 04:27:41,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-07 04:27:42,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-11-07 04:27:42,177 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:27:42,296 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 04:27:42,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:27:42 BoogieIcfgContainer
[2024-11-07 04:27:42,300 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 04:27:42,301 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 04:27:42,301 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 04:27:42,301 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 04:27:42,302 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:26:29" (3/4) ...
[2024-11-07 04:27:42,304 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 04:27:42,305 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 04:27:42,307 INFO L158 Benchmark]: Toolchain (without parser) took 74014.35ms. Allocated memory was 100.7MB in the beginning and 604.0MB in the end (delta: 503.3MB). Free memory was 76.0MB in the beginning and 228.3MB in the end (delta: -152.4MB). Peak memory consumption was 354.3MB. Max. memory is 16.1GB.
[2024-11-07 04:27:42,308 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 04:27:42,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.23ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 61.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 04:27:42,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.52ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 58.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 04:27:42,308 INFO L158 Benchmark]: Boogie Preprocessor took 77.45ms. Allocated memory is still 100.7MB. Free memory was 58.4MB in the beginning and 53.8MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 04:27:42,309 INFO L158 Benchmark]: RCFGBuilder took 583.36ms. Allocated memory is still 100.7MB. Free memory was 53.7MB in the beginning and 66.8MB in the end (delta: -13.1MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB.
[2024-11-07 04:27:42,309 INFO L158 Benchmark]: TraceAbstraction took 72941.27ms. Allocated memory was 100.7MB in the beginning and 604.0MB in the end (delta: 503.3MB). Free memory was 66.3MB in the beginning and 228.5MB in the end (delta: -162.1MB). Peak memory consumption was 333.2MB. Max. memory is 16.1GB.
[2024-11-07 04:27:42,309 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 604.0MB. Free memory was 228.5MB in the beginning and 228.3MB in the end (delta: 157.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 04:27:42,311 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.36ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 335.23ms. Allocated memory is still 100.7MB. Free memory was 75.8MB in the beginning and 61.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 66.52ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 58.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 77.45ms. Allocated memory is still 100.7MB. Free memory was 58.4MB in the beginning and 53.8MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 583.36ms. Allocated memory is still 100.7MB. Free memory was 53.7MB in the beginning and 66.8MB in the end (delta: -13.1MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB.
* TraceAbstraction took 72941.27ms. Allocated memory was 100.7MB in the beginning and 604.0MB in the end (delta: 503.3MB). Free memory was 66.3MB in the beginning and 228.5MB in the end (delta: -162.1MB). Peak memory consumption was 333.2MB. Max. memory is 16.1GB.
* Witness Printer took 3.82ms. Allocated memory is still 604.0MB. Free memory was 228.5MB in the beginning and 228.3MB in the end (delta: 157.6kB). Peak memory consumption was 8.4MB. 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: 19]: 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 someBinaryDOUBLEComparisonOperation at line 125.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] signed char var_1_1 = -10;
[L23] unsigned char var_1_2 = 1;
[L24] signed char var_1_3 = -16;
[L25] signed char var_1_4 = 50;
[L26] signed char var_1_5 = 4;
[L27] unsigned long int var_1_6 = 50;
[L28] signed long int var_1_7 = -8;
[L29] signed long int var_1_8 = -4;
[L30] signed char var_1_9 = 50;
[L31] unsigned char var_1_10 = 128;
[L32] unsigned char var_1_11 = 5;
[L33] unsigned long int var_1_12 = 10;
[L34] signed char var_1_13 = 16;
[L35] signed long int var_1_14 = 1;
[L36] unsigned short int var_1_15 = 128;
[L37] signed long int var_1_16 = 2;
[L38] unsigned short int var_1_17 = 61498;
[L39] unsigned long int var_1_18 = 1;
[L40] unsigned char var_1_19 = 0;
[L41] double var_1_20 = 4.9;
[L42] double var_1_21 = 1.5;
VAL [isInitial=0, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L129] isInitial = 1
[L130] FCALL initially()
[L131] COND TRUE 1
[L132] FCALL updateLastVariables()
[L133] CALL updateVariables()
[L83] var_1_2 = __VERIFIER_nondet_uchar()
[L84] CALL assume_abort_if_not(var_1_2 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L84] RET assume_abort_if_not(var_1_2 >= 0)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L85] CALL assume_abort_if_not(var_1_2 <= 1)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L85] RET assume_abort_if_not(var_1_2 <= 1)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L86] var_1_3 = __VERIFIER_nondet_char()
[L87] CALL assume_abort_if_not(var_1_3 >= -63)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L87] RET assume_abort_if_not(var_1_3 >= -63)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L88] CALL assume_abort_if_not(var_1_3 <= 63)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L88] RET assume_abort_if_not(var_1_3 <= 63)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L89] var_1_4 = __VERIFIER_nondet_char()
[L90] CALL assume_abort_if_not(var_1_4 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L90] RET assume_abort_if_not(var_1_4 >= 0)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L91] CALL assume_abort_if_not(var_1_4 <= 63)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L91] RET assume_abort_if_not(var_1_4 <= 63)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L92] var_1_5 = __VERIFIER_nondet_char()
[L93] CALL assume_abort_if_not(var_1_5 >= -127)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L93] RET assume_abort_if_not(var_1_5 >= -127)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L94] CALL assume_abort_if_not(var_1_5 <= 126)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L94] RET assume_abort_if_not(var_1_5 <= 126)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50]
[L95] var_1_7 = __VERIFIER_nondet_long()
[L96] CALL assume_abort_if_not(var_1_7 >= -2147483648)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50]
[L96] RET assume_abort_if_not(var_1_7 >= -2147483648)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50]
[L97] CALL assume_abort_if_not(var_1_7 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50]
[L97] RET assume_abort_if_not(var_1_7 <= 2147483647)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50]
[L98] CALL assume_abort_if_not(var_1_7 != 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50]
[L98] RET assume_abort_if_not(var_1_7 != 0)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50]
[L99] var_1_8 = __VERIFIER_nondet_long()
[L100] CALL assume_abort_if_not(var_1_8 >= -2147483648)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L100] RET assume_abort_if_not(var_1_8 >= -2147483648)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L101] CALL assume_abort_if_not(var_1_8 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L101] RET assume_abort_if_not(var_1_8 <= 2147483647)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L102] CALL assume_abort_if_not(var_1_8 != 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L102] RET assume_abort_if_not(var_1_8 != 0)
VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L103] var_1_10 = __VERIFIER_nondet_uchar()
[L104] CALL assume_abort_if_not(var_1_10 >= 127)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L104] RET assume_abort_if_not(var_1_10 >= 127)
VAL [isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L105] CALL assume_abort_if_not(var_1_10 <= 255)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L105] RET assume_abort_if_not(var_1_10 <= 255)
VAL [isInitial=1, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L106] var_1_11 = __VERIFIER_nondet_uchar()
[L107] CALL assume_abort_if_not(var_1_11 >= 1)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L107] RET assume_abort_if_not(var_1_11 >= 1)
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L108] CALL assume_abort_if_not(var_1_11 <= 126)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L108] RET assume_abort_if_not(var_1_11 <= 126)
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L109] CALL assume_abort_if_not(var_1_11 != 127)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L109] RET assume_abort_if_not(var_1_11 != 127)
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=1, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L110] var_1_14 = __VERIFIER_nondet_long()
[L111] CALL assume_abort_if_not(var_1_14 >= -2147483648)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L111] RET assume_abort_if_not(var_1_14 >= -2147483648)
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L112] CALL assume_abort_if_not(var_1_14 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L112] RET assume_abort_if_not(var_1_14 <= 2147483647)
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L113] var_1_16 = __VERIFIER_nondet_long()
[L114] CALL assume_abort_if_not(var_1_16 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L114] RET assume_abort_if_not(var_1_16 >= 0)
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L115] CALL assume_abort_if_not(var_1_16 <= 2147483647)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L115] RET assume_abort_if_not(var_1_16 <= 2147483647)
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L116] var_1_17 = __VERIFIER_nondet_ushort()
[L117] CALL assume_abort_if_not(var_1_17 >= 32767)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L117] RET assume_abort_if_not(var_1_17 >= 32767)
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L118] CALL assume_abort_if_not(var_1_17 <= 65534)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L118] RET assume_abort_if_not(var_1_17 <= 65534)
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L119] var_1_21 = __VERIFIER_nondet_double()
[L120] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L120] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F ))
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L133] RET updateVariables()
[L134] CALL step()
[L46] COND TRUE \read(var_1_2)
[L47] var_1_1 = (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5)))
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L49] signed long int stepLocal_1 = -16;
[L50] signed long int stepLocal_0 = var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)));
VAL [isInitial=1, stepLocal_0=0, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L51] COND FALSE !(-4 > stepLocal_0)
VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L56] EXPR var_1_8 & var_1_4
VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50]
[L56] COND FALSE !(var_1_6 <= (var_1_8 & var_1_4))
[L61] var_1_9 = var_1_4
VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L63] COND TRUE var_1_3 <= var_1_1
[L64] var_1_12 = var_1_4
VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L68] signed long int stepLocal_2 = var_1_14;
VAL [isInitial=1, stepLocal_1=-16, stepLocal_2=0, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L69] COND TRUE (~ var_1_3) < stepLocal_2
[L70] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5)))
VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L72] signed long int stepLocal_3 = var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)));
VAL [isInitial=1, stepLocal_1=-16, stepLocal_3=126, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L73] EXPR (var_1_4 + var_1_14) & var_1_7
VAL [isInitial=1, stepLocal_1=-16, stepLocal_3=126, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L73] COND TRUE ((var_1_4 + var_1_14) & var_1_7) <= stepLocal_3
[L74] var_1_15 = (var_1_11 + 64)
VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=1, var_1_20=49/10, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L78] var_1_18 = var_1_17
[L79] var_1_19 = 0
[L80] var_1_20 = var_1_21
VAL [isInitial=1, stepLocal_1=-16, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L134] RET step()
[L135] CALL, EXPR property()
[L125] EXPR ((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L125] EXPR var_1_8 & var_1_4
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L125] EXPR ((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L125] EXPR (((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L125] EXPR (var_1_4 + var_1_14) & var_1_7
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L125] EXPR (((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L125-L126] return ((((((((var_1_2 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((var_1_6 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_14) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_14) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21))
;
[L135] RET, EXPR property()
[L135] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
[L19] reach_error()
VAL [isInitial=1, var_1_10=127, var_1_11=125, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=189, var_1_16=1, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.8s, OverallIterations: 16, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3131 SdHoareTripleChecker+Valid, 16.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3116 mSDsluCounter, 8327 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6458 mSDsCounter, 240 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8721 IncrementalHoareTripleChecker+Invalid, 8961 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 240 mSolverCounterUnsat, 1869 mSDtfsCounter, 8721 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1353 GetRequests, 1175 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=12, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 645 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 48.2s InterpolantComputationTime, 3053 NumberOfCodeBlocks, 3053 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2865 ConstructedInterpolants, 0 QuantifiedInterpolants, 24987 SizeOfPredicates, 5 NumberOfNonLiveVariables, 384 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 21935/22100 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 04:27:42,526 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process
[2024-11-07 04:27:42,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137
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/hardness-nfm22/hardness_codestructure_steplocals_file-84.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 04:27:44,668 INFO L188 SettingsManager]: Resetting all preferences to default values...