./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version d790fecc
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB --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 ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-11-27 23:20:58,757 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-27 23:20:58,883 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-27 23:20:58,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-27 23:20:58,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-27 23:20:58,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-27 23:20:58,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-27 23:20:58,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-27 23:20:58,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-27 23:20:58,926 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-27 23:20:58,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-27 23:20:58,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-27 23:20:58,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-27 23:20:58,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-27 23:20:58,927 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-27 23:20:58,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-27 23:20:58,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-27 23:20:58,928 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-27 23:20:58,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-27 23:20:58,928 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-27 23:20:58,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-27 23:20:58,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-27 23:20:58,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-27 23:20:58,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-27 23:20:58,929 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-27 23:20:58,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-27 23:20:58,929 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-27 23:20:58,929 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-27 23:20:58,929 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-27 23:20:58,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-27 23:20:58,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-27 23:20:58,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-27 23:20:58,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-27 23:20:58,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-27 23:20:58,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-27 23:20:58,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-27 23:20:58,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-27 23:20:58,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-27 23:20:58,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-27 23:20:58,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-27 23:20:58,935 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-11-27 23:20:58,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-27 23:20:58,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-27 23:20:58,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-27 23:20:58,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-27 23:20:58,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-27 23:20:58,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-27 23:20:58,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-27 23:20:58,937 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB
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 -> ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445
[2024-11-27 23:20:59,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-27 23:20:59,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-27 23:20:59,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-27 23:20:59,336 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-27 23:20:59,336 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-27 23:20:59,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i
[2024-11-27 23:21:03,129 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/data/fd8a69409/c533863144e546c88664ceb4ce9e2140/FLAGa6a48265b
[2024-11-27 23:21:03,486 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-27 23:21:03,487 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i
[2024-11-27 23:21:03,497 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/data/fd8a69409/c533863144e546c88664ceb4ce9e2140/FLAGa6a48265b
[2024-11-27 23:21:03,515 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/data/fd8a69409/c533863144e546c88664ceb4ce9e2140
[2024-11-27 23:21:03,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-27 23:21:03,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-27 23:21:03,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-27 23:21:03,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-27 23:21:03,529 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-27 23:21:03,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:21:03" (1/1) ...
[2024-11-27 23:21:03,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343e97c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:03, skipping insertion in model container
[2024-11-27 23:21:03,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:21:03" (1/1) ...
[2024-11-27 23:21:03,556 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-27 23:21:03,793 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929]
[2024-11-27 23:21:03,906 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-27 23:21:03,922 INFO L200 MainTranslator]: Completed pre-run
[2024-11-27 23:21:03,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929]
[2024-11-27 23:21:04,001 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-27 23:21:04,029 INFO L204 MainTranslator]: Completed translation
[2024-11-27 23:21:04,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04 WrapperNode
[2024-11-27 23:21:04,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-27 23:21:04,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-27 23:21:04,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-27 23:21:04,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-27 23:21:04,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,127 INFO L138 Inliner]: procedures = 30, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 580
[2024-11-27 23:21:04,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-27 23:21:04,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-27 23:21:04,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-27 23:21:04,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-27 23:21:04,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,165 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS
[2024-11-27 23:21:04,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,197 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,207 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-27 23:21:04,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-27 23:21:04,218 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-27 23:21:04,218 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-27 23:21:04,219 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (1/1) ...
[2024-11-27 23:21:04,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-27 23:21:04,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-27 23:21:04,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-27 23:21:04,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-27 23:21:04,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-27 23:21:04,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real
[2024-11-27 23:21:04,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int
[2024-11-27 23:21:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2024-11-27 23:21:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~real
[2024-11-27 23:21:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~real
[2024-11-27 23:21:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2024-11-27 23:21:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-27 23:21:04,322 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-27 23:21:04,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-11-27 23:21:04,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-27 23:21:04,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-27 23:21:04,501 INFO L234 CfgBuilder]: Building ICFG
[2024-11-27 23:21:04,506 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-27 23:21:05,579 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live.
[2024-11-27 23:21:05,579 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-27 23:21:05,597 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-27 23:21:05,597 INFO L312 CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-27 23:21:05,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:21:05 BoogieIcfgContainer
[2024-11-27 23:21:05,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-27 23:21:05,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-27 23:21:05,601 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-27 23:21:05,608 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-27 23:21:05,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:21:03" (1/3) ...
[2024-11-27 23:21:05,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f96ec9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:21:05, skipping insertion in model container
[2024-11-27 23:21:05,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:04" (2/3) ...
[2024-11-27 23:21:05,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f96ec9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:21:05, skipping insertion in model container
[2024-11-27 23:21:05,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:21:05" (3/3) ...
[2024-11-27 23:21:05,612 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-11.i
[2024-11-27 23:21:05,632 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-27 23:21:05,634 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-11.i that has 2 procedures, 139 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2024-11-27 23:21:05,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-27 23:21:05,742 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;@617ba00a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-27 23:21:05,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-27 23:21:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:21:05,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-11-27 23:21:05,773 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:21:05,774 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:21:05,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:21:05,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:21:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1531865718, now seen corresponding path program 1 times
[2024-11-27 23:21:05,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-27 23:21:05,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894120645]
[2024-11-27 23:21:05,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:05,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-27 23:21:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked.
[2024-11-27 23:21:06,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-27 23:21:06,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894120645]
[2024-11-27 23:21:06,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894120645] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-27 23:21:06,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108424255]
[2024-11-27 23:21:06,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:06,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-27 23:21:06,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-27 23:21:06,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-27 23:21:06,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-27 23:21:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:06,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-27 23:21:07,008 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:21:07,059 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked.
[2024-11-27 23:21:07,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:21:07,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108424255] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:21:07,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-27 23:21:07,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2024-11-27 23:21:07,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099896277]
[2024-11-27 23:21:07,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:21:07,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-27 23:21:07,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-27 23:21:07,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-27 23:21:07,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-27 23:21:07,119 INFO L87 Difference]: Start difference. First operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-27 23:21:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:21:07,166 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions.
[2024-11-27 23:21:07,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-27 23:21:07,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133
[2024-11-27 23:21:07,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:21:07,178 INFO L225 Difference]: With dead ends: 271
[2024-11-27 23:21:07,178 INFO L226 Difference]: Without dead ends: 135
[2024-11-27 23:21:07,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-27 23:21:07,186 INFO L435 NwaCegarLoop]: 201 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, 201 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-27 23:21:07,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-27 23:21:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states.
[2024-11-27 23:21:07,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135.
[2024-11-27 23:21:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:21:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions.
[2024-11-27 23:21:07,256 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133
[2024-11-27 23:21:07,256 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:21:07,256 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions.
[2024-11-27 23:21:07,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-27 23:21:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions.
[2024-11-27 23:21:07,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-11-27 23:21:07,261 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:21:07,261 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:21:07,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-27 23:21:07,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2024-11-27 23:21:07,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:21:07,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:21:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash 736442078, now seen corresponding path program 1 times
[2024-11-27 23:21:07,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-27 23:21:07,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664927236]
[2024-11-27 23:21:07,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:07,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-27 23:21:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2024-11-27 23:21:08,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-27 23:21:08,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664927236]
[2024-11-27 23:21:08,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664927236] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-27 23:21:08,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408545952]
[2024-11-27 23:21:08,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:08,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-27 23:21:08,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-27 23:21:08,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-27 23:21:08,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-27 23:21:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:08,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-27 23:21:08,824 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:21:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:21:08,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:21:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408545952] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:21:08,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-27 23:21:08,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7
[2024-11-27 23:21:08,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047798854]
[2024-11-27 23:21:08,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:21:08,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-27 23:21:08,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-27 23:21:08,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-27 23:21:08,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-27 23:21:08,911 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:08,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:21:08,982 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions.
[2024-11-27 23:21:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-27 23:21:08,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133
[2024-11-27 23:21:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:21:08,989 INFO L225 Difference]: With dead ends: 269
[2024-11-27 23:21:08,989 INFO L226 Difference]: Without dead ends: 137
[2024-11-27 23:21:08,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-27 23:21:08,992 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-27 23:21:08,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-27 23:21:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states.
[2024-11-27 23:21:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137.
[2024-11-27 23:21:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:21:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions.
[2024-11-27 23:21:09,028 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 133
[2024-11-27 23:21:09,029 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:21:09,030 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions.
[2024-11-27 23:21:09,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions.
[2024-11-27 23:21:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2024-11-27 23:21:09,036 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:21:09,037 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:21:09,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-27 23:21:09,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1
[2024-11-27 23:21:09,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:21:09,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:21:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1071614654, now seen corresponding path program 1 times
[2024-11-27 23:21:09,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-27 23:21:09,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617767269]
[2024-11-27 23:21:09,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:09,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-27 23:21:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2024-11-27 23:21:09,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-27 23:21:09,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617767269]
[2024-11-27 23:21:09,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617767269] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-27 23:21:09,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084479127]
[2024-11-27 23:21:09,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:09,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-27 23:21:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-27 23:21:09,803 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-27 23:21:09,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-27 23:21:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:10,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-27 23:21:10,217 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:21:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:21:10,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:21:10,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084479127] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:21:10,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-27 23:21:10,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8
[2024-11-27 23:21:10,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001387978]
[2024-11-27 23:21:10,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:21:10,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-27 23:21:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-27 23:21:10,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-27 23:21:10,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-27 23:21:10,278 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:10,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:21:10,375 INFO L93 Difference]: Finished difference Result 274 states and 407 transitions.
[2024-11-27 23:21:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-27 23:21:10,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135
[2024-11-27 23:21:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:21:10,381 INFO L225 Difference]: With dead ends: 274
[2024-11-27 23:21:10,381 INFO L226 Difference]: Without dead ends: 140
[2024-11-27 23:21:10,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-27 23:21:10,387 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-27 23:21:10,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-27 23:21:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2024-11-27 23:21:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140.
[2024-11-27 23:21:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4262295081967213) internal successors, (174), 122 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:21:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions.
[2024-11-27 23:21:10,414 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 135
[2024-11-27 23:21:10,414 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:21:10,414 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions.
[2024-11-27 23:21:10,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:10,415 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions.
[2024-11-27 23:21:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2024-11-27 23:21:10,417 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:21:10,421 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:21:10,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-27 23:21:10,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-27 23:21:10,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:21:10,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:21:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1857035872, now seen corresponding path program 1 times
[2024-11-27 23:21:10,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-27 23:21:10,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92712588]
[2024-11-27 23:21:10,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:10,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-27 23:21:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2024-11-27 23:21:11,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-27 23:21:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92712588]
[2024-11-27 23:21:11,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92712588] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-27 23:21:11,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531776454]
[2024-11-27 23:21:11,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:11,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-27 23:21:11,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-27 23:21:11,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-27 23:21:11,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-27 23:21:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:11,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-27 23:21:11,498 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:21:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:21:11,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:21:11,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531776454] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:21:11,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-27 23:21:11,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9
[2024-11-27 23:21:11,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528165502]
[2024-11-27 23:21:11,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:21:11,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-27 23:21:11,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-27 23:21:11,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-27 23:21:11,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-11-27 23:21:11,556 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:21:11,617 INFO L93 Difference]: Finished difference Result 280 states and 413 transitions.
[2024-11-27 23:21:11,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-27 23:21:11,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136
[2024-11-27 23:21:11,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:21:11,621 INFO L225 Difference]: With dead ends: 280
[2024-11-27 23:21:11,621 INFO L226 Difference]: Without dead ends: 143
[2024-11-27 23:21:11,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-11-27 23:21:11,624 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-27 23:21:11,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 777 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-27 23:21:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states.
[2024-11-27 23:21:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141.
[2024-11-27 23:21:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 123 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:21:11,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions.
[2024-11-27 23:21:11,647 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 136
[2024-11-27 23:21:11,647 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:21:11,647 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions.
[2024-11-27 23:21:11,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:11,648 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions.
[2024-11-27 23:21:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2024-11-27 23:21:11,650 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:21:11,650 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:21:11,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-27 23:21:11,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-27 23:21:11,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:21:11,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:21:11,852 INFO L85 PathProgramCache]: Analyzing trace with hash 424638356, now seen corresponding path program 1 times
[2024-11-27 23:21:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-27 23:21:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174249114]
[2024-11-27 23:21:11,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-27 23:21:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2024-11-27 23:21:12,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-27 23:21:12,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174249114]
[2024-11-27 23:21:12,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174249114] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-27 23:21:12,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642834512]
[2024-11-27 23:21:12,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:12,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-27 23:21:12,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-27 23:21:12,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-27 23:21:12,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-27 23:21:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:12,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-27 23:21:12,750 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:21:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:21:12,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:21:12,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642834512] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:21:12,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-27 23:21:12,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8
[2024-11-27 23:21:12,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575986226]
[2024-11-27 23:21:12,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:21:12,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-27 23:21:12,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-27 23:21:12,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-27 23:21:12,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-27 23:21:12,825 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:21:12,897 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions.
[2024-11-27 23:21:12,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-27 23:21:12,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137
[2024-11-27 23:21:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:21:12,901 INFO L225 Difference]: With dead ends: 282
[2024-11-27 23:21:12,902 INFO L226 Difference]: Without dead ends: 144
[2024-11-27 23:21:12,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-27 23:21:12,904 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-27 23:21:12,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 776 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-27 23:21:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states.
[2024-11-27 23:21:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144.
[2024-11-27 23:21:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 126 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:21:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions.
[2024-11-27 23:21:12,918 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 137
[2024-11-27 23:21:12,919 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:21:12,919 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions.
[2024-11-27 23:21:12,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions.
[2024-11-27 23:21:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2024-11-27 23:21:12,922 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:21:12,922 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:21:12,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-11-27 23:21:13,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-27 23:21:13,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:21:13,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:21:13,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1905414409, now seen corresponding path program 1 times
[2024-11-27 23:21:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-27 23:21:13,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328028209]
[2024-11-27 23:21:13,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:13,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-27 23:21:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked.
[2024-11-27 23:21:13,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-27 23:21:13,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328028209]
[2024-11-27 23:21:13,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328028209] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-27 23:21:13,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349770870]
[2024-11-27 23:21:13,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:13,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-27 23:21:13,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-27 23:21:13,608 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-27 23:21:13,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-27 23:21:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:14,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-27 23:21:14,066 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:21:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:21:14,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:21:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349770870] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:21:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-27 23:21:14,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10
[2024-11-27 23:21:14,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312519356]
[2024-11-27 23:21:14,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:21:14,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-27 23:21:14,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-27 23:21:14,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-27 23:21:14,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-11-27 23:21:14,144 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:21:14,223 INFO L93 Difference]: Finished difference Result 289 states and 422 transitions.
[2024-11-27 23:21:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-27 23:21:14,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137
[2024-11-27 23:21:14,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:21:14,225 INFO L225 Difference]: With dead ends: 289
[2024-11-27 23:21:14,226 INFO L226 Difference]: Without dead ends: 148
[2024-11-27 23:21:14,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-11-27 23:21:14,227 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 964 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.1s IncrementalHoareTripleChecker+Time
[2024-11-27 23:21:14,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 964 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-27 23:21:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states.
[2024-11-27 23:21:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145.
[2024-11-27 23:21:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 127 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:21:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions.
[2024-11-27 23:21:14,250 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 137
[2024-11-27 23:21:14,251 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:21:14,251 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions.
[2024-11-27 23:21:14,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:14,251 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions.
[2024-11-27 23:21:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-27 23:21:14,255 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:21:14,256 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:21:14,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-27 23:21:14,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-27 23:21:14,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:21:14,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:21:14,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1129593061, now seen corresponding path program 1 times
[2024-11-27 23:21:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-27 23:21:14,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097688519]
[2024-11-27 23:21:14,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-27 23:21:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:21:14,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-27 23:21:14,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097688519]
[2024-11-27 23:21:14,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097688519] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:21:14,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-27 23:21:14,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-27 23:21:14,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4765580]
[2024-11-27 23:21:14,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:21:14,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-27 23:21:14,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-27 23:21:14,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-27 23:21:14,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-27 23:21:14,636 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:21:14,683 INFO L93 Difference]: Finished difference Result 288 states and 421 transitions.
[2024-11-27 23:21:14,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-27 23:21:14,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138
[2024-11-27 23:21:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:21:14,686 INFO L225 Difference]: With dead ends: 288
[2024-11-27 23:21:14,686 INFO L226 Difference]: Without dead ends: 146
[2024-11-27 23:21:14,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-27 23:21:14,688 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-27 23:21:14,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-27 23:21:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2024-11-27 23:21:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146.
[2024-11-27 23:21:14,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.40625) internal successors, (180), 128 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:21:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions.
[2024-11-27 23:21:14,698 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 138
[2024-11-27 23:21:14,699 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:21:14,699 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions.
[2024-11-27 23:21:14,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions.
[2024-11-27 23:21:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-27 23:21:14,701 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:21:14,702 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:21:14,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-27 23:21:14,702 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:21:14,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:21:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1885510557, now seen corresponding path program 1 times
[2024-11-27 23:21:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-27 23:21:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913608357]
[2024-11-27 23:21:14,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:14,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-27 23:21:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-27 23:21:14,873 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-27 23:21:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-27 23:21:15,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-27 23:21:15,051 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-27 23:21:15,053 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-27 23:21:15,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-27 23:21:15,061 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-27 23:21:15,178 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-27 23:21:15,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:21:15 BoogieIcfgContainer
[2024-11-27 23:21:15,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-27 23:21:15,187 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-27 23:21:15,187 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-27 23:21:15,188 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-27 23:21:15,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:21:05" (3/4) ...
[2024-11-27 23:21:15,194 INFO L149 WitnessPrinter]: No result that supports witness generation found
[2024-11-27 23:21:15,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-27 23:21:15,196 INFO L158 Benchmark]: Toolchain (without parser) took 11675.41ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 92.3MB in the beginning and 95.0MB in the end (delta: -2.7MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB.
[2024-11-27 23:21:15,196 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-27 23:21:15,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.78ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 75.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-27 23:21:15,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.05ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 70.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-27 23:21:15,198 INFO L158 Benchmark]: Boogie Preprocessor took 88.28ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 67.0MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-27 23:21:15,199 INFO L158 Benchmark]: RCFGBuilder took 1380.60ms. Allocated memory is still 117.4MB. Free memory was 67.0MB in the beginning and 83.7MB in the end (delta: -16.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB.
[2024-11-27 23:21:15,200 INFO L158 Benchmark]: TraceAbstraction took 9585.90ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 83.1MB in the beginning and 95.0MB in the end (delta: -11.9MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB.
[2024-11-27 23:21:15,200 INFO L158 Benchmark]: Witness Printer took 7.56ms. Allocated memory is still 176.2MB. Free memory was 95.0MB in the beginning and 95.0MB in the end (delta: 21.6kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-27 23:21:15,202 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.28ms. Allocated memory is still 117.4MB. Free memory is still 73.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 507.78ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 75.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 97.05ms. Allocated memory is still 117.4MB. Free memory was 75.1MB in the beginning and 70.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 88.28ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 67.0MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 1380.60ms. Allocated memory is still 117.4MB. Free memory was 67.0MB in the beginning and 83.7MB in the end (delta: -16.7MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 9585.90ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 83.1MB in the beginning and 95.0MB in the end (delta: -11.9MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB.
* Witness Printer took 7.56ms. Allocated memory is still 176.2MB. Free memory was 95.0MB in the beginning and 95.0MB in the end (delta: 21.6kB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 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 someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 91.
Possible FailurePath:
[L38] unsigned char isInitial = 0;
[L39-L54] struct WrapperStruct00 WrapperStruct00 = {
-16,
50.75,
7.675,
10,
32.5,
1000000.7,
2.4,
1,
1,
1,
5,
200,
10,
1
};
[L55] unsigned char last_1_WrapperStruct00_var_1_11 = 1;
VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_11=1]
[L123] isInitial = 1
[L124] FCALL initially()
[L126] CALL updateLastVariables()
[L116] EXPR WrapperStruct00.var_1_11
[L116] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11
[L126] RET updateLastVariables()
[L127] CALL updateVariables()
[L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double()
[L89] EXPR WrapperStruct00.var_1_2
[L89] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F
[L89] EXPR WrapperStruct00.var_1_2
[L89] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L89] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L89] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ))
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L89] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ))
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double()
[L91] EXPR WrapperStruct00.var_1_3
[L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F
[L91] EXPR WrapperStruct00.var_1_3
[L91] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L91] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L91] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ))
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L91] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ))
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L92] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char()
[L93] EXPR WrapperStruct00.var_1_7
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L93] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L93] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L94] EXPR WrapperStruct00.var_1_7
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float()
[L96] EXPR WrapperStruct00.var_1_9
[L96] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F
[L96] EXPR WrapperStruct00.var_1_9
[L96] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L96] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L96] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ))
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L96] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ))
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L97] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float()
[L98] EXPR WrapperStruct00.var_1_10
[L98] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F
[L98] EXPR WrapperStruct00.var_1_10
[L98] EXPR WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L98] EXPR (WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L98] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ))
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L98] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ))
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L99] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar()
[L100] EXPR WrapperStruct00.var_1_12
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L100] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L100] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L101] EXPR WrapperStruct00.var_1_12
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L101] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L101] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 1)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar()
[L103] EXPR WrapperStruct00.var_1_13
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L103] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L103] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L104] EXPR WrapperStruct00.var_1_13
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L104] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L105] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar()
[L106] EXPR WrapperStruct00.var_1_15
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L106] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L106] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L107] EXPR WrapperStruct00.var_1_15
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L107] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 254)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L107] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 254)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L108] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar()
[L109] EXPR WrapperStruct00.var_1_16
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L110] EXPR WrapperStruct00.var_1_16
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L110] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L110] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L111] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar()
[L112] EXPR WrapperStruct00.var_1_17
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L112] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L112] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L113] EXPR WrapperStruct00.var_1_17
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L113] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L20] COND FALSE !(!cond)
VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L113] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L127] RET updateVariables()
[L128] CALL step()
[L59] EXPR WrapperStruct00.var_1_3
[L59] EXPR WrapperStruct00.var_1_2
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L59] COND FALSE !(WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2)
[L68] EXPR WrapperStruct00.var_1_8
[L68] EXPR WrapperStruct00.var_1_8
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L68] COND FALSE !(WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8)
[L71] EXPR WrapperStruct00.var_1_11
[L71] unsigned char stepLocal_0 = WrapperStruct00.var_1_11;
[L72] EXPR WrapperStruct00.var_1_2
[L72] EXPR WrapperStruct00.var_1_8
[L72] EXPR WrapperStruct00.var_1_8
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1]
[L72] COND FALSE !((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4)))
[L81] EXPR WrapperStruct00.var_1_11
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1]
[L81] COND FALSE !(! WrapperStruct00.var_1_11)
[L84] EXPR WrapperStruct00.var_1_16
[L84] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_16
[L128] RET step()
[L129] CALL, EXPR property()
[L119] EXPR WrapperStruct00.var_1_2
[L119] EXPR WrapperStruct00.var_1_8
[L119] EXPR WrapperStruct00.var_1_8
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L119] EXPR ((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1
[L119] EXPR WrapperStruct00.var_1_11
[L119] EXPR WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11
[L119] EXPR WrapperStruct00.var_1_11
[L119] EXPR WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L119] EXPR (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1
[L119] EXPR WrapperStruct00.var_1_8
[L119] EXPR WrapperStruct00.var_1_8
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L119] EXPR (WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))
[L119] EXPR WrapperStruct00.var_1_1
[L119] EXPR WrapperStruct00.var_1_7
[L119] EXPR (WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L119] EXPR (WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L119] EXPR ((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L119] EXPR (((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L119] EXPR ((((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 || WrapperStruct00.var_1_13))) : 1)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L119] EXPR (((((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 || WrapperStruct00.var_1_13))) : 1)) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_14 == ((unsigned char) ((((((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) < (WrapperStruct00.var_1_17)) ? (((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) : (WrapperStruct00.var_1_17))))) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)))
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L119-L120] return (((((WrapperStruct00.var_1_2 - 5.25) < (WrapperStruct00.var_1_8 * (WrapperStruct00.var_1_8 * 199.4))) ? ((WrapperStruct00.var_1_11 && WrapperStruct00.var_1_11) ? ((WrapperStruct00.var_1_8 < WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_7))) : 1) : 1) && ((WrapperStruct00.var_1_3 >= WrapperStruct00.var_1_2) ? (last_1_WrapperStruct00_var_1_11 ? ((! last_1_WrapperStruct00_var_1_11) ? (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) > ((10.25f + WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_9) : ((10.25f + WrapperStruct00.var_1_10)))))) : (WrapperStruct00.var_1_8 == ((float) WrapperStruct00.var_1_9))) : 1) : 1)) && ((WrapperStruct00.var_1_8 <= WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_11 == ((unsigned char) (WrapperStruct00.var_1_12 || WrapperStruct00.var_1_13))) : 1)) && ((! WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_14 == ((unsigned char) ((((((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) < (WrapperStruct00.var_1_17)) ? (((((WrapperStruct00.var_1_15) < (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))) ? (WrapperStruct00.var_1_15) : (((((WrapperStruct00.var_1_16) > (5)) ? (WrapperStruct00.var_1_16) : (5))))))) : (WrapperStruct00.var_1_17))))) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)))
;
[L129] RET, EXPR property()
[L129] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
[L19] reach_error()
VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_11=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 4472 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3081 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 1391 mSDtfsCounter, 143 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 850 GetRequests, 817 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=7, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1898 NumberOfCodeBlocks, 1898 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1747 ConstructedInterpolants, 0 QuantifiedInterpolants, 1823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2809 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 6075/6240 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, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-27 23:21:15,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB --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 ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-d790fec
[2024-11-27 23:21:18,938 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-27 23:21:19,151 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-27 23:21:19,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-27 23:21:19,167 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-27 23:21:19,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-27 23:21:19,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-27 23:21:19,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-27 23:21:19,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-27 23:21:19,227 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-27 23:21:19,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-27 23:21:19,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-27 23:21:19,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-27 23:21:19,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-27 23:21:19,229 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-27 23:21:19,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-27 23:21:19,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-27 23:21:19,231 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-27 23:21:19,231 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-27 23:21:19,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-27 23:21:19,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-27 23:21:19,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-27 23:21:19,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-27 23:21:19,232 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-27 23:21:19,232 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-27 23:21:19,232 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-27 23:21:19,233 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-27 23:21:19,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-27 23:21:19,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-27 23:21:19,233 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-27 23:21:19,234 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-27 23:21:19,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-27 23:21:19,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-27 23:21:19,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-27 23:21:19,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-27 23:21:19,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-27 23:21:19,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-27 23:21:19,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-27 23:21:19,236 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-27 23:21:19,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-27 23:21:19,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-27 23:21:19,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-27 23:21:19,237 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-11-27 23:21:19,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-27 23:21:19,237 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-27 23:21:19,237 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-27 23:21:19,237 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-27 23:21:19,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-27 23:21:19,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-27 23:21:19,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-27 23:21:19,238 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB
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 -> ead5d8ae4343bf6b87a76c9a2e262d48ceac54d8db7ffa685d6fe68c13556445
[2024-11-27 23:21:19,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-27 23:21:19,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-27 23:21:19,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-27 23:21:19,721 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-27 23:21:19,722 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-27 23:21:19,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i
[2024-11-27 23:21:23,674 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/data/689aaf9a4/34fc6b475203444ebab48ee61f441786/FLAGee32d814a
[2024-11-27 23:21:24,061 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-27 23:21:24,061 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i
[2024-11-27 23:21:24,072 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/data/689aaf9a4/34fc6b475203444ebab48ee61f441786/FLAGee32d814a
[2024-11-27 23:21:24,102 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/data/689aaf9a4/34fc6b475203444ebab48ee61f441786
[2024-11-27 23:21:24,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-27 23:21:24,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-27 23:21:24,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-27 23:21:24,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-27 23:21:24,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-27 23:21:24,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7335510e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24, skipping insertion in model container
[2024-11-27 23:21:24,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,144 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-27 23:21:24,361 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929]
[2024-11-27 23:21:24,463 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-27 23:21:24,481 INFO L200 MainTranslator]: Completed pre-run
[2024-11-27 23:21:24,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-11.i[916,929]
[2024-11-27 23:21:24,560 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-27 23:21:24,592 INFO L204 MainTranslator]: Completed translation
[2024-11-27 23:21:24,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24 WrapperNode
[2024-11-27 23:21:24,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-27 23:21:24,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-27 23:21:24,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-27 23:21:24,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-27 23:21:24,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,729 INFO L138 Inliner]: procedures = 34, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 578
[2024-11-27 23:21:24,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-27 23:21:24,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-27 23:21:24,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-27 23:21:24,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-27 23:21:24,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,786 INFO L175 MemorySlicer]: Split 142 memory accesses to 2 slices as follows [2, 140]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32].
[2024-11-27 23:21:24,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,818 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-27 23:21:24,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-27 23:21:24,856 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-27 23:21:24,856 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-27 23:21:24,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (1/1) ...
[2024-11-27 23:21:24,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-27 23:21:24,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3
[2024-11-27 23:21:24,911 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-27 23:21:24,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-27 23:21:24,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-27 23:21:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0
[2024-11-27 23:21:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1
[2024-11-27 23:21:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0
[2024-11-27 23:21:24,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1
[2024-11-27 23:21:24,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0
[2024-11-27 23:21:24,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1
[2024-11-27 23:21:24,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2024-11-27 23:21:24,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2024-11-27 23:21:24,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-27 23:21:24,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-27 23:21:24,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0
[2024-11-27 23:21:24,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1
[2024-11-27 23:21:24,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0
[2024-11-27 23:21:24,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1
[2024-11-27 23:21:24,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0
[2024-11-27 23:21:24,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1
[2024-11-27 23:21:24,958 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-27 23:21:24,958 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-27 23:21:24,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0
[2024-11-27 23:21:24,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1
[2024-11-27 23:21:24,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-27 23:21:24,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-27 23:21:24,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0
[2024-11-27 23:21:24,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1
[2024-11-27 23:21:25,230 INFO L234 CfgBuilder]: Building ICFG
[2024-11-27 23:21:25,234 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-27 23:21:45,361 INFO L? ?]: Removed 165 outVars from TransFormulas that were not future-live.
[2024-11-27 23:21:45,361 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-27 23:21:45,379 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-27 23:21:45,379 INFO L312 CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-27 23:21:45,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:21:45 BoogieIcfgContainer
[2024-11-27 23:21:45,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-27 23:21:45,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-27 23:21:45,383 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-27 23:21:45,390 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-27 23:21:45,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:21:24" (1/3) ...
[2024-11-27 23:21:45,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49066b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:21:45, skipping insertion in model container
[2024-11-27 23:21:45,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:21:24" (2/3) ...
[2024-11-27 23:21:45,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49066b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:21:45, skipping insertion in model container
[2024-11-27 23:21:45,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:21:45" (3/3) ...
[2024-11-27 23:21:45,396 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-11.i
[2024-11-27 23:21:45,415 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-27 23:21:45,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-11.i that has 2 procedures, 139 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2024-11-27 23:21:45,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-27 23:21:45,510 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;@69782130, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-27 23:21:45,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-27 23:21:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:21:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-11-27 23:21:45,542 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:21:45,543 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:21:45,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:21:45,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:21:45,551 INFO L85 PathProgramCache]: Analyzing trace with hash -358520638, now seen corresponding path program 1 times
[2024-11-27 23:21:45,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-27 23:21:45,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113493810]
[2024-11-27 23:21:45,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:45,565 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-27 23:21:45,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/mathsat
[2024-11-27 23:21:45,568 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:45,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:47,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-27 23:21:47,171 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:21:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked.
[2024-11-27 23:21:47,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:21:47,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-27 23:21:47,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113493810]
[2024-11-27 23:21:47,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113493810] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:21:47,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-27 23:21:47,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-27 23:21:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252749648]
[2024-11-27 23:21:47,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:21:47,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-27 23:21:47,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-27 23:21:47,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-27 23:21:47,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-27 23:21:47,350 INFO L87 Difference]: Start difference. First operand has 139 states, 120 states have (on average 1.4666666666666666) internal successors, (176), 121 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-27 23:21:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:21:47,405 INFO L93 Difference]: Finished difference Result 271 states and 426 transitions.
[2024-11-27 23:21:47,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-27 23:21:47,408 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133
[2024-11-27 23:21:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:21:47,420 INFO L225 Difference]: With dead ends: 271
[2024-11-27 23:21:47,421 INFO L226 Difference]: Without dead ends: 135
[2024-11-27 23:21:47,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-27 23:21:47,431 INFO L435 NwaCegarLoop]: 201 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, 201 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-27 23:21:47,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-27 23:21:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states.
[2024-11-27 23:21:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135.
[2024-11-27 23:21:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:21:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions.
[2024-11-27 23:21:47,508 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 133
[2024-11-27 23:21:47,509 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:21:47,509 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions.
[2024-11-27 23:21:47,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16)
[2024-11-27 23:21:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions.
[2024-11-27 23:21:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-11-27 23:21:47,515 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:21:47,515 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:21:47,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:47,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:47,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:21:47,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:21:47,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1153944278, now seen corresponding path program 1 times
[2024-11-27 23:21:47,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-27 23:21:47,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733330245]
[2024-11-27 23:21:47,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:47,719 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-27 23:21:47,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/mathsat
[2024-11-27 23:21:47,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:47,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:49,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-27 23:21:49,237 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:21:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:21:49,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:21:49,423 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-27 23:21:49,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733330245]
[2024-11-27 23:21:49,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733330245] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:21:49,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-27 23:21:49,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-27 23:21:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471852835]
[2024-11-27 23:21:49,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:21:49,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-27 23:21:49,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-27 23:21:49,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-27 23:21:49,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-27 23:21:49,431 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:21:49,607 INFO L93 Difference]: Finished difference Result 269 states and 402 transitions.
[2024-11-27 23:21:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-27 23:21:49,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133
[2024-11-27 23:21:49,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:21:49,614 INFO L225 Difference]: With dead ends: 269
[2024-11-27 23:21:49,614 INFO L226 Difference]: Without dead ends: 137
[2024-11-27 23:21:49,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-27 23:21:49,619 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-27 23:21:49,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-27 23:21:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states.
[2024-11-27 23:21:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137.
[2024-11-27 23:21:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:21:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions.
[2024-11-27 23:21:49,650 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 133
[2024-11-27 23:21:49,651 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:21:49,652 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions.
[2024-11-27 23:21:49,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions.
[2024-11-27 23:21:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2024-11-27 23:21:49,657 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:21:49,658 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:21:49,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:49,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:49,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:21:49,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:21:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash -961736306, now seen corresponding path program 1 times
[2024-11-27 23:21:49,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-27 23:21:49,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42749351]
[2024-11-27 23:21:49,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:49,862 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-27 23:21:49,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/mathsat
[2024-11-27 23:21:49,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:49,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:51,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-27 23:21:51,369 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:21:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:21:51,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:21:51,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-27 23:21:51,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42749351]
[2024-11-27 23:21:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42749351] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:21:51,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-27 23:21:51,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-27 23:21:51,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134635085]
[2024-11-27 23:21:51,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:21:51,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-27 23:21:51,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-27 23:21:51,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-27 23:21:51,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-27 23:21:51,566 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:21:52,722 INFO L93 Difference]: Finished difference Result 274 states and 407 transitions.
[2024-11-27 23:21:52,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-27 23:21:52,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135
[2024-11-27 23:21:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:21:52,728 INFO L225 Difference]: With dead ends: 274
[2024-11-27 23:21:52,728 INFO L226 Difference]: Without dead ends: 140
[2024-11-27 23:21:52,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-27 23:21:52,734 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2024-11-27 23:21:52,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-27 23:21:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2024-11-27 23:21:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140.
[2024-11-27 23:21:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.4262295081967213) internal successors, (174), 122 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:21:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions.
[2024-11-27 23:21:52,762 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 135
[2024-11-27 23:21:52,762 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:21:52,762 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions.
[2024-11-27 23:21:52,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions.
[2024-11-27 23:21:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2024-11-27 23:21:52,767 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:21:52,768 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:21:52,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:52,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:52,969 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:21:52,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:21:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1555103386, now seen corresponding path program 1 times
[2024-11-27 23:21:52,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-27 23:21:52,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927453793]
[2024-11-27 23:21:52,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:21:52,971 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-27 23:21:52,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/mathsat
[2024-11-27 23:21:52,974 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:52,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:21:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:21:54,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-27 23:21:54,447 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:21:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:21:54,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:21:54,737 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-27 23:21:54,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927453793]
[2024-11-27 23:21:54,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927453793] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:21:54,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-27 23:21:54,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-27 23:21:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083808960]
[2024-11-27 23:21:54,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:21:54,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-27 23:21:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-27 23:21:54,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-27 23:21:54,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-27 23:21:54,741 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:21:55,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-27 23:22:01,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-27 23:22:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:22:02,073 INFO L93 Difference]: Finished difference Result 278 states and 411 transitions.
[2024-11-27 23:22:02,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-27 23:22:02,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136
[2024-11-27 23:22:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:22:02,079 INFO L225 Difference]: With dead ends: 278
[2024-11-27 23:22:02,079 INFO L226 Difference]: Without dead ends: 141
[2024-11-27 23:22:02,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 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-27 23:22:02,081 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time
[2024-11-27 23:22:02,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 499 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time]
[2024-11-27 23:22:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2024-11-27 23:22:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141.
[2024-11-27 23:22:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 123 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:22:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 207 transitions.
[2024-11-27 23:22:02,103 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 207 transitions. Word has length 136
[2024-11-27 23:22:02,104 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:22:02,105 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 207 transitions.
[2024-11-27 23:22:02,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:22:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 207 transitions.
[2024-11-27 23:22:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2024-11-27 23:22:02,112 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:22:02,113 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:22:02,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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)] Forceful destruction successful, exit code 0
[2024-11-27 23:22:02,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:22:02,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:22:02,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:22:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash 968297372, now seen corresponding path program 1 times
[2024-11-27 23:22:02,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-27 23:22:02,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566031026]
[2024-11-27 23:22:02,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:22:02,316 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-27 23:22:02,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/mathsat
[2024-11-27 23:22:02,321 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:22:02,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (6)] Waiting until timeout for monitored process
[2024-11-27 23:22:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:22:03,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-27 23:22:03,866 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:22:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:22:04,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:22:04,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-27 23:22:04,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566031026]
[2024-11-27 23:22:04,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566031026] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:22:04,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-27 23:22:04,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-27 23:22:04,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045310354]
[2024-11-27 23:22:04,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:22:04,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-27 23:22:04,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-27 23:22:04,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-27 23:22:04,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-27 23:22:04,057 INFO L87 Difference]: Start difference. First operand 141 states and 207 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:22:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:22:04,461 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions.
[2024-11-27 23:22:04,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-27 23:22:04,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136
[2024-11-27 23:22:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:22:04,464 INFO L225 Difference]: With dead ends: 282
[2024-11-27 23:22:04,464 INFO L226 Difference]: Without dead ends: 144
[2024-11-27 23:22:04,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-27 23:22:04,466 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-27 23:22:04,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 777 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-27 23:22:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states.
[2024-11-27 23:22:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142.
[2024-11-27 23:22:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 124 states have internal predecessors, (176), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:22:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 208 transitions.
[2024-11-27 23:22:04,480 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 208 transitions. Word has length 136
[2024-11-27 23:22:04,481 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:22:04,481 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 208 transitions.
[2024-11-27 23:22:04,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:22:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 208 transitions.
[2024-11-27 23:22:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2024-11-27 23:22:04,484 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:22:04,484 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:22:04,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (6)] Forceful destruction successful, exit code 0
[2024-11-27 23:22:04,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:22:04,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:22:04,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:22:04,686 INFO L85 PathProgramCache]: Analyzing trace with hash 608463171, now seen corresponding path program 1 times
[2024-11-27 23:22:04,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-27 23:22:04,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506979747]
[2024-11-27 23:22:04,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:22:04,687 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-27 23:22:04,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/mathsat
[2024-11-27 23:22:04,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:22:04,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (7)] Waiting until timeout for monitored process
[2024-11-27 23:22:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:22:06,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-27 23:22:06,127 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:22:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:22:06,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:22:06,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-27 23:22:06,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506979747]
[2024-11-27 23:22:06,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506979747] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:22:06,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-27 23:22:06,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-27 23:22:06,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113973357]
[2024-11-27 23:22:06,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:22:06,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-27 23:22:06,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-27 23:22:06,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-27 23:22:06,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-27 23:22:06,424 INFO L87 Difference]: Start difference. First operand 142 states and 208 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:22:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:22:06,716 INFO L93 Difference]: Finished difference Result 285 states and 418 transitions.
[2024-11-27 23:22:06,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-27 23:22:06,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137
[2024-11-27 23:22:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:22:06,720 INFO L225 Difference]: With dead ends: 285
[2024-11-27 23:22:06,720 INFO L226 Difference]: Without dead ends: 146
[2024-11-27 23:22:06,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-27 23:22:06,722 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 964 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.3s IncrementalHoareTripleChecker+Time
[2024-11-27 23:22:06,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 964 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-27 23:22:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2024-11-27 23:22:06,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143.
[2024-11-27 23:22:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 125 states have (on average 1.416) internal successors, (177), 125 states have internal predecessors, (177), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:22:06,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 209 transitions.
[2024-11-27 23:22:06,738 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 209 transitions. Word has length 137
[2024-11-27 23:22:06,739 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:22:06,739 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 209 transitions.
[2024-11-27 23:22:06,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:22:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 209 transitions.
[2024-11-27 23:22:06,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2024-11-27 23:22:06,743 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:22:06,744 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:22:06,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (7)] Forceful destruction successful, exit code 0
[2024-11-27 23:22:06,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:22:06,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:22:06,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:22:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1356451360, now seen corresponding path program 1 times
[2024-11-27 23:22:06,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-27 23:22:06,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67118544]
[2024-11-27 23:22:06,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:22:06,946 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-27 23:22:06,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/mathsat
[2024-11-27 23:22:06,951 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:22:06,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (8)] Waiting until timeout for monitored process
[2024-11-27 23:22:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:22:08,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-27 23:22:08,418 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:22:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:22:08,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:22:08,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-27 23:22:08,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67118544]
[2024-11-27 23:22:08,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67118544] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:22:08,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-27 23:22:08,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-27 23:22:08,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447200076]
[2024-11-27 23:22:08,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:22:08,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-27 23:22:08,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-27 23:22:08,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-27 23:22:08,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-27 23:22:08,584 INFO L87 Difference]: Start difference. First operand 143 states and 209 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:22:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:22:08,798 INFO L93 Difference]: Finished difference Result 286 states and 419 transitions.
[2024-11-27 23:22:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-27 23:22:08,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137
[2024-11-27 23:22:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:22:08,803 INFO L225 Difference]: With dead ends: 286
[2024-11-27 23:22:08,803 INFO L226 Difference]: Without dead ends: 146
[2024-11-27 23:22:08,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-27 23:22:08,805 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-27 23:22:08,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 776 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-27 23:22:08,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2024-11-27 23:22:08,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146.
[2024-11-27 23:22:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.40625) internal successors, (180), 128 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:22:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 212 transitions.
[2024-11-27 23:22:08,817 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 212 transitions. Word has length 137
[2024-11-27 23:22:08,818 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:22:08,818 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 212 transitions.
[2024-11-27 23:22:08,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:22:08,819 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 212 transitions.
[2024-11-27 23:22:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2024-11-27 23:22:08,821 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:22:08,821 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:22:08,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (8)] Ended with exit code 0
[2024-11-27 23:22:09,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:22:09,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:22:09,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:22:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1851522911, now seen corresponding path program 1 times
[2024-11-27 23:22:09,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-27 23:22:09,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909556100]
[2024-11-27 23:22:09,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:22:09,024 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-27 23:22:09,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/mathsat
[2024-11-27 23:22:09,026 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:22:09,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (9)] Waiting until timeout for monitored process
[2024-11-27 23:22:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:22:10,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-27 23:22:10,458 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:22:10,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:22:10,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65
[2024-11-27 23:22:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:22:11,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-27 23:22:11,064 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-27 23:22:11,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909556100]
[2024-11-27 23:22:11,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909556100] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-27 23:22:11,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-27 23:22:11,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-27 23:22:11,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856874110]
[2024-11-27 23:22:11,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:22:11,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-27 23:22:11,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-27 23:22:11,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-27 23:22:11,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-27 23:22:11,067 INFO L87 Difference]: Start difference. First operand 146 states and 212 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:22:18,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-27 23:22:22,037 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-27 23:22:26,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-27 23:22:30,057 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-27 23:22:34,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-27 23:22:38,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-27 23:22:42,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-27 23:22:46,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-27 23:22:50,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-27 23:22:54,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-27 23:22:58,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-27 23:23:02,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-27 23:23:06,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-27 23:23:10,908 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-27 23:23:14,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-27 23:23:18,914 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-27 23:23:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:23:19,728 INFO L93 Difference]: Finished difference Result 290 states and 422 transitions.
[2024-11-27 23:23:19,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-27 23:23:19,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138
[2024-11-27 23:23:19,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:23:19,730 INFO L225 Difference]: With dead ends: 290
[2024-11-27 23:23:19,730 INFO L226 Difference]: Without dead ends: 147
[2024-11-27 23:23:19,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-11-27 23:23:19,732 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 196 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.5s IncrementalHoareTripleChecker+Time
[2024-11-27 23:23:19,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 594 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 16 Unknown, 0 Unchecked, 68.5s Time]
[2024-11-27 23:23:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2024-11-27 23:23:19,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146.
[2024-11-27 23:23:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 128 states have (on average 1.3984375) internal successors, (179), 128 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16)
[2024-11-27 23:23:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions.
[2024-11-27 23:23:19,754 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 138
[2024-11-27 23:23:19,755 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:23:19,755 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions.
[2024-11-27 23:23:19,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:23:19,755 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions.
[2024-11-27 23:23:19,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2024-11-27 23:23:19,759 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:23:19,759 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:23:19,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (9)] Forceful destruction successful, exit code 0
[2024-11-27 23:23:19,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:23:19,960 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:23:19,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:23:19,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1010090265, now seen corresponding path program 1 times
[2024-11-27 23:23:19,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-27 23:23:19,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678700035]
[2024-11-27 23:23:19,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:23:19,961 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-27 23:23:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/mathsat
[2024-11-27 23:23:19,964 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:23:19,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (10)] Waiting until timeout for monitored process
[2024-11-27 23:23:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:23:21,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 33 conjuncts are in the unsatisfiable core
[2024-11-27 23:23:21,634 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:23:21,748 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-27 23:23:21,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 21
[2024-11-27 23:23:22,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:23:22,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 49
[2024-11-27 23:23:23,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:23:23,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 59
[2024-11-27 23:23:28,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:23:28,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 72
[2024-11-27 23:23:29,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:23:29,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 75
[2024-11-27 23:23:30,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:23:30,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 75
[2024-11-27 23:23:31,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:23:31,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 85
[2024-11-27 23:23:33,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:23:33,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 98
[2024-11-27 23:23:34,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:23:34,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 111
[2024-11-27 23:23:36,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:23:36,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 115
[2024-11-27 23:23:38,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:23:38,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 124
[2024-11-27 23:23:40,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:23:40,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 166 treesize of output 64
[2024-11-27 23:23:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 244 proven. 192 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2024-11-27 23:23:41,008 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-27 23:23:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:23:42,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-27 23:23:42,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678700035]
[2024-11-27 23:23:42,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678700035] provided 1 perfect and 1 imperfect interpolant sequences
[2024-11-27 23:23:42,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-27 23:23:42,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13
[2024-11-27 23:23:42,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63871053]
[2024-11-27 23:23:42,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:23:42,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-27 23:23:42,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-27 23:23:42,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-27 23:23:42,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=106, Unknown=1, NotChecked=0, Total=156
[2024-11-27 23:23:42,577 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:23:48,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-27 23:23:52,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-27 23:23:56,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2024-11-27 23:23:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:23:59,214 INFO L93 Difference]: Finished difference Result 432 states and 627 transitions.
[2024-11-27 23:23:59,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-27 23:23:59,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 140
[2024-11-27 23:23:59,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:23:59,223 INFO L225 Difference]: With dead ends: 432
[2024-11-27 23:23:59,224 INFO L226 Difference]: Without dead ends: 289
[2024-11-27 23:23:59,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=53, Invalid=128, Unknown=1, NotChecked=0, Total=182
[2024-11-27 23:23:59,225 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 139 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time
[2024-11-27 23:23:59,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 337 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 259 Invalid, 3 Unknown, 0 Unchecked, 16.5s Time]
[2024-11-27 23:23:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states.
[2024-11-27 23:23:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 284.
[2024-11-27 23:23:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 249 states have (on average 1.3975903614457832) internal successors, (348), 249 states have internal predecessors, (348), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-27 23:23:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 412 transitions.
[2024-11-27 23:23:59,249 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 412 transitions. Word has length 140
[2024-11-27 23:23:59,250 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:23:59,250 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 412 transitions.
[2024-11-27 23:23:59,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:23:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions.
[2024-11-27 23:23:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2024-11-27 23:23:59,254 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:23:59,255 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:23:59,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (10)] Forceful destruction successful, exit code 0
[2024-11-27 23:23:59,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:23:59,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:23:59,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:23:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash 47098284, now seen corresponding path program 1 times
[2024-11-27 23:23:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-27 23:23:59,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138915085]
[2024-11-27 23:23:59,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:23:59,457 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-27 23:23:59,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/mathsat
[2024-11-27 23:23:59,459 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:23:59,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (11)] Waiting until timeout for monitored process
[2024-11-27 23:24:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:24:01,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 54 conjuncts are in the unsatisfiable core
[2024-11-27 23:24:01,854 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:24:01,906 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-27 23:24:01,952 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-27 23:24:02,056 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-27 23:24:02,326 INFO L224 Elim1Store]: Index analysis took 435 ms
[2024-11-27 23:24:02,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 58 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 51
[2024-11-27 23:24:03,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 108
[2024-11-27 23:24:09,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:24:09,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 237 treesize of output 162
[2024-11-27 23:24:16,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:24:16,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 211 treesize of output 162
[2024-11-27 23:24:23,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:24:23,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 201 treesize of output 158
[2024-11-27 23:24:25,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:24:25,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 201 treesize of output 158
[2024-11-27 23:24:31,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:24:31,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 196 treesize of output 159
[2024-11-27 23:24:37,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:24:37,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 201 treesize of output 149
[2024-11-27 23:24:44,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:24:44,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 111
[2024-11-27 23:24:47,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:24:47,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 105
[2024-11-27 23:24:50,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:24:50,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 106 treesize of output 111
[2024-11-27 23:24:54,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 110
[2024-11-27 23:24:54,370 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-27 23:24:54,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:24:54,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 110 treesize of output 184
[2024-11-27 23:24:55,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44
[2024-11-27 23:25:06,010 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:25:16,521 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:25:26,792 WARN L286 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:25:36,033 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:25:40,078 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse15 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse1 (select .cse15 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (let ((.cse16 (select .cse15 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))))) (and (not (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (concat .cse1 .cse2))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (let ((.cse8 (select .cse15 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse5 (exists ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|) (select .cse15 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_20| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_20|) (select .cse15 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))))) (.cse7 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse4)) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_20| (_ BitVec 8))) (= (select .cse15 (bvadd (_ bv34 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_20|)))) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_20| (_ BitVec 8))) (= (select .cse15 (bvadd (_ bv31 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_20|)))) (.cse11 (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (let ((.cse14 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)) (.cse13 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))) (and (fp.leq (let ((.cse12 (concat .cse13 .cse14))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (= .cse2 .cse14) (= .cse13 .cse1)))))) (or (and .cse5 .cse6 .cse7 (= .cse8 ((_ sign_extend 24) (_ bv1 8))) .cse9 .cse10 .cse11) (and (= ((_ sign_extend 24) (_ bv0 8)) .cse8) .cse5 .cse6 .cse7 .cse9 .cse10 .cse11))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false
[2024-11-27 23:25:44,132 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse2 (select .cse15 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse1 (select .cse15 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (let ((.cse16 (select .cse15 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))))) (and (not (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (concat .cse1 .cse2))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse4))) (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (let ((.cse8 (select .cse15 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse5 (exists ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|) (select .cse15 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))))) (.cse6 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_20| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_20|) (select .cse15 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))))) (.cse7 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse4)) (.cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_20| (_ BitVec 8))) (= (select .cse15 (bvadd (_ bv34 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_20|)))) (.cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_20| (_ BitVec 8))) (= (select .cse15 (bvadd (_ bv31 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_20|)))) (.cse11 (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (let ((.cse14 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)) (.cse13 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))) (and (fp.leq (let ((.cse12 (concat .cse13 .cse14))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))) ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (= .cse2 .cse14) (= .cse13 .cse1)))))) (or (and .cse5 .cse6 .cse7 (= .cse8 ((_ sign_extend 24) (_ bv1 8))) .cse9 .cse10 .cse11) (and (= ((_ sign_extend 24) (_ bv0 8)) .cse8) .cse5 .cse6 .cse7 .cse9 .cse10 .cse11))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true
[2024-11-27 23:25:51,939 WARN L286 SmtUtils]: Spent 7.78s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:26:02,410 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:26:12,486 WARN L286 SmtUtils]: Spent 7.16s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:26:21,312 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:26:21,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:26:21,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 394 treesize of output 273
[2024-11-27 23:26:29,658 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:26:39,356 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:26:51,358 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:26:59,927 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:27:08,137 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:27:12,190 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse12 (select .cse0 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse11 (select .cse0 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse16 (let ((.cse19 (select .cse0 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))))) (and (= (select .cse0 (bvadd (_ bv33 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|))))) (let ((.cse6 (select .cse0 (bvadd (_ bv31 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (select .cse0 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse1 (select .cse0 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (.cse5 (select .cse0 (bvadd (_ bv34 32) |c_~#WrapperStruct00~0.offset|))) (.cse3 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse16)) (.cse2 (select .cse0 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|)))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|) .cse1)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_20| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_20|) .cse2)) .cse3 (= .cse4 ((_ sign_extend 24) (_ bv1 8))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_20| (_ BitVec 8))) (= .cse5 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_20|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_20| (_ BitVec 8))) (= .cse6 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_20|))) (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (let ((.cse9 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)) (.cse8 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))) (and (fp.leq (let ((.cse7 (concat .cse8 .cse9))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) .cse10) (= .cse11 .cse9) (= .cse8 .cse12))))) (and (exists ((v_prenex_8 (_ BitVec 8))) (= .cse6 ((_ sign_extend 24) v_prenex_8))) (= ((_ sign_extend 24) (_ bv0 8)) .cse4) (exists ((v_prenex_11 (_ BitVec 64))) (= ((_ extract 63 32) v_prenex_11) .cse1)) (exists ((v_prenex_9 (_ BitVec 64))) (let ((.cse14 ((_ extract 63 32) v_prenex_9)) (.cse15 ((_ extract 31 0) v_prenex_9))) (and (fp.leq (let ((.cse13 (concat .cse14 .cse15))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))) .cse10) (= .cse12 .cse14) (= .cse11 .cse15)))) (exists ((v_prenex_10 (_ BitVec 8))) (= .cse5 ((_ sign_extend 24) v_prenex_10))) .cse3 (exists ((v_prenex_7 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_7) .cse2))))) (not (fp.lt (fp.sub c_currentRoundingMode (let ((.cse17 (concat .cse12 .cse11))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse18 ((_ to_fp 11 53) c_currentRoundingMode .cse16))) (fp.mul c_currentRoundingMode .cse18 (fp.mul c_currentRoundingMode .cse18 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false
[2024-11-27 23:27:16,252 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse12 (select .cse0 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse11 (select .cse0 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse16 (let ((.cse19 (select .cse0 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19))))) (and (= (select .cse0 (bvadd (_ bv33 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) (select .cse0 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|))))) (let ((.cse6 (select .cse0 (bvadd (_ bv31 32) |c_~#WrapperStruct00~0.offset|))) (.cse4 (select .cse0 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse1 (select .cse0 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (.cse5 (select .cse0 (bvadd (_ bv34 32) |c_~#WrapperStruct00~0.offset|))) (.cse3 (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse16)) (.cse2 (select .cse0 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|)))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|) .cse1)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_20| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_20|) .cse2)) .cse3 (= .cse4 ((_ sign_extend 24) (_ bv1 8))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_20| (_ BitVec 8))) (= .cse5 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_20|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_20| (_ BitVec 8))) (= .cse6 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_20|))) (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (let ((.cse9 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)) (.cse8 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))) (and (fp.leq (let ((.cse7 (concat .cse8 .cse9))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) .cse10) (= .cse11 .cse9) (= .cse8 .cse12))))) (and (exists ((v_prenex_8 (_ BitVec 8))) (= .cse6 ((_ sign_extend 24) v_prenex_8))) (= ((_ sign_extend 24) (_ bv0 8)) .cse4) (exists ((v_prenex_11 (_ BitVec 64))) (= ((_ extract 63 32) v_prenex_11) .cse1)) (exists ((v_prenex_9 (_ BitVec 64))) (let ((.cse14 ((_ extract 63 32) v_prenex_9)) (.cse15 ((_ extract 31 0) v_prenex_9))) (and (fp.leq (let ((.cse13 (concat .cse14 .cse15))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))) .cse10) (= .cse12 .cse14) (= .cse11 .cse15)))) (exists ((v_prenex_10 (_ BitVec 8))) (= .cse5 ((_ sign_extend 24) v_prenex_10))) .cse3 (exists ((v_prenex_7 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_7) .cse2))))) (not (fp.lt (fp.sub c_currentRoundingMode (let ((.cse17 (concat .cse12 .cse11))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse18 ((_ to_fp 11 53) c_currentRoundingMode .cse16))) (fp.mul c_currentRoundingMode .cse18 (fp.mul c_currentRoundingMode .cse18 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true
[2024-11-27 23:27:16,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:27:16,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 495 treesize of output 219
[2024-11-27 23:27:25,183 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:27:34,098 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:27:42,741 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:27:51,294 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:28:07,431 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:28:13,139 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))))) (or (exists ((v_arrayElimCell_174 (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) v_arrayElimCell_174) ((_ extract 30 23) v_arrayElimCell_174) ((_ extract 22 0) v_arrayElimCell_174)))) (and (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (let ((.cse0 (let ((.cse6 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_73|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (and (fp.leq .cse0 .cse1) (not (fp.lt (fp.sub c_currentRoundingMode .cse0 .cse2) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode .cse5))) (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 .cse4))))) (= .cse0 |c_ULTIMATE.start_property_#t~mem101#1|)))) (= |c_ULTIMATE.start_property_#t~mem103#1| .cse5) (= .cse7 .cse5) (= |c_ULTIMATE.start_property_#t~mem102#1| .cse5)))) (exists ((v_arrayElimCell_174 (_ BitVec 32))) (let ((.cse10 (fp ((_ extract 31 31) v_arrayElimCell_174) ((_ extract 30 23) v_arrayElimCell_174) ((_ extract 22 0) v_arrayElimCell_174)))) (and (exists ((v_prenex_9 (_ BitVec 64))) (let ((.cse8 (let ((.cse11 (concat ((_ extract 63 32) v_prenex_9) ((_ extract 31 0) v_prenex_9)))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))))) (and (fp.leq .cse8 .cse1) (not (fp.lt (fp.sub c_currentRoundingMode .cse8 .cse2) (let ((.cse9 ((_ to_fp 11 53) c_currentRoundingMode .cse10))) (fp.mul c_currentRoundingMode .cse9 (fp.mul c_currentRoundingMode .cse9 .cse4))))) (= .cse8 |c_ULTIMATE.start_property_#t~mem101#1|)))) (= |c_ULTIMATE.start_property_#t~mem103#1| .cse10) (= .cse7 .cse10) (= |c_ULTIMATE.start_property_#t~mem102#1| .cse10)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false
[2024-11-27 23:28:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 33 proven. 403 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked.
[2024-11-27 23:28:17,322 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-27 23:28:25,461 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:28:29,538 WARN L851 $PredicateComparison]: unable to prove that (not (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) is different from false
[2024-11-27 23:28:33,611 WARN L873 $PredicateComparison]: unable to prove that (not (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) is different from true
[2024-11-27 23:28:41,728 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:28:45,792 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select .cse1 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from false
[2024-11-27 23:28:49,852 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select .cse1 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))))) is different from true
[2024-11-27 23:28:57,976 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:29:06,097 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:29:14,442 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:29:22,775 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:29:26,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))) (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem18#1| .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem20#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem19#1|) .cse1))) (not (let ((.cse3 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse2 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) .cse0) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse4 .cse1)))))))) is different from false
[2024-11-27 23:29:31,009 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))) (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem18#1| .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem20#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem19#1|) .cse1))) (not (let ((.cse3 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse2 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) .cse0) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse5 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse4 .cse1)))))))) is different from true
[2024-11-27 23:29:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked.
[2024-11-27 23:29:31,962 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-27 23:29:31,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138915085]
[2024-11-27 23:29:31,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138915085] provided 1 perfect and 1 imperfect interpolant sequences
[2024-11-27 23:29:31,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-27 23:29:31,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 27
[2024-11-27 23:29:31,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455513618]
[2024-11-27 23:29:31,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-27 23:29:31,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-27 23:29:31,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-27 23:29:31,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-27 23:29:31,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=342, Unknown=15, NotChecked=258, Total=702
[2024-11-27 23:29:31,964 INFO L87 Difference]: Start difference. First operand 284 states and 412 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:29:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-27 23:29:31,982 INFO L93 Difference]: Finished difference Result 573 states and 833 transitions.
[2024-11-27 23:29:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-27 23:29:31,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 142
[2024-11-27 23:29:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-27 23:29:31,985 INFO L225 Difference]: With dead ends: 573
[2024-11-27 23:29:31,986 INFO L226 Difference]: Without dead ends: 292
[2024-11-27 23:29:31,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 73.8s TimeCoverageRelationStatistics Valid=87, Invalid=342, Unknown=15, NotChecked=258, Total=702
[2024-11-27 23:29:31,988 INFO L435 NwaCegarLoop]: 198 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, 198 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 617 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-27 23:29:31,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 617 Unchecked, 0.0s Time]
[2024-11-27 23:29:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states.
[2024-11-27 23:29:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292.
[2024-11-27 23:29:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 257 states have (on average 1.3929961089494163) internal successors, (358), 257 states have internal predecessors, (358), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32)
[2024-11-27 23:29:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 422 transitions.
[2024-11-27 23:29:32,008 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 422 transitions. Word has length 142
[2024-11-27 23:29:32,008 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-27 23:29:32,009 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 422 transitions.
[2024-11-27 23:29:32,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16)
[2024-11-27 23:29:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 422 transitions.
[2024-11-27 23:29:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144
[2024-11-27 23:29:32,011 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-27 23:29:32,011 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 23:29:32,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (11)] Ended with exit code 0
[2024-11-27 23:29:32,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:29:32,212 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-27 23:29:32,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-27 23:29:32,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1637790262, now seen corresponding path program 1 times
[2024-11-27 23:29:32,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-27 23:29:32,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984279290]
[2024-11-27 23:29:32,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-27 23:29:32,213 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-27 23:29:32,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/mathsat
[2024-11-27 23:29:32,215 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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-27 23:29:32,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a7d5ed3-76ba-46d2-a1e2-e9a4fad9d50f/bin/uautomizer-verify-aQ6SnzHsRB/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 (12)] Waiting until timeout for monitored process
[2024-11-27 23:29:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-27 23:29:34,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 61 conjuncts are in the unsatisfiable core
[2024-11-27 23:29:34,342 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-27 23:29:34,826 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-27 23:29:35,827 INFO L224 Elim1Store]: Index analysis took 1410 ms
[2024-11-27 23:29:35,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 56 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 10
[2024-11-27 23:29:36,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56
[2024-11-27 23:29:43,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 120
[2024-11-27 23:29:50,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:29:50,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 293 treesize of output 172
[2024-11-27 23:29:54,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:29:54,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 293 treesize of output 172
[2024-11-27 23:29:58,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:29:58,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 293 treesize of output 172
[2024-11-27 23:30:02,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:30:02,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 288 treesize of output 182
[2024-11-27 23:30:07,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:30:07,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 218 treesize of output 151
[2024-11-27 23:30:13,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:30:13,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 121 treesize of output 114
[2024-11-27 23:30:18,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:30:18,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 124
[2024-11-27 23:30:24,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:30:24,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 126 treesize of output 137
[2024-11-27 23:30:33,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 126
[2024-11-27 23:30:33,564 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-27 23:30:33,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:30:33,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 12 new quantified variables, introduced 45 case distinctions, treesize of input 126 treesize of output 234
[2024-11-27 23:30:34,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 118
[2024-11-27 23:30:41,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:30:41,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 491 treesize of output 415
[2024-11-27 23:30:58,531 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:31:09,570 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:31:19,847 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:31:27,941 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:31:31,990 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse1 (select .cse0 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|))) (.cse16 (select .cse0 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse13 (select .cse0 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse29 (let ((.cse32 (select .cse0 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse32) ((_ extract 30 23) .cse32) ((_ extract 22 0) .cse32))))) (and (= (select .cse0 (bvadd (_ bv33 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) .cse1))) (let ((.cse28 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (let ((.cse18 ((_ to_fp 11 53) roundNearestTiesToEven .cse28)) (.cse11 (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0))) .cse29)) (.cse19 (select .cse0 (bvadd (_ bv31 32) |c_~#WrapperStruct00~0.offset|))) (.cse2 (select .cse0 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))) (.cse20 (select .cse0 (bvadd (_ bv32 32) |c_~#WrapperStruct00~0.offset|))) (.cse12 (select .cse0 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse3 (select .cse0 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (.cse9 (select .cse0 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse28)))) (or (and (exists ((v_prenex_15 (_ BitVec 8))) (= .cse2 ((_ sign_extend 24) v_prenex_15))) (exists ((v_prenex_14 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_14) .cse1)) (exists ((v_prenex_19 (_ BitVec 64))) (let ((.cse4 ((_ extract 63 32) v_prenex_19)) (.cse8 ((_ extract 31 0) v_prenex_19))) (let ((.cse5 (let ((.cse10 (concat .cse4 .cse8))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (and (= .cse3 .cse4) (fp.leq .cse5 .cse6) (fp.geq .cse5 .cse7) (= .cse8 .cse9))))) .cse11 (= ((_ sign_extend 24) (_ bv0 8)) .cse12) (exists ((v_prenex_17 (_ BitVec 64))) (let ((.cse15 ((_ extract 63 32) v_prenex_17)) (.cse14 ((_ extract 31 0) v_prenex_17))) (and (= .cse13 .cse14) (= .cse15 .cse16) (fp.leq (let ((.cse17 (concat .cse15 .cse14))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) .cse18)))) (exists ((v_prenex_16 (_ BitVec 8))) (= .cse19 ((_ sign_extend 24) v_prenex_16))) (exists ((v_prenex_18 (_ BitVec 8))) (= .cse20 ((_ sign_extend 24) v_prenex_18)))) (and (exists ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (let ((.cse21 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|)) (.cse22 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|))) (and (= .cse16 .cse21) (= .cse13 .cse22) (fp.leq (let ((.cse23 (concat .cse21 .cse22))) (fp ((_ extract 63 63) .cse23) ((_ extract 62 52) .cse23) ((_ extract 51 0) .cse23))) .cse18)))) .cse11 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_22| (_ BitVec 8))) (= .cse19 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_22|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_22|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet88#1_21| (_ BitVec 8))) (= .cse20 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet88#1_21|))) (= .cse12 ((_ sign_extend 24) (_ bv1 8))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet94#1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet94#1_21|) .cse1)) (exists ((|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64))) (let ((.cse24 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|)) (.cse26 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|))) (let ((.cse25 (let ((.cse27 (concat .cse24 .cse26))) (fp ((_ extract 63 63) .cse27) ((_ extract 62 52) .cse27) ((_ extract 51 0) .cse27))))) (and (= .cse3 .cse24) (fp.leq .cse25 .cse6) (= .cse26 .cse9) (fp.geq .cse25 .cse7))))))))) (not (fp.lt (fp.sub roundNearestTiesToEven (let ((.cse30 (concat .cse16 .cse13))) (fp ((_ extract 63 63) .cse30) ((_ extract 62 52) .cse30) ((_ extract 51 0) .cse30))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (let ((.cse31 ((_ to_fp 11 53) roundNearestTiesToEven .cse29))) (fp.mul roundNearestTiesToEven .cse31 (fp.mul roundNearestTiesToEven .cse31 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0)))))))))) is different from false
[2024-11-27 23:31:36,042 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse1 (select .cse0 (bvadd (_ bv35 32) |c_~#WrapperStruct00~0.offset|))) (.cse16 (select .cse0 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|))) (.cse13 (select .cse0 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))) (.cse29 (let ((.cse32 (select .cse0 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse32) ((_ extract 30 23) .cse32) ((_ extract 22 0) .cse32))))) (and (= (select .cse0 (bvadd (_ bv33 32) |c_~#WrapperStruct00~0.offset|)) ((_ sign_extend 24) ((_ extract 7 0) .cse1))) (let ((.cse28 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (let ((.cse18 ((_ to_fp 11 53) roundNearestTiesToEven .cse28)) (.cse11 (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0))) .cse29)) (.cse19 (select .cse0 (bvadd (_ bv31 32) |c_~#WrapperStruct00~0.offset|))) (.cse2 (select .cse0 (bvadd (_ bv36 32) |c_~#WrapperStruct00~0.offset|))) (.cse20 (select .cse0 (bvadd (_ bv32 32) |c_~#WrapperStruct00~0.offset|))) (.cse12 (select .cse0 (bvadd (_ bv30 32) |c_~#WrapperStruct00~0.offset|))) (.cse3 (select .cse0 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (.cse9 (select .cse0 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse28)))) (or (and (exists ((v_prenex_15 (_ BitVec 8))) (= .cse2 ((_ sign_extend 24) v_prenex_15))) (exists ((v_prenex_14 (_ BitVec 8))) (= ((_ sign_extend 24) v_prenex_14) .cse1)) (exists ((v_prenex_19 (_ BitVec 64))) (let ((.cse4 ((_ extract 63 32) v_prenex_19)) (.cse8 ((_ extract 31 0) v_prenex_19))) (let ((.cse5 (let ((.cse10 (concat .cse4 .cse8))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))) (and (= .cse3 .cse4) (fp.leq .cse5 .cse6) (fp.geq .cse5 .cse7) (= .cse8 .cse9))))) .cse11 (= ((_ sign_extend 24) (_ bv0 8)) .cse12) (exists ((v_prenex_17 (_ BitVec 64))) (let ((.cse15 ((_ extract 63 32) v_prenex_17)) (.cse14 ((_ extract 31 0) v_prenex_17))) (and (= .cse13 .cse14) (= .cse15 .cse16) (fp.leq (let ((.cse17 (concat .cse15 .cse14))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))) .cse18)))) (exists ((v_prenex_16 (_ BitVec 8))) (= .cse19 ((_ sign_extend 24) v_prenex_16))) (exists ((v_prenex_18 (_ BitVec 8))) (= .cse20 ((_ sign_extend 24) v_prenex_18)))) (and (exists ((|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (let ((.cse21 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|)) (.cse22 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|))) (and (= .cse16 .cse21) (= .cse13 .cse22) (fp.leq (let ((.cse23 (concat .cse21 .cse22))) (fp ((_ extract 63 63) .cse23) ((_ extract 62 52) .cse23) ((_ extract 51 0) .cse23))) .cse18)))) .cse11 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_22| (_ BitVec 8))) (= .cse19 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_22|))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet97#1_22| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet97#1_22|) .cse2)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet88#1_21| (_ BitVec 8))) (= .cse20 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet88#1_21|))) (= .cse12 ((_ sign_extend 24) (_ bv1 8))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet94#1_21| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet94#1_21|) .cse1)) (exists ((|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64))) (let ((.cse24 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|)) (.cse26 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|))) (let ((.cse25 (let ((.cse27 (concat .cse24 .cse26))) (fp ((_ extract 63 63) .cse27) ((_ extract 62 52) .cse27) ((_ extract 51 0) .cse27))))) (and (= .cse3 .cse24) (fp.leq .cse25 .cse6) (= .cse26 .cse9) (fp.geq .cse25 .cse7))))))))) (not (fp.lt (fp.sub roundNearestTiesToEven (let ((.cse30 (concat .cse16 .cse13))) (fp ((_ extract 63 63) .cse30) ((_ extract 62 52) .cse30) ((_ extract 51 0) .cse30))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (let ((.cse31 ((_ to_fp 11 53) roundNearestTiesToEven .cse29))) (fp.mul roundNearestTiesToEven .cse31 (fp.mul roundNearestTiesToEven .cse31 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0)))))))))) is different from true
[2024-11-27 23:31:47,770 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:32:00,365 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:32:08,804 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:32:14,404 WARN L286 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:32:14,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-27 23:32:14,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 636 treesize of output 336
[2024-11-27 23:32:32,303 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:32:41,006 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:32:49,873 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:32:58,923 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:33:07,776 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:33:17,835 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:33:26,631 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:33:31,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 21.0 4.0))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 997.0 5.0))) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 65.0 2.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven .cse18)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse18)))) (or (and (exists ((v_prenex_19 (_ BitVec 64))) (let ((.cse0 (let ((.cse3 (concat ((_ extract 63 32) v_prenex_19) ((_ extract 31 0) v_prenex_19)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2) (= .cse0 |c_ULTIMATE.start_property_#t~mem116#1|)))) (exists ((v_arrayElimCell_278 (_ BitVec 32)) (v_prenex_17 (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 31 31) v_arrayElimCell_278) ((_ extract 30 23) v_arrayElimCell_278) ((_ extract 22 0) v_arrayElimCell_278))) (.cse4 (let ((.cse11 (concat ((_ extract 63 32) v_prenex_17) ((_ extract 31 0) v_prenex_17)))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))))) (and (fp.leq .cse4 .cse5) (not (fp.lt (fp.sub roundNearestTiesToEven .cse4 .cse6) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven .cse9))) (fp.mul roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse7 .cse8))))) (= .cse9 .cse10) (= |c_ULTIMATE.start_property_#t~mem117#1| .cse4))))) (and (exists ((v_arrayElimCell_278 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_83| (_ BitVec 64))) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_278) ((_ extract 30 23) v_arrayElimCell_278) ((_ extract 22 0) v_arrayElimCell_278))) (.cse12 (let ((.cse15 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_83|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_83|)))) (fp ((_ extract 63 63) .cse15) ((_ extract 62 52) .cse15) ((_ extract 51 0) .cse15))))) (and (= |c_ULTIMATE.start_property_#t~mem117#1| .cse12) (not (fp.lt (fp.sub roundNearestTiesToEven .cse12 .cse6) (let ((.cse13 ((_ to_fp 11 53) roundNearestTiesToEven .cse14))) (fp.mul roundNearestTiesToEven .cse13 (fp.mul roundNearestTiesToEven .cse13 .cse8))))) (= .cse14 .cse10) (fp.leq .cse12 .cse5)))) (exists ((|v_skolemized_q#valueAsBitvector_84| (_ BitVec 64))) (let ((.cse16 (let ((.cse17 (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_84|) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_84|)))) (fp ((_ extract 63 63) .cse17) ((_ extract 62 52) .cse17) ((_ extract 51 0) .cse17))))) (and (= .cse16 |c_ULTIMATE.start_property_#t~mem116#1|) (fp.leq .cse16 .cse1) (fp.geq .cse16 .cse2)))))))) is different from false
[2024-11-27 23:33:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 359 proven. 45 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked.
[2024-11-27 23:33:36,215 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-27 23:33:45,764 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:33:53,886 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:33:57,947 WARN L851 $PredicateComparison]: unable to prove that (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))) (not (let ((.cse1 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (fp.geq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from false
[2024-11-27 23:34:02,006 WARN L873 $PredicateComparison]: unable to prove that (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))) (not (let ((.cse1 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (fp.geq (let ((.cse0 (concat (select .cse1 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (let ((.cse2 (concat (select .cse1 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse1 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))))) is different from true
[2024-11-27 23:34:10,211 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:34:18,329 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:34:22,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from false
[2024-11-27 23:34:26,456 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse0 (let ((.cse5 (concat (select .cse3 (bvadd (_ bv5 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv1 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (or (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select .cse3 (bvadd (_ bv18 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) (not (fp.geq (let ((.cse4 (concat (select .cse3 (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)) (select .cse3 (bvadd (_ bv9 32) |c_~#WrapperStruct00~0.offset|))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) .cse0))))) is different from true
[2024-11-27 23:34:34,646 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:34:42,764 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:34:50,967 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:34:59,087 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:35:07,287 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:35:15,405 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:35:23,599 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:35:31,721 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:35:39,939 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-27 23:35:48,147 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)