./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.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_fillercode_fillercodesize_normal_file-3.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', '642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7']
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_fillercode_fillercodesize_normal_file-3.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 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 04:30:58,547 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 04:30:58,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-07 04:30:58,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 04:30:58,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 04:30:58,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 04:30:58,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 04:30:58,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 04:30:58,648 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 04:30:58,648 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 04:30:58,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 04:30:58,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 04:30:58,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 04:30:58,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 04:30:58,648 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 04:30:58,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 04:30:58,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 04:30:58,648 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 04:30:58,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 04:30:58,648 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 04:30:58,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 04:30:58,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 04:30:58,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 04:30:58,649 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 04:30:58,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 04:30:58,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 04:30:58,649 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 -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7
[2024-11-07 04:30:58,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 04:30:58,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 04:30:58,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 04:30:58,908 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 04:30:58,908 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 04:30:58,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i
[2024-11-07 04:31:00,076 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 04:31:00,341 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 04:31:00,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i
[2024-11-07 04:31:00,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/331c0f416/36bd40ec79dc4ac5ab42500f4413ea1a/FLAG79698d130
[2024-11-07 04:31:00,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/331c0f416/36bd40ec79dc4ac5ab42500f4413ea1a
[2024-11-07 04:31:00,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 04:31:00,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 04:31:00,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 04:31:00,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 04:31:00,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 04:31:00,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:00,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff04e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00, skipping insertion in model container
[2024-11-07 04:31:00,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:00,695 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 04:31:00,806 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_fillercode_fillercodesize_normal_file-3.i[912,925]
[2024-11-07 04:31:00,853 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 04:31:00,869 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 04:31:00,877 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_fillercode_fillercodesize_normal_file-3.i[912,925]
[2024-11-07 04:31:00,902 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 04:31:00,913 INFO L204 MainTranslator]: Completed translation
[2024-11-07 04:31:00,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00 WrapperNode
[2024-11-07 04:31:00,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 04:31:00,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 04:31:00,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 04:31:00,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 04:31:00,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:00,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:00,962 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148
[2024-11-07 04:31:00,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 04:31:00,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 04:31:00,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 04:31:00,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 04:31:00,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:00,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:00,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:00,985 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-07 04:31:00,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:00,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:00,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:01,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:01,002 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:01,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:01,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 04:31:01,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 04:31:01,008 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 04:31:01,009 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 04:31:01,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (1/1) ...
[2024-11-07 04:31:01,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 04:31:01,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 04:31:01,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-07 04:31:01,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-07 04:31:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 04:31:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 04:31:01,059 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 04:31:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 04:31:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 04:31:01,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 04:31:01,128 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 04:31:01,129 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 04:31:01,459 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2024-11-07 04:31:01,459 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 04:31:01,469 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 04:31:01,469 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 04:31:01,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:31:01 BoogieIcfgContainer
[2024-11-07 04:31:01,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 04:31:01,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 04:31:01,472 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 04:31:01,476 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 04:31:01,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:31:00" (1/3) ...
[2024-11-07 04:31:01,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d88530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:31:01, skipping insertion in model container
[2024-11-07 04:31:01,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:00" (2/3) ...
[2024-11-07 04:31:01,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d88530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:31:01, skipping insertion in model container
[2024-11-07 04:31:01,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:31:01" (3/3) ...
[2024-11-07 04:31:01,478 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-3.i
[2024-11-07 04:31:01,490 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 04:31:01,490 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 04:31:01,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 04:31:01,567 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;@7c8ebe1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 04:31:01,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 04:31:01,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 04:31:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2024-11-07 04:31:01,578 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:01,579 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:01,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:01,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:01,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1623939, now seen corresponding path program 1 times
[2024-11-07 04:31:01,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:31:01,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316390339]
[2024-11-07 04:31:01,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:01,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:31:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:31:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:31:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:31:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:31:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:31:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:31:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:31:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:31:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:31:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:31:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:31:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 04:31:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:31:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:31:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:31:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 04:31:01,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:31:01,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316390339]
[2024-11-07 04:31:01,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316390339] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:31:01,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:31:01,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 04:31:01,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842918618]
[2024-11-07 04:31:01,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:31:01,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 04:31:01,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:31:01,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 04:31:01,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 04:31:01,830 INFO L87 Difference]: Start difference. First operand has 71 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-07 04:31:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:31:01,846 INFO L93 Difference]: Finished difference Result 135 states and 229 transitions.
[2024-11-07 04:31:01,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 04:31:01,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 105
[2024-11-07 04:31:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:31:01,853 INFO L225 Difference]: With dead ends: 135
[2024-11-07 04:31:01,853 INFO L226 Difference]: Without dead ends: 67
[2024-11-07 04:31:01,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 04:31:01,857 INFO L432 NwaCegarLoop]: 102 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, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 04:31:01,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 04:31:01,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2024-11-07 04:31:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67.
[2024-11-07 04:31:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 04:31:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 102 transitions.
[2024-11-07 04:31:01,885 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 102 transitions. Word has length 105
[2024-11-07 04:31:01,885 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:31:01,885 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 102 transitions.
[2024-11-07 04:31:01,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-07 04:31:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 102 transitions.
[2024-11-07 04:31:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2024-11-07 04:31:01,888 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:01,888 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:01,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 04:31:01,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:01,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:01,889 INFO L85 PathProgramCache]: Analyzing trace with hash -662991041, now seen corresponding path program 1 times
[2024-11-07 04:31:01,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:31:01,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212146736]
[2024-11-07 04:31:01,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:01,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:31:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:31:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:31:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:31:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:31:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:31:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:31:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:31:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:31:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:31:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:31:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:31:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 04:31:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:31:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:31:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:31:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 04:31:02,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:31:02,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212146736]
[2024-11-07 04:31:02,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212146736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:31:02,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:31:02,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 04:31:02,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400372369]
[2024-11-07 04:31:02,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:31:02,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 04:31:02,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:31:02,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 04:31:02,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 04:31:02,340 INFO L87 Difference]: Start difference. First operand 67 states and 102 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:31:02,402 INFO L93 Difference]: Finished difference Result 195 states and 300 transitions.
[2024-11-07 04:31:02,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 04:31:02,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105
[2024-11-07 04:31:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:31:02,405 INFO L225 Difference]: With dead ends: 195
[2024-11-07 04:31:02,405 INFO L226 Difference]: Without dead ends: 131
[2024-11-07 04:31:02,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 04:31:02,406 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 61 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 04:31:02,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 179 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 04:31:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2024-11-07 04:31:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129.
[2024-11-07 04:31:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 96 states have internal predecessors, (136), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2024-11-07 04:31:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 196 transitions.
[2024-11-07 04:31:02,423 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 196 transitions. Word has length 105
[2024-11-07 04:31:02,423 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:31:02,423 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 196 transitions.
[2024-11-07 04:31:02,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 196 transitions.
[2024-11-07 04:31:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2024-11-07 04:31:02,426 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:02,426 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:02,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 04:31:02,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:02,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:02,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1292298218, now seen corresponding path program 1 times
[2024-11-07 04:31:02,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:31:02,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021937458]
[2024-11-07 04:31:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:02,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:31:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:31:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:31:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:31:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:31:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:31:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:31:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:31:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:31:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:31:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:31:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:31:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 04:31:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:31:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:31:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:31:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 04:31:02,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:31:02,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021937458]
[2024-11-07 04:31:02,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021937458] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:31:02,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:31:02,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 04:31:02,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471972848]
[2024-11-07 04:31:02,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:31:02,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 04:31:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:31:02,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 04:31:02,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 04:31:02,601 INFO L87 Difference]: Start difference. First operand 129 states and 196 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:31:02,689 INFO L93 Difference]: Finished difference Result 373 states and 572 transitions.
[2024-11-07 04:31:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 04:31:02,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106
[2024-11-07 04:31:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:31:02,692 INFO L225 Difference]: With dead ends: 373
[2024-11-07 04:31:02,692 INFO L226 Difference]: Without dead ends: 247
[2024-11-07 04:31:02,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 04:31:02,693 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 86 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 04:31:02,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 257 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 04:31:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states.
[2024-11-07 04:31:02,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245.
[2024-11-07 04:31:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 180 states have (on average 1.4) internal successors, (252), 180 states have internal predecessors, (252), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60)
[2024-11-07 04:31:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 372 transitions.
[2024-11-07 04:31:02,719 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 372 transitions. Word has length 106
[2024-11-07 04:31:02,719 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:31:02,719 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 372 transitions.
[2024-11-07 04:31:02,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 372 transitions.
[2024-11-07 04:31:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2024-11-07 04:31:02,721 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:02,722 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:02,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 04:31:02,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:02,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash 257019204, now seen corresponding path program 1 times
[2024-11-07 04:31:02,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:31:02,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535425966]
[2024-11-07 04:31:02,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:02,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:31:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:31:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:31:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:31:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:31:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:31:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:31:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:31:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:31:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:31:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:31:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:31:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 04:31:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:31:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:31:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:31:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 04:31:02,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:31:02,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535425966]
[2024-11-07 04:31:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535425966] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:31:02,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:31:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 04:31:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908492032]
[2024-11-07 04:31:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:31:02,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 04:31:02,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:31:02,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 04:31:02,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 04:31:02,842 INFO L87 Difference]: Start difference. First operand 245 states and 372 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:31:02,890 INFO L93 Difference]: Finished difference Result 605 states and 914 transitions.
[2024-11-07 04:31:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 04:31:02,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 106
[2024-11-07 04:31:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:31:02,896 INFO L225 Difference]: With dead ends: 605
[2024-11-07 04:31:02,896 INFO L226 Difference]: Without dead ends: 363
[2024-11-07 04:31:02,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 04:31:02,898 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 43 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 04:31:02,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 216 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 04:31:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states.
[2024-11-07 04:31:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 281.
[2024-11-07 04:31:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 216 states have (on average 1.4074074074074074) internal successors, (304), 216 states have internal predecessors, (304), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60)
[2024-11-07 04:31:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 424 transitions.
[2024-11-07 04:31:02,935 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 424 transitions. Word has length 106
[2024-11-07 04:31:02,935 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:31:02,935 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 424 transitions.
[2024-11-07 04:31:02,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 424 transitions.
[2024-11-07 04:31:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2024-11-07 04:31:02,938 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:02,938 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:02,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 04:31:02,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:02,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:02,938 INFO L85 PathProgramCache]: Analyzing trace with hash -453972667, now seen corresponding path program 1 times
[2024-11-07 04:31:02,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:31:02,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580055892]
[2024-11-07 04:31:02,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:02,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:31:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:31:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:31:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:31:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:31:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:31:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:31:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:31:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:31:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:31:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:31:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:31:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 04:31:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:31:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:31:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:31:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked.
[2024-11-07 04:31:03,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:31:03,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580055892]
[2024-11-07 04:31:03,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580055892] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:31:03,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:31:03,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 04:31:03,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539474791]
[2024-11-07 04:31:03,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:31:03,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 04:31:03,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:31:03,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 04:31:03,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-07 04:31:03,902 INFO L87 Difference]: Start difference. First operand 281 states and 424 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:31:04,567 INFO L93 Difference]: Finished difference Result 857 states and 1248 transitions.
[2024-11-07 04:31:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2024-11-07 04:31:04,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107
[2024-11-07 04:31:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:31:04,570 INFO L225 Difference]: With dead ends: 857
[2024-11-07 04:31:04,570 INFO L226 Difference]: Without dead ends: 579
[2024-11-07 04:31:04,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342
[2024-11-07 04:31:04,572 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 210 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 04:31:04,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 376 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 04:31:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states.
[2024-11-07 04:31:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 351.
[2024-11-07 04:31:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 282 states have (on average 1.4219858156028369) internal successors, (401), 282 states have internal predecessors, (401), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60)
[2024-11-07 04:31:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 521 transitions.
[2024-11-07 04:31:04,614 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 521 transitions. Word has length 107
[2024-11-07 04:31:04,614 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:31:04,614 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 521 transitions.
[2024-11-07 04:31:04,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 521 transitions.
[2024-11-07 04:31:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2024-11-07 04:31:04,616 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:04,616 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:04,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 04:31:04,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:04,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:04,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2042320569, now seen corresponding path program 1 times
[2024-11-07 04:31:04,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:31:04,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646551056]
[2024-11-07 04:31:04,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:04,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:31:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:31:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:31:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:31:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:31:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:31:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:31:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:31:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:31:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:31:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:31:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:31:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 04:31:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:31:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:31:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:31:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 04:31:04,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:31:04,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646551056]
[2024-11-07 04:31:04,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646551056] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:31:04,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:31:04,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 04:31:04,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565337390]
[2024-11-07 04:31:04,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:31:04,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 04:31:04,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:31:04,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 04:31:04,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 04:31:04,764 INFO L87 Difference]: Start difference. First operand 351 states and 521 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:31:04,838 INFO L93 Difference]: Finished difference Result 851 states and 1264 transitions.
[2024-11-07 04:31:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 04:31:04,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107
[2024-11-07 04:31:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:31:04,841 INFO L225 Difference]: With dead ends: 851
[2024-11-07 04:31:04,841 INFO L226 Difference]: Without dead ends: 503
[2024-11-07 04:31:04,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 04:31:04,842 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 62 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 04:31:04,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 209 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 04:31:04,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states.
[2024-11-07 04:31:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 501.
[2024-11-07 04:31:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 398 states have (on average 1.4095477386934674) internal successors, (561), 398 states have internal predecessors, (561), 90 states have call successors, (90), 12 states have call predecessors, (90), 12 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90)
[2024-11-07 04:31:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 741 transitions.
[2024-11-07 04:31:04,879 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 741 transitions. Word has length 107
[2024-11-07 04:31:04,879 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:31:04,880 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 741 transitions.
[2024-11-07 04:31:04,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 741 transitions.
[2024-11-07 04:31:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2024-11-07 04:31:04,881 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:04,881 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:04,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-07 04:31:04,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:04,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:04,881 INFO L85 PathProgramCache]: Analyzing trace with hash 66668527, now seen corresponding path program 1 times
[2024-11-07 04:31:04,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:31:04,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082681763]
[2024-11-07 04:31:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:04,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:31:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:31:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:31:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:31:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:31:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:31:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:31:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:31:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:31:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:31:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:31:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:31:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 04:31:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:31:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:31:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:31:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 04:31:05,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:31:05,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082681763]
[2024-11-07 04:31:05,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082681763] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:31:05,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:31:05,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 04:31:05,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833117295]
[2024-11-07 04:31:05,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:31:05,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 04:31:05,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:31:05,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 04:31:05,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-07 04:31:05,057 INFO L87 Difference]: Start difference. First operand 501 states and 741 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-07 04:31:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:31:05,405 INFO L93 Difference]: Finished difference Result 1409 states and 2091 transitions.
[2024-11-07 04:31:05,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 04:31:05,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 107
[2024-11-07 04:31:05,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:31:05,413 INFO L225 Difference]: With dead ends: 1409
[2024-11-07 04:31:05,413 INFO L226 Difference]: Without dead ends: 1159
[2024-11-07 04:31:05,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2024-11-07 04:31:05,418 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 298 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 04:31:05,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 470 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 04:31:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states.
[2024-11-07 04:31:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1143.
[2024-11-07 04:31:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 904 states have (on average 1.413716814159292) internal successors, (1278), 904 states have internal predecessors, (1278), 210 states have call successors, (210), 28 states have call predecessors, (210), 28 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210)
[2024-11-07 04:31:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1698 transitions.
[2024-11-07 04:31:05,537 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1698 transitions. Word has length 107
[2024-11-07 04:31:05,538 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:31:05,538 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1698 transitions.
[2024-11-07 04:31:05,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-07 04:31:05,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1698 transitions.
[2024-11-07 04:31:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2024-11-07 04:31:05,539 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:05,539 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:05,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-07 04:31:05,540 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:05,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:05,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1351691309, now seen corresponding path program 1 times
[2024-11-07 04:31:05,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:31:05,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882217605]
[2024-11-07 04:31:05,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:05,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:31:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:31:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:31:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:31:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:31:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:31:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:31:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:31:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:31:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:31:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:31:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:31:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 04:31:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:31:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:31:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:31:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 04:31:05,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:31:05,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882217605]
[2024-11-07 04:31:05,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882217605] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:31:05,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:31:05,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-07 04:31:05,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784284835]
[2024-11-07 04:31:05,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:31:05,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-07 04:31:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:31:05,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-07 04:31:05,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-07 04:31:05,760 INFO L87 Difference]: Start difference. First operand 1143 states and 1698 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-07 04:31:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:31:06,197 INFO L93 Difference]: Finished difference Result 2305 states and 3417 transitions.
[2024-11-07 04:31:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 04:31:06,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108
[2024-11-07 04:31:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:31:06,203 INFO L225 Difference]: With dead ends: 2305
[2024-11-07 04:31:06,204 INFO L226 Difference]: Without dead ends: 1165
[2024-11-07 04:31:06,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182
[2024-11-07 04:31:06,206 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 305 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-07 04:31:06,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 571 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-07 04:31:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states.
[2024-11-07 04:31:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1145.
[2024-11-07 04:31:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 906 states have (on average 1.4094922737306843) internal successors, (1277), 906 states have internal predecessors, (1277), 210 states have call successors, (210), 28 states have call predecessors, (210), 28 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210)
[2024-11-07 04:31:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1697 transitions.
[2024-11-07 04:31:06,297 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1697 transitions. Word has length 108
[2024-11-07 04:31:06,298 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:31:06,298 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1697 transitions.
[2024-11-07 04:31:06,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-07 04:31:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1697 transitions.
[2024-11-07 04:31:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2024-11-07 04:31:06,299 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:06,299 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:06,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 04:31:06,299 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:06,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash 685923855, now seen corresponding path program 1 times
[2024-11-07 04:31:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:31:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117599461]
[2024-11-07 04:31:06,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:31:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:31:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:31:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:31:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:31:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:31:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:31:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:31:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:31:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:31:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:31:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:31:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 04:31:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:31:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:31:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:31:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked.
[2024-11-07 04:31:06,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:31:06,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117599461]
[2024-11-07 04:31:06,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117599461] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 04:31:06,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524431373]
[2024-11-07 04:31:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:06,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 04:31:06,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 04:31:06,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 04:31:06,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-07 04:31:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:06,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 24 conjuncts are in the unsatisfiable core
[2024-11-07 04:31:06,895 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 04:31:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 310 proven. 21 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked.
[2024-11-07 04:31:07,565 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 04:31:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 111 proven. 39 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked.
[2024-11-07 04:31:08,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524431373] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 04:31:08,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 04:31:08,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35
[2024-11-07 04:31:08,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653957565]
[2024-11-07 04:31:08,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 04:31:08,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-11-07 04:31:08,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:31:08,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-11-07 04:31:08,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=873, Unknown=0, NotChecked=0, Total=1190
[2024-11-07 04:31:08,376 INFO L87 Difference]: Start difference. First operand 1145 states and 1697 transitions. Second operand has 35 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33)
[2024-11-07 04:31:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:31:09,564 INFO L93 Difference]: Finished difference Result 2139 states and 3046 transitions.
[2024-11-07 04:31:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2024-11-07 04:31:09,565 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33) Word has length 108
[2024-11-07 04:31:09,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:31:09,570 INFO L225 Difference]: With dead ends: 2139
[2024-11-07 04:31:09,570 INFO L226 Difference]: Without dead ends: 1297
[2024-11-07 04:31:09,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1114, Invalid=2546, Unknown=0, NotChecked=0, Total=3660
[2024-11-07 04:31:09,573 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 983 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 04:31:09,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 445 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 04:31:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states.
[2024-11-07 04:31:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 527.
[2024-11-07 04:31:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 406 states have (on average 1.3226600985221675) internal successors, (537), 406 states have internal predecessors, (537), 90 states have call successors, (90), 30 states have call predecessors, (90), 30 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90)
[2024-11-07 04:31:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 717 transitions.
[2024-11-07 04:31:09,621 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 717 transitions. Word has length 108
[2024-11-07 04:31:09,621 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:31:09,621 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 717 transitions.
[2024-11-07 04:31:09,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 10 states have call successors, (32), 5 states have call predecessors, (32), 12 states have return successors, (33), 12 states have call predecessors, (33), 10 states have call successors, (33)
[2024-11-07 04:31:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 717 transitions.
[2024-11-07 04:31:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2024-11-07 04:31:09,622 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:09,622 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:09,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 04:31:09,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 04:31:09,823 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:09,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:09,824 INFO L85 PathProgramCache]: Analyzing trace with hash 206212576, now seen corresponding path program 1 times
[2024-11-07 04:31:09,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:31:09,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071381025]
[2024-11-07 04:31:09,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:09,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:31:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-07 04:31:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10
[2024-11-07 04:31:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-07 04:31:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-07 04:31:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-07 04:31:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-07 04:31:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-07 04:31:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-07 04:31:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49
[2024-11-07 04:31:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54
[2024-11-07 04:31:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-07 04:31:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66
[2024-11-07 04:31:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:09,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71
[2024-11-07 04:31:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:10,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77
[2024-11-07 04:31:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:10,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-07 04:31:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 04:31:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 04:31:10,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071381025]
[2024-11-07 04:31:10,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071381025] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:31:10,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:31:10,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 04:31:10,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260628390]
[2024-11-07 04:31:10,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:31:10,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 04:31:10,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 04:31:10,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 04:31:10,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 04:31:10,008 INFO L87 Difference]: Start difference. First operand 527 states and 717 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:31:10,208 INFO L93 Difference]: Finished difference Result 1356 states and 1873 transitions.
[2024-11-07 04:31:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 04:31:10,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108
[2024-11-07 04:31:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:31:10,213 INFO L225 Difference]: With dead ends: 1356
[2024-11-07 04:31:10,213 INFO L226 Difference]: Without dead ends: 1091
[2024-11-07 04:31:10,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-07 04:31:10,214 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 177 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 04:31:10,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 366 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 04:31:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states.
[2024-11-07 04:31:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 955.
[2024-11-07 04:31:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 754 states have (on average 1.343501326259947) internal successors, (1013), 754 states have internal predecessors, (1013), 150 states have call successors, (150), 50 states have call predecessors, (150), 50 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150)
[2024-11-07 04:31:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1313 transitions.
[2024-11-07 04:31:10,323 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1313 transitions. Word has length 108
[2024-11-07 04:31:10,323 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:31:10,323 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1313 transitions.
[2024-11-07 04:31:10,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1313 transitions.
[2024-11-07 04:31:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2024-11-07 04:31:10,324 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:10,325 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:10,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 04:31:10,325 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:10,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:10,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1387213154, now seen corresponding path program 1 times
[2024-11-07 04:31:10,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 04:31:10,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682564907]
[2024-11-07 04:31:10,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:10,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 04:31:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-07 04:31:10,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100280988]
[2024-11-07 04:31:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:10,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 04:31:10,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 04:31:10,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 04:31:10,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-07 04:31:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 04:31:10,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 04:31:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 04:31:10,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 04:31:10,587 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 04:31:10,587 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-07 04:31:10,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-07 04:31:10,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 04:31:10,795 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:10,857 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 04:31:10,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:31:10 BoogieIcfgContainer
[2024-11-07 04:31:10,864 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 04:31:10,865 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 04:31:10,865 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 04:31:10,865 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 04:31:10,865 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:31:01" (3/4) ...
[2024-11-07 04:31:10,867 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-07 04:31:10,868 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 04:31:10,869 INFO L158 Benchmark]: Toolchain (without parser) took 10204.00ms. Allocated memory was 109.1MB in the beginning and 302.0MB in the end (delta: 192.9MB). Free memory was 85.4MB in the beginning and 181.5MB in the end (delta: -96.1MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB.
[2024-11-07 04:31:10,869 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 04:31:10,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.24ms. Allocated memory is still 109.1MB. Free memory was 85.2MB in the beginning and 71.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 04:31:10,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.20ms. Allocated memory is still 109.1MB. Free memory was 71.4MB in the beginning and 68.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 04:31:10,870 INFO L158 Benchmark]: Boogie Preprocessor took 45.24ms. Allocated memory is still 109.1MB. Free memory was 68.0MB in the beginning and 63.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-07 04:31:10,870 INFO L158 Benchmark]: RCFGBuilder took 461.19ms. Allocated memory is still 109.1MB. Free memory was 63.3MB in the beginning and 41.9MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 04:31:10,870 INFO L158 Benchmark]: TraceAbstraction took 9392.80ms. Allocated memory was 109.1MB in the beginning and 302.0MB in the end (delta: 192.9MB). Free memory was 41.2MB in the beginning and 181.6MB in the end (delta: -140.3MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB.
[2024-11-07 04:31:10,871 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 302.0MB. Free memory was 181.6MB in the beginning and 181.5MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 04:31:10,872 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.15ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 246.24ms. Allocated memory is still 109.1MB. Free memory was 85.2MB in the beginning and 71.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 47.20ms. Allocated memory is still 109.1MB. Free memory was 71.4MB in the beginning and 68.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 45.24ms. Allocated memory is still 109.1MB. Free memory was 68.0MB in the beginning and 63.3MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 461.19ms. Allocated memory is still 109.1MB. Free memory was 63.3MB in the beginning and 41.9MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 9392.80ms. Allocated memory was 109.1MB in the beginning and 302.0MB in the end (delta: 192.9MB). Free memory was 41.2MB in the beginning and 181.6MB in the end (delta: -140.3MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB.
* Witness Printer took 3.12ms. Allocated memory is still 302.0MB. Free memory was 181.6MB in the beginning and 181.5MB in the end (delta: 39.2kB). 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 117, overapproximation of bitwiseOr at line 80.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] signed char var_1_1 = -64;
[L23] unsigned char var_1_3 = 1;
[L24] signed char var_1_5 = -32;
[L25] unsigned short int var_1_6 = 256;
[L26] unsigned long int var_1_10 = 256;
[L27] double var_1_12 = 8.2;
[L28] signed char var_1_13 = 16;
[L29] signed char var_1_14 = 10;
[L30] double var_1_15 = 199.125;
[L31] double var_1_16 = 9.4;
[L32] double var_1_17 = 9999999999999.6;
[L33] unsigned char var_1_20 = 32;
[L34] unsigned char var_1_21 = 128;
[L35] unsigned char var_1_22 = 64;
[L36] unsigned long int var_1_23 = 64;
[L37] unsigned long int last_1_var_1_10 = 256;
[L38] unsigned char last_1_var_1_20 = 32;
VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256]
[L121] isInitial = 1
[L122] FCALL initially()
[L123] COND TRUE 1
[L124] CALL updateLastVariables()
[L113] last_1_var_1_10 = var_1_10
[L114] last_1_var_1_20 = var_1_20
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256]
[L124] RET updateLastVariables()
[L125] CALL updateVariables()
[L88] var_1_3 = __VERIFIER_nondet_uchar()
[L89] CALL assume_abort_if_not(var_1_3 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256]
[L89] RET assume_abort_if_not(var_1_3 >= 0)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256]
[L90] CALL assume_abort_if_not(var_1_3 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256]
[L90] RET assume_abort_if_not(var_1_3 <= 1)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256]
[L91] var_1_5 = __VERIFIER_nondet_char()
[L92] CALL assume_abort_if_not(var_1_5 >= -127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L92] RET assume_abort_if_not(var_1_5 >= -127)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L93] CALL assume_abort_if_not(var_1_5 <= 126)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L93] RET assume_abort_if_not(var_1_5 <= 126)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L94] var_1_13 = __VERIFIER_nondet_char()
[L95] CALL assume_abort_if_not(var_1_13 >= -1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L95] RET assume_abort_if_not(var_1_13 >= -1)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L96] CALL assume_abort_if_not(var_1_13 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L96] RET assume_abort_if_not(var_1_13 <= 127)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L97] var_1_14 = __VERIFIER_nondet_char()
[L98] CALL assume_abort_if_not(var_1_14 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L98] RET assume_abort_if_not(var_1_14 >= 0)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L99] CALL assume_abort_if_not(var_1_14 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L99] RET assume_abort_if_not(var_1_14 <= 127)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L100] var_1_15 = __VERIFIER_nondet_double()
[L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L102] CALL assume_abort_if_not(var_1_15 != 0.0F)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L102] RET assume_abort_if_not(var_1_15 != 0.0F)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L103] var_1_16 = __VERIFIER_nondet_double()
[L104] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L104] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L105] var_1_21 = __VERIFIER_nondet_uchar()
[L106] CALL assume_abort_if_not(var_1_21 >= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L106] RET assume_abort_if_not(var_1_21 >= 127)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L107] CALL assume_abort_if_not(var_1_21 <= 254)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L107] RET assume_abort_if_not(var_1_21 <= 254)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L108] var_1_22 = __VERIFIER_nondet_uchar()
[L109] CALL assume_abort_if_not(var_1_22 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L109] RET assume_abort_if_not(var_1_22 >= 0)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L110] CALL assume_abort_if_not(var_1_22 <= 127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L110] RET assume_abort_if_not(var_1_22 <= 127)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L125] RET updateVariables()
[L126] CALL step()
[L42] COND FALSE !(\read(var_1_3))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L47] signed long int stepLocal_2 = var_1_5 * var_1_13;
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-8, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L48] COND TRUE stepLocal_2 > last_1_var_1_10
[L49] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8))))))
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L51] COND FALSE !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L56] unsigned char stepLocal_1 = var_1_17 <= var_1_17;
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L57] COND FALSE !(stepLocal_1 || var_1_3)
[L62] var_1_12 = var_1_16
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L64] COND FALSE !(99999.8f < var_1_17)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L75] COND FALSE !((var_1_17 + var_1_12) <= var_1_17)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L80] EXPR var_1_6 ^ var_1_20
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L80] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23;
[L81] COND TRUE var_1_20 <= stepLocal_0
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L82] COND FALSE !(var_1_12 == var_1_12)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L126] RET step()
[L127] CALL, EXPR property()
[L117] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L117-L118] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1)
;
[L127] RET, EXPR property()
[L127] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=-256, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2231 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2225 mSDsluCounter, 3191 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2106 mSDsCounter, 556 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1606 IncrementalHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 556 mSolverCounterUnsat, 1085 mSDtfsCounter, 1606 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 533 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1145occurred in iteration=8, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1258 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1393 NumberOfCodeBlocks, 1393 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1271 ConstructedInterpolants, 0 QuantifiedInterpolants, 5432 SizeOfPredicates, 6 NumberOfNonLiveVariables, 255 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 4959/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-07 04:31:10,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.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 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 04:31:12,983 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 04:31:13,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-07 04:31:13,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 04:31:13,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 04:31:13,098 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 04:31:13,099 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 04:31:13,099 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 04:31:13,099 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 04:31:13,099 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 04:31:13,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 04:31:13,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 04:31:13,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 04:31:13,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 04:31:13,099 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 04:31:13,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 04:31:13,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 04:31:13,100 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 04:31:13,100 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 04:31:13,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 04:31:13,100 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 04:31:13,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 04:31:13,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 04:31:13,100 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-07 04:31:13,101 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-07 04:31:13,102 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 04:31:13,102 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-07 04:31:13,102 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 04:31:13,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 04:31:13,102 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 04:31:13,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 04:31:13,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 04:31:13,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 04:31:13,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 04:31:13,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 04:31:13,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 04:31:13,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 04:31:13,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 04:31:13,103 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-07 04:31:13,103 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-07 04:31:13,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 04:31:13,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 04:31:13,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 04:31:13,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 04:31:13,104 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 -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7
[2024-11-07 04:31:13,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 04:31:13,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 04:31:13,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 04:31:13,370 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 04:31:13,373 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 04:31:13,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i
[2024-11-07 04:31:14,683 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 04:31:14,845 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 04:31:14,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i
[2024-11-07 04:31:14,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bac084a02/d65d4d428c93419aad2531c2ced3897e/FLAG27a87224d
[2024-11-07 04:31:14,871 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bac084a02/d65d4d428c93419aad2531c2ced3897e
[2024-11-07 04:31:14,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 04:31:14,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 04:31:14,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 04:31:14,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 04:31:14,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 04:31:14,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:31:14" (1/1) ...
[2024-11-07 04:31:14,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e80d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:14, skipping insertion in model container
[2024-11-07 04:31:14,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:31:14" (1/1) ...
[2024-11-07 04:31:14,895 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 04:31:15,006 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_fillercode_fillercodesize_normal_file-3.i[912,925]
[2024-11-07 04:31:15,068 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 04:31:15,081 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 04:31:15,092 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_fillercode_fillercodesize_normal_file-3.i[912,925]
[2024-11-07 04:31:15,120 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 04:31:15,133 INFO L204 MainTranslator]: Completed translation
[2024-11-07 04:31:15,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15 WrapperNode
[2024-11-07 04:31:15,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 04:31:15,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 04:31:15,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 04:31:15,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 04:31:15,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (1/1) ...
[2024-11-07 04:31:15,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (1/1) ...
[2024-11-07 04:31:15,170 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119
[2024-11-07 04:31:15,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 04:31:15,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 04:31:15,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 04:31:15,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 04:31:15,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (1/1) ...
[2024-11-07 04:31:15,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (1/1) ...
[2024-11-07 04:31:15,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (1/1) ...
[2024-11-07 04:31:15,201 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-07 04:31:15,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (1/1) ...
[2024-11-07 04:31:15,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (1/1) ...
[2024-11-07 04:31:15,212 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (1/1) ...
[2024-11-07 04:31:15,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (1/1) ...
[2024-11-07 04:31:15,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (1/1) ...
[2024-11-07 04:31:15,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (1/1) ...
[2024-11-07 04:31:15,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 04:31:15,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 04:31:15,228 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 04:31:15,228 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 04:31:15,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (1/1) ...
[2024-11-07 04:31:15,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 04:31:15,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 04:31:15,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-07 04:31:15,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-07 04:31:15,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 04:31:15,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-07 04:31:15,282 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-07 04:31:15,282 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-07 04:31:15,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 04:31:15,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 04:31:15,348 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 04:31:15,349 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 04:31:30,354 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live.
[2024-11-07 04:31:30,355 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 04:31:30,369 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 04:31:30,369 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-07 04:31:30,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:31:30 BoogieIcfgContainer
[2024-11-07 04:31:30,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 04:31:30,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 04:31:30,376 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 04:31:30,383 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 04:31:30,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:31:14" (1/3) ...
[2024-11-07 04:31:30,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40680dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:31:30, skipping insertion in model container
[2024-11-07 04:31:30,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:31:15" (2/3) ...
[2024-11-07 04:31:30,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40680dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:31:30, skipping insertion in model container
[2024-11-07 04:31:30,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:31:30" (3/3) ...
[2024-11-07 04:31:30,385 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-3.i
[2024-11-07 04:31:30,402 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 04:31:30,402 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-07 04:31:30,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 04:31:30,479 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;@34bb4150, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 04:31:30,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-07 04:31:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 04:31:30,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2024-11-07 04:31:30,488 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:30,488 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:30,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:30,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:30,494 INFO L85 PathProgramCache]: Analyzing trace with hash 990176220, now seen corresponding path program 1 times
[2024-11-07 04:31:30,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 04:31:30,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20175910]
[2024-11-07 04:31:30,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:30,501 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 04:31:30,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 04:31:30,505 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 04:31:30,506 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 04:31:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:31,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-07 04:31:31,387 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 04:31:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked.
[2024-11-07 04:31:31,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 04:31:31,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 04:31:31,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20175910]
[2024-11-07 04:31:31,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20175910] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:31:31,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:31:31,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 04:31:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513156063]
[2024-11-07 04:31:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:31:31,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 04:31:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 04:31:31,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 04:31:31,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 04:31:31,428 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 43 states have internal predecessors, (62), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-07 04:31:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:31:31,442 INFO L93 Difference]: Finished difference Result 113 states and 193 transitions.
[2024-11-07 04:31:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 04:31:31,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102
[2024-11-07 04:31:31,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:31:31,448 INFO L225 Difference]: With dead ends: 113
[2024-11-07 04:31:31,448 INFO L226 Difference]: Without dead ends: 56
[2024-11-07 04:31:31,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 04:31:31,451 INFO L432 NwaCegarLoop]: 84 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, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 04:31:31,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 04:31:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2024-11-07 04:31:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56.
[2024-11-07 04:31:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15)
[2024-11-07 04:31:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions.
[2024-11-07 04:31:31,487 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 102
[2024-11-07 04:31:31,488 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:31:31,488 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions.
[2024-11-07 04:31:31,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2024-11-07 04:31:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions.
[2024-11-07 04:31:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2024-11-07 04:31:31,491 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:31:31,491 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:31:31,544 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 04:31:31,697 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 04:31:31,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:31:31,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:31:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1728304218, now seen corresponding path program 1 times
[2024-11-07 04:31:31,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 04:31:31,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561809441]
[2024-11-07 04:31:31,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:31:31,699 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 04:31:31,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 04:31:31,705 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 04:31:31,706 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 04:31:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:31:32,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 04:31:32,610 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 04:31:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 04:31:35,457 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 04:31:35,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 04:31:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561809441]
[2024-11-07 04:31:35,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561809441] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:31:35,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:31:35,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 04:31:35,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099045694]
[2024-11-07 04:31:35,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:31:35,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 04:31:35,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 04:31:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 04:31:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 04:31:35,464 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:31:38,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:31:42,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:31:46,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:31:51,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:31:55,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:31:58,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:32:00,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:32:05,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:32:09,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:32:13,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:32:17,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:32:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:32:17,044 INFO L93 Difference]: Finished difference Result 162 states and 246 transitions.
[2024-11-07 04:32:17,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 04:32:17,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102
[2024-11-07 04:32:17,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:32:17,184 INFO L225 Difference]: With dead ends: 162
[2024-11-07 04:32:17,184 INFO L226 Difference]: Without dead ends: 109
[2024-11-07 04:32:17,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 04:32:17,186 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 30 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.5s IncrementalHoareTripleChecker+Time
[2024-11-07 04:32:17,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 247 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 8 Unknown, 0 Unchecked, 41.5s Time]
[2024-11-07 04:32:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2024-11-07 04:32:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107.
[2024-11-07 04:32:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2024-11-07 04:32:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 161 transitions.
[2024-11-07 04:32:17,214 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 161 transitions. Word has length 102
[2024-11-07 04:32:17,214 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:32:17,214 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 161 transitions.
[2024-11-07 04:32:17,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:32:17,214 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 161 transitions.
[2024-11-07 04:32:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2024-11-07 04:32:17,215 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:32:17,215 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:32:17,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2024-11-07 04:32:17,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 04:32:17,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:32:17,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:32:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1759076794, now seen corresponding path program 1 times
[2024-11-07 04:32:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 04:32:17,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823656212]
[2024-11-07 04:32:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:32:17,418 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 04:32:17,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 04:32:17,420 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 04:32:17,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-07 04:32:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:32:18,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-07 04:32:18,373 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 04:32:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 04:32:18,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 04:32:18,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 04:32:18,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823656212]
[2024-11-07 04:32:18,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823656212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:32:18,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:32:18,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 04:32:18,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646878560]
[2024-11-07 04:32:18,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:32:18,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 04:32:18,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 04:32:18,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 04:32:18,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 04:32:18,598 INFO L87 Difference]: Start difference. First operand 107 states and 161 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:32:23,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:32:27,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:32:27,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 04:32:27,275 INFO L93 Difference]: Finished difference Result 253 states and 380 transitions.
[2024-11-07 04:32:27,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 04:32:27,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103
[2024-11-07 04:32:27,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 04:32:27,277 INFO L225 Difference]: With dead ends: 253
[2024-11-07 04:32:27,277 INFO L226 Difference]: Without dead ends: 149
[2024-11-07 04:32:27,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 04:32:27,278 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 28 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time
[2024-11-07 04:32:27,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 148 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time]
[2024-11-07 04:32:27,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2024-11-07 04:32:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125.
[2024-11-07 04:32:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 92 states have (on average 1.358695652173913) internal successors, (125), 92 states have internal predecessors, (125), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30)
[2024-11-07 04:32:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 185 transitions.
[2024-11-07 04:32:27,306 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 185 transitions. Word has length 103
[2024-11-07 04:32:27,307 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 04:32:27,308 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 185 transitions.
[2024-11-07 04:32:27,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:32:27,308 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 185 transitions.
[2024-11-07 04:32:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2024-11-07 04:32:27,309 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 04:32:27,309 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 04:32:27,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-11-07 04:32:27,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-07 04:32:27,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-07 04:32:27,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 04:32:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash 166944915, now seen corresponding path program 1 times
[2024-11-07 04:32:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-07 04:32:27,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597141162]
[2024-11-07 04:32:27,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 04:32:27,510 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 04:32:27,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-07 04:32:27,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-07 04:32:27,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-07 04:32:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 04:32:28,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 04:32:28,468 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 04:32:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked.
[2024-11-07 04:32:31,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 04:32:31,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-07 04:32:31,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597141162]
[2024-11-07 04:32:31,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597141162] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 04:32:31,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 04:32:31,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 04:32:31,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298168079]
[2024-11-07 04:32:31,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 04:32:31,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 04:32:31,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-07 04:32:31,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 04:32:31,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-07 04:32:31,522 INFO L87 Difference]: Start difference. First operand 125 states and 185 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)
[2024-11-07 04:32:36,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-07 04:32:40,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []