./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.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_loopvsstraightlinecode_25-1loop_file-70.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', '67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4']
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_loopvsstraightlinecode_25-1loop_file-70.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 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:24:02,288 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:24:02,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 08:24:02,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:24:02,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:24:02,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:24:02,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:24:02,429 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:24:02,430 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:24:02,430 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:24:02,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:24:02,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:24:02,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:24:02,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:24:02,431 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:24:02,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:24:02,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:24:02,432 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:24:02,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 08:24:02,432 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:24:02,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:24:02,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:24:02,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:24:02,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:24:02,433 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:24:02,433 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:24:02,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:24:02,433 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:24:02,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:24:02,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:24:02,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:24:02,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:24:02,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:24:02,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:24:02,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:24:02,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:24:02,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 08:24:02,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 08:24:02,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:24:02,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:24:02,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:24:02,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:24:02,436 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 -> 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4
[2024-11-07 08:24:02,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:24:02,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:24:02,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:24:02,794 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:24:02,795 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:24:02,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i
[2024-11-07 08:24:04,176 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:24:04,442 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:24:04,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i
[2024-11-07 08:24:04,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b80593d0f/bf179d431eb14cffbf559fb5daafcb0b/FLAG80c404446
[2024-11-07 08:24:04,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b80593d0f/bf179d431eb14cffbf559fb5daafcb0b
[2024-11-07 08:24:04,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:24:04,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:24:04,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:24:04,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:24:04,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:24:04,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7e0cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04, skipping insertion in model container
[2024-11-07 08:24:04,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,510 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:24:04,648 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_loopvsstraightlinecode_25-1loop_file-70.i[915,928]
[2024-11-07 08:24:04,709 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:24:04,724 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:24:04,736 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_loopvsstraightlinecode_25-1loop_file-70.i[915,928]
[2024-11-07 08:24:04,774 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:24:04,790 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:24:04,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04 WrapperNode
[2024-11-07 08:24:04,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:24:04,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:24:04,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:24:04,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:24:04,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,858 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137
[2024-11-07 08:24:04,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:24:04,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:24:04,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:24:04,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:24:04,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,904 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 08:24:04,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:24:04,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:24:04,939 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:24:04,939 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:24:04,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (1/1) ...
[2024-11-07 08:24:04,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:24:04,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:24:04,975 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 08:24:04,980 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 08:24:05,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:24:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:24:05,003 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:24:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 08:24:05,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:24:05,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:24:05,083 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:24:05,084 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:24:05,408 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live.
[2024-11-07 08:24:05,408 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:24:05,417 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:24:05,417 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:24:05,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:05 BoogieIcfgContainer
[2024-11-07 08:24:05,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:24:05,420 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:24:05,420 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:24:05,425 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:24:05,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:24:04" (1/3) ...
[2024-11-07 08:24:05,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c65e4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:24:05, skipping insertion in model container
[2024-11-07 08:24:05,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:04" (2/3) ...
[2024-11-07 08:24:05,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c65e4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:24:05, skipping insertion in model container
[2024-11-07 08:24:05,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:05" (3/3) ...
[2024-11-07 08:24:05,429 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i
[2024-11-07 08:24:05,456 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:24:05,457 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:24:05,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:24:05,529 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;@f35c6e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:24:05,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:24:05,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-07 08:24:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2024-11-07 08:24:05,546 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:24:05,547 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:05,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:24:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:24:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1153718418, now seen corresponding path program 1 times
[2024-11-07 08:24:05,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:24:05,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595014083]
[2024-11-07 08:24:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:24:05,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:24:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:24:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:24:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:24:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:24:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:24:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:24:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:24:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:24:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 08:24:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 08:24:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 08:24:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 08:24:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 08:24:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2024-11-07 08:24:05,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:24:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595014083]
[2024-11-07 08:24:05,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595014083] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:24:05,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:24:05,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:24:05,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517213057]
[2024-11-07 08:24:05,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:24:05,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:24:05,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:24:05,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:24:05,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:24:05,910 INFO L87 Difference]: Start difference. First operand has 60 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13)
[2024-11-07 08:24:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:24:05,938 INFO L93 Difference]: Finished difference Result 117 states and 182 transitions.
[2024-11-07 08:24:05,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:24:05,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90
[2024-11-07 08:24:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:24:05,948 INFO L225 Difference]: With dead ends: 117
[2024-11-07 08:24:05,948 INFO L226 Difference]: Without dead ends: 56
[2024-11-07 08:24:05,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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 08:24:05,956 INFO L432 NwaCegarLoop]: 83 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, 83 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 08:24:05,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:24:05,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2024-11-07 08:24:05,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2024-11-07 08:24:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-07 08:24:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions.
[2024-11-07 08:24:06,001 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 90
[2024-11-07 08:24:06,001 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:24:06,001 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions.
[2024-11-07 08:24:06,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13)
[2024-11-07 08:24:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions.
[2024-11-07 08:24:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2024-11-07 08:24:06,006 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:24:06,006 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:06,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 08:24:06,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:24:06,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:24:06,008 INFO L85 PathProgramCache]: Analyzing trace with hash 895368340, now seen corresponding path program 1 times
[2024-11-07 08:24:06,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:24:06,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413014627]
[2024-11-07 08:24:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:24:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:24:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:24:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:24:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:24:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:24:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:24:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:24:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:24:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:24:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 08:24:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 08:24:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 08:24:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 08:24:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 08:24:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:07,674 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2024-11-07 08:24:07,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:24:07,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413014627]
[2024-11-07 08:24:07,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413014627] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:24:07,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:24:07,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 08:24:07,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846519102]
[2024-11-07 08:24:07,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:24:07,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 08:24:07,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:24:07,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 08:24:07,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-07 08:24:07,678 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:24:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:24:08,346 INFO L93 Difference]: Finished difference Result 198 states and 273 transitions.
[2024-11-07 08:24:08,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 08:24:08,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90
[2024-11-07 08:24:08,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:24:08,352 INFO L225 Difference]: With dead ends: 198
[2024-11-07 08:24:08,352 INFO L226 Difference]: Without dead ends: 145
[2024-11-07 08:24:08,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110
[2024-11-07 08:24:08,353 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 254 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 08:24:08,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 232 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 08:24:08,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2024-11-07 08:24:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 62.
[2024-11-07 08:24:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-07 08:24:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions.
[2024-11-07 08:24:08,373 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 90
[2024-11-07 08:24:08,375 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:24:08,375 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions.
[2024-11-07 08:24:08,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:24:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions.
[2024-11-07 08:24:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2024-11-07 08:24:08,377 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:24:08,377 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:08,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 08:24:08,378 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:24:08,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:24:08,378 INFO L85 PathProgramCache]: Analyzing trace with hash -879639022, now seen corresponding path program 1 times
[2024-11-07 08:24:08,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:24:08,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681678210]
[2024-11-07 08:24:08,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:24:08,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:24:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:24:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:24:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:24:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:24:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:24:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:24:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:24:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:24:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 08:24:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 08:24:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 08:24:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 08:24:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 08:24:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2024-11-07 08:24:09,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:24:09,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681678210]
[2024-11-07 08:24:09,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681678210] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:24:09,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:24:09,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 08:24:09,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531017013]
[2024-11-07 08:24:09,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:24:09,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 08:24:09,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:24:09,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 08:24:09,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 08:24:09,777 INFO L87 Difference]: Start difference. First operand 62 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:24:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:24:10,073 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions.
[2024-11-07 08:24:10,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 08:24:10,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90
[2024-11-07 08:24:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:24:10,075 INFO L225 Difference]: With dead ends: 149
[2024-11-07 08:24:10,075 INFO L226 Difference]: Without dead ends: 90
[2024-11-07 08:24:10,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-11-07 08:24:10,076 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 52 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 08:24:10,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 08:24:10,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2024-11-07 08:24:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72.
[2024-11-07 08:24:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-07 08:24:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions.
[2024-11-07 08:24:10,087 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 90
[2024-11-07 08:24:10,087 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:24:10,088 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions.
[2024-11-07 08:24:10,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:24:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions.
[2024-11-07 08:24:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2024-11-07 08:24:10,091 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:24:10,091 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:10,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 08:24:10,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:24:10,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:24:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash 308562326, now seen corresponding path program 1 times
[2024-11-07 08:24:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:24:10,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899323517]
[2024-11-07 08:24:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:24:10,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:24:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:24:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:24:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:24:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:24:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:24:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:24:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:24:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:24:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 08:24:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 08:24:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 08:24:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 08:24:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 08:24:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2024-11-07 08:24:10,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:24:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899323517]
[2024-11-07 08:24:10,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899323517] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:24:10,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:24:10,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 08:24:10,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10970412]
[2024-11-07 08:24:10,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:24:10,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 08:24:10,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:24:10,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 08:24:10,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 08:24:10,278 INFO L87 Difference]: Start difference. First operand 72 states and 104 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:24:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:24:10,313 INFO L93 Difference]: Finished difference Result 157 states and 224 transitions.
[2024-11-07 08:24:10,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 08:24:10,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90
[2024-11-07 08:24:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:24:10,314 INFO L225 Difference]: With dead ends: 157
[2024-11-07 08:24:10,314 INFO L226 Difference]: Without dead ends: 88
[2024-11-07 08:24:10,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 08:24:10,316 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 31 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 08:24:10,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 278 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:24:10,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2024-11-07 08:24:10,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70.
[2024-11-07 08:24:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-07 08:24:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 100 transitions.
[2024-11-07 08:24:10,322 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 100 transitions. Word has length 90
[2024-11-07 08:24:10,322 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:24:10,322 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 100 transitions.
[2024-11-07 08:24:10,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:24:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions.
[2024-11-07 08:24:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-07 08:24:10,323 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:24:10,323 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:10,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 08:24:10,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:24:10,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:24:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash -69887406, now seen corresponding path program 1 times
[2024-11-07 08:24:10,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:24:10,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558498205]
[2024-11-07 08:24:10,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:24:10,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:24:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:24:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:24:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:24:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:24:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:24:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:24:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:24:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:24:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 08:24:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 08:24:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 08:24:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 08:24:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 08:24:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked.
[2024-11-07 08:24:10,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:24:10,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558498205]
[2024-11-07 08:24:10,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558498205] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 08:24:10,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516404127]
[2024-11-07 08:24:10,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:24:10,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:24:10,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:24:10,711 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 08:24:10,713 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 08:24:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:10,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-07 08:24:10,853 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:24:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 158 proven. 42 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2024-11-07 08:24:11,275 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 08:24:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked.
[2024-11-07 08:24:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516404127] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 08:24:11,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 08:24:11,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 21
[2024-11-07 08:24:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546068678]
[2024-11-07 08:24:11,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 08:24:11,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2024-11-07 08:24:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:24:11,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2024-11-07 08:24:11,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420
[2024-11-07 08:24:11,587 INFO L87 Difference]: Start difference. First operand 70 states and 100 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30)
[2024-11-07 08:24:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:24:12,140 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions.
[2024-11-07 08:24:12,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-07 08:24:12,141 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) Word has length 93
[2024-11-07 08:24:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:24:12,143 INFO L225 Difference]: With dead ends: 179
[2024-11-07 08:24:12,143 INFO L226 Difference]: Without dead ends: 112
[2024-11-07 08:24:12,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870
[2024-11-07 08:24:12,144 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 209 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 08:24:12,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 392 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 08:24:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2024-11-07 08:24:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102.
[2024-11-07 08:24:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 08:24:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions.
[2024-11-07 08:24:12,166 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 93
[2024-11-07 08:24:12,167 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:24:12,167 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions.
[2024-11-07 08:24:12,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 21 states have internal predecessors, (65), 5 states have call successors, (29), 3 states have call predecessors, (29), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30)
[2024-11-07 08:24:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions.
[2024-11-07 08:24:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-07 08:24:12,172 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:24:12,172 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:12,190 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 08:24:12,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 08:24:12,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:24:12,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:24:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash 238150162, now seen corresponding path program 1 times
[2024-11-07 08:24:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:24:12,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665519943]
[2024-11-07 08:24:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:24:12,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:24:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:24:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:24:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:24:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:24:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:24:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:24:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:24:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:24:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 08:24:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 08:24:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 08:24:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 08:24:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 08:24:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2024-11-07 08:24:13,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:24:13,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665519943]
[2024-11-07 08:24:13,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665519943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:24:13,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:24:13,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2024-11-07 08:24:13,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14731139]
[2024-11-07 08:24:13,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:24:13,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-07 08:24:13,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:24:13,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-07 08:24:13,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2024-11-07 08:24:13,082 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:24:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:24:13,631 INFO L93 Difference]: Finished difference Result 189 states and 237 transitions.
[2024-11-07 08:24:13,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-07 08:24:13,632 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93
[2024-11-07 08:24:13,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:24:13,634 INFO L225 Difference]: With dead ends: 189
[2024-11-07 08:24:13,634 INFO L226 Difference]: Without dead ends: 187
[2024-11-07 08:24:13,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272
[2024-11-07 08:24:13,638 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 152 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 08:24:13,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 495 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 08:24:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states.
[2024-11-07 08:24:13,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 111.
[2024-11-07 08:24:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 92 states have internal predecessors, (116), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 08:24:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 146 transitions.
[2024-11-07 08:24:13,661 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 146 transitions. Word has length 93
[2024-11-07 08:24:13,662 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:24:13,662 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 146 transitions.
[2024-11-07 08:24:13,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:24:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 146 transitions.
[2024-11-07 08:24:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-07 08:24:13,665 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:24:13,665 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:13,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 08:24:13,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:24:13,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:24:13,665 INFO L85 PathProgramCache]: Analyzing trace with hash 631177172, now seen corresponding path program 1 times
[2024-11-07 08:24:13,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:24:13,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538177661]
[2024-11-07 08:24:13,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:24:13,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:24:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 08:24:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 08:24:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 08:24:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 08:24:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 08:24:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 08:24:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 08:24:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 08:24:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 08:24:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 08:24:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 08:24:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-07 08:24:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 08:24:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked.
[2024-11-07 08:24:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 08:24:14,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538177661]
[2024-11-07 08:24:14,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538177661] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:24:14,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:24:14,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-11-07 08:24:14,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463914557]
[2024-11-07 08:24:14,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:24:14,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-07 08:24:14,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 08:24:14,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-07 08:24:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2024-11-07 08:24:14,271 INFO L87 Difference]: Start difference. First operand 111 states and 146 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:24:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:24:14,679 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions.
[2024-11-07 08:24:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 08:24:14,680 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93
[2024-11-07 08:24:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:24:14,681 INFO L225 Difference]: With dead ends: 120
[2024-11-07 08:24:14,681 INFO L226 Difference]: Without dead ends: 118
[2024-11-07 08:24:14,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210
[2024-11-07 08:24:14,682 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 64 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 08:24:14,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 460 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 08:24:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2024-11-07 08:24:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106.
[2024-11-07 08:24:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 87 states have internal predecessors, (109), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 08:24:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions.
[2024-11-07 08:24:14,698 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 93
[2024-11-07 08:24:14,698 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:24:14,699 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions.
[2024-11-07 08:24:14,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)
[2024-11-07 08:24:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions.
[2024-11-07 08:24:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-07 08:24:14,704 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:24:14,704 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:14,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 08:24:14,705 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:24:14,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:24:14,705 INFO L85 PathProgramCache]: Analyzing trace with hash -204748978, now seen corresponding path program 1 times
[2024-11-07 08:24:14,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 08:24:14,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144499399]
[2024-11-07 08:24:14,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:24:14,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 08:24:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:24:14,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 08:24:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 08:24:14,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 08:24:14,807 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 08:24:14,808 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 08:24:14,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 08:24:14,813 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 08:24:14,887 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 08:24:14,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:24:14 BoogieIcfgContainer
[2024-11-07 08:24:14,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 08:24:14,892 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 08:24:14,892 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 08:24:14,892 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 08:24:14,893 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:05" (3/4) ...
[2024-11-07 08:24:14,894 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 08:24:14,895 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 08:24:14,896 INFO L158 Benchmark]: Toolchain (without parser) took 10414.16ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 77.0MB in the beginning and 95.2MB in the end (delta: -18.2MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB.
[2024-11-07 08:24:14,896 INFO L158 Benchmark]: CDTParser took 0.87ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:24:14,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.36ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 64.3MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 08:24:14,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.35ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 61.6MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 08:24:14,899 INFO L158 Benchmark]: Boogie Preprocessor took 75.52ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 58.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:24:14,900 INFO L158 Benchmark]: RCFGBuilder took 478.44ms. Allocated memory is still 100.7MB. Free memory was 58.5MB in the beginning and 40.3MB in the end (delta: 18.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 08:24:14,900 INFO L158 Benchmark]: TraceAbstraction took 9471.60ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 39.8MB in the beginning and 95.3MB in the end (delta: -55.5MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB.
[2024-11-07 08:24:14,900 INFO L158 Benchmark]: Witness Printer took 3.42ms. Allocated memory is still 184.5MB. Free memory was 95.3MB in the beginning and 95.2MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 08:24:14,902 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.87ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 306.36ms. Allocated memory is still 100.7MB. Free memory was 76.9MB in the beginning and 64.3MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 70.35ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 61.6MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 75.52ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 58.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 478.44ms. Allocated memory is still 100.7MB. Free memory was 58.5MB in the beginning and 40.3MB in the end (delta: 18.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* TraceAbstraction took 9471.60ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 39.8MB in the beginning and 95.3MB in the end (delta: -55.5MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB.
* Witness Printer took 3.42ms. Allocated memory is still 184.5MB. Free memory was 95.3MB in the beginning and 95.2MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 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 77.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned short int var_1_1 = 0;
[L23] unsigned char var_1_2 = 0;
[L24] unsigned short int var_1_3 = 1;
[L25] unsigned short int var_1_4 = 19138;
[L26] unsigned short int var_1_5 = 0;
[L27] signed char var_1_6 = 25;
[L28] signed long int var_1_7 = -50;
[L29] double var_1_8 = 8.3;
[L30] unsigned char var_1_9 = 128;
[L31] unsigned char var_1_10 = 1;
[L32] double var_1_11 = 256.2;
VAL [isInitial=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L81] isInitial = 1
[L82] FCALL initially()
[L83] int k_loop;
[L84] k_loop = 0
VAL [isInitial=1, k_loop=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L84] COND TRUE k_loop < 1
[L85] FCALL updateLastVariables()
[L86] CALL updateVariables()
[L53] var_1_2 = __VERIFIER_nondet_uchar()
[L54] CALL assume_abort_if_not(var_1_2 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L54] RET assume_abort_if_not(var_1_2 >= 0)
VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L55] CALL assume_abort_if_not(var_1_2 <= 1)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L55] RET assume_abort_if_not(var_1_2 <= 1)
VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L56] var_1_3 = __VERIFIER_nondet_ushort()
[L57] CALL assume_abort_if_not(var_1_3 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L57] RET assume_abort_if_not(var_1_3 >= 0)
VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L58] CALL assume_abort_if_not(var_1_3 <= 16383)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L58] RET assume_abort_if_not(var_1_3 <= 16383)
VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L59] var_1_4 = __VERIFIER_nondet_ushort()
[L60] CALL assume_abort_if_not(var_1_4 >= 16383)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L60] RET assume_abort_if_not(var_1_4 >= 16383)
VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L61] CALL assume_abort_if_not(var_1_4 <= 32767)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L61] RET assume_abort_if_not(var_1_4 <= 32767)
VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L62] var_1_5 = __VERIFIER_nondet_ushort()
[L63] CALL assume_abort_if_not(var_1_5 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L63] RET assume_abort_if_not(var_1_5 >= 0)
VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L64] CALL assume_abort_if_not(var_1_5 <= 16383)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L64] RET assume_abort_if_not(var_1_5 <= 16383)
VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128]
[L65] var_1_9 = __VERIFIER_nondet_uchar()
[L66] CALL assume_abort_if_not(var_1_9 >= 127)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L66] RET assume_abort_if_not(var_1_9 >= 127)
VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L67] CALL assume_abort_if_not(var_1_9 <= 255)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L67] RET assume_abort_if_not(var_1_9 <= 255)
VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L68] var_1_10 = __VERIFIER_nondet_uchar()
[L69] CALL assume_abort_if_not(var_1_10 >= 0)
VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L69] RET assume_abort_if_not(var_1_10 >= 0)
VAL [isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L70] CALL assume_abort_if_not(var_1_10 <= 127)
VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L70] RET assume_abort_if_not(var_1_10 <= 127)
VAL [isInitial=1, var_1_10=5, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L71] var_1_11 = __VERIFIER_nondet_double()
[L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ))
VAL [isInitial=1, var_1_10=5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L86] RET updateVariables()
[L87] CALL step()
[L36] COND TRUE \read(var_1_2)
[L37] var_1_1 = ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5))
VAL [isInitial=1, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L39] unsigned short int stepLocal_0 = var_1_4;
VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L40] EXPR var_1_5 << var_1_1
VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L40] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))
VAL [isInitial=1, stepLocal_0=29916, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255]
[L40] COND FALSE !(stepLocal_0 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)))))
[L43] var_1_7 = (var_1_5 + (var_1_1 + var_1_4))
VAL [isInitial=1, var_1_10=5, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=83/10, var_1_9=255]
[L45] COND TRUE (var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3
[L46] var_1_8 = var_1_11
VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255]
[L48] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_3 + var_1_7)))
VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255]
[L87] RET step()
[L88] CALL, EXPR property()
[L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))
VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255]
[L77] EXPR var_1_5 << var_1_1
VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255]
[L77] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))
VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255]
[L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))
VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255]
[L77-L78] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))) && (((var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3) ? (var_1_8 == ((double) var_1_11)) : 1)
;
[L88] RET, EXPR property()
[L88] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255]
[L19] reach_error()
VAL [isInitial=1, var_1_10=5, var_1_11=77058, var_1_1=47137, var_1_2=1, var_1_3=1, var_1_4=29916, var_1_5=0, var_1_6=25, var_1_7=77053, var_1_8=77058, var_1_9=255]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 8, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 766 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 762 mSDsluCounter, 2100 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1594 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1271 IncrementalHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 506 mSDtfsCounter, 1271 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 466 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=6, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 217 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 825 NumberOfCodeBlocks, 825 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 816 ConstructedInterpolants, 0 QuantifiedInterpolants, 4061 SizeOfPredicates, 7 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 2718/2808 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 08:24:14,934 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 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.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 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 08:24:17,166 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 08:24:17,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-07 08:24:17,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 08:24:17,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 08:24:17,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 08:24:17,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 08:24:17,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 08:24:17,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 08:24:17,314 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 08:24:17,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 08:24:17,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 08:24:17,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 08:24:17,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 08:24:17,316 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 08:24:17,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 08:24:17,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 08:24:17,316 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 08:24:17,316 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 08:24:17,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 08:24:17,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 08:24:17,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 08:24:17,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 08:24:17,317 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 08:24:17,317 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 08:24:17,317 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 08:24:17,317 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 08:24:17,317 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 08:24:17,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 08:24:17,317 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 08:24:17,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 08:24:17,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 08:24:17,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 08:24:17,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 08:24:17,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:24:17,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 08:24:17,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 08:24:17,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 08:24:17,318 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 08:24:17,318 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 08:24:17,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 08:24:17,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 08:24:17,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 08:24:17,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 08:24:17,319 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 -> 67ddbc9a1e4c4f55e4cae1326222f0933404d1b62e1d4337e8d831f0f94214e4
[2024-11-07 08:24:17,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 08:24:17,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 08:24:17,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 08:24:17,606 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 08:24:17,606 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 08:24:17,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i
[2024-11-07 08:24:18,906 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 08:24:19,128 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 08:24:19,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i
[2024-11-07 08:24:19,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dfc3a615/370b040c710b424da683cd549d50bc40/FLAG44e61338b
[2024-11-07 08:24:19,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7dfc3a615/370b040c710b424da683cd549d50bc40
[2024-11-07 08:24:19,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 08:24:19,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 08:24:19,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 08:24:19,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 08:24:19,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 08:24:19,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40249b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19, skipping insertion in model container
[2024-11-07 08:24:19,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,493 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 08:24:19,608 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_loopvsstraightlinecode_25-1loop_file-70.i[915,928]
[2024-11-07 08:24:19,646 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:24:19,657 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 08:24:19,670 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_loopvsstraightlinecode_25-1loop_file-70.i[915,928]
[2024-11-07 08:24:19,693 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 08:24:19,711 INFO L204 MainTranslator]: Completed translation
[2024-11-07 08:24:19,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19 WrapperNode
[2024-11-07 08:24:19,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 08:24:19,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 08:24:19,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 08:24:19,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 08:24:19,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,751 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94
[2024-11-07 08:24:19,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 08:24:19,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 08:24:19,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 08:24:19,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 08:24:19,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,788 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 08:24:19,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 08:24:19,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 08:24:19,819 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 08:24:19,819 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 08:24:19,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (1/1) ...
[2024-11-07 08:24:19,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 08:24:19,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 08:24:19,853 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 08:24:19,856 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 08:24:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 08:24:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 08:24:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 08:24:19,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 08:24:19,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 08:24:19,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 08:24:19,956 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 08:24:19,958 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 08:24:20,147 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live.
[2024-11-07 08:24:20,148 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 08:24:20,155 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 08:24:20,155 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 08:24:20,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:20 BoogieIcfgContainer
[2024-11-07 08:24:20,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 08:24:20,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 08:24:20,158 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 08:24:20,163 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 08:24:20,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:24:19" (1/3) ...
[2024-11-07 08:24:20,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0f626b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:24:20, skipping insertion in model container
[2024-11-07 08:24:20,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:24:19" (2/3) ...
[2024-11-07 08:24:20,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0f626b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:24:20, skipping insertion in model container
[2024-11-07 08:24:20,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:24:20" (3/3) ...
[2024-11-07 08:24:20,165 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i
[2024-11-07 08:24:20,176 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 08:24:20,176 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 08:24:20,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 08:24:20,229 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;@2ec061bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 08:24:20,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 08:24:20,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-07 08:24:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 08:24:20,241 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:24:20,241 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:20,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:24:20,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:24:20,245 INFO L85 PathProgramCache]: Analyzing trace with hash 231096405, now seen corresponding path program 1 times
[2024-11-07 08:24:20,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:24:20,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541575472]
[2024-11-07 08:24:20,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:24:20,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:24:20,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:24:20,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:24:20,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-07 08:24:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:20,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 08:24:20,405 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 08:24:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked.
[2024-11-07 08:24:20,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 08:24:20,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 08:24:20,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541575472]
[2024-11-07 08:24:20,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541575472] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 08:24:20,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 08:24:20,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 08:24:20,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763282065]
[2024-11-07 08:24:20,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 08:24:20,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 08:24:20,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 08:24:20,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 08:24:20,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 08:24:20,470 INFO L87 Difference]: Start difference. First operand has 45 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2024-11-07 08:24:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 08:24:20,495 INFO L93 Difference]: Finished difference Result 87 states and 138 transitions.
[2024-11-07 08:24:20,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 08:24:20,497 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86
[2024-11-07 08:24:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 08:24:20,502 INFO L225 Difference]: With dead ends: 87
[2024-11-07 08:24:20,502 INFO L226 Difference]: Without dead ends: 41
[2024-11-07 08:24:20,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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 08:24:20,511 INFO L432 NwaCegarLoop]: 61 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, 61 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 08:24:20,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 08:24:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2024-11-07 08:24:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2024-11-07 08:24:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13)
[2024-11-07 08:24:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions.
[2024-11-07 08:24:20,555 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 86
[2024-11-07 08:24:20,556 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 08:24:20,557 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions.
[2024-11-07 08:24:20,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)
[2024-11-07 08:24:20,557 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions.
[2024-11-07 08:24:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 08:24:20,560 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 08:24:20,561 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:20,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-07 08:24:20,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:24:20,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 08:24:20,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 08:24:20,762 INFO L85 PathProgramCache]: Analyzing trace with hash -479824553, now seen corresponding path program 1 times
[2024-11-07 08:24:20,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 08:24:20,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254802830]
[2024-11-07 08:24:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 08:24:20,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 08:24:20,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 08:24:20,765 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 08:24:20,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-07 08:24:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 08:24:20,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 21 conjuncts are in the unsatisfiable core
[2024-11-07 08:24:20,883 INFO L278 TraceCheckSpWp]: Computing forward predicates...