./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX --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 1180eee21db070026d3c306cfee214227bc09cf9af8776df243249842b6f8459
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:01:45,868 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:01:45,989 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 18:01:45,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:01:46,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:01:46,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:01:46,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:01:46,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:01:46,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:01:46,050 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:01:46,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:01:46,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:01:46,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:01:46,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:01:46,055 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:01:46,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:01:46,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:01:46,056 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:01:46,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 18:01:46,057 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:01:46,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:01:46,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:01:46,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:01:46,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:01:46,060 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:01:46,060 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:01:46,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:01:46,061 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:01:46,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:01:46,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:01:46,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:01:46,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:01:46,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:01:46,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:01:46,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:01:46,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:01:46,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 18:01:46,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 18:01:46,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:01:46,066 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:01:46,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:01:46,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:01:46,068 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX
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 -> 1180eee21db070026d3c306cfee214227bc09cf9af8776df243249842b6f8459
[2024-11-08 18:01:46,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:01:46,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:01:46,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:01:46,435 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:01:46,435 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:01:46,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i
Unable to find full path for "g++"
[2024-11-08 18:01:48,756 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:01:49,113 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:01:49,114 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i
[2024-11-08 18:01:49,128 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/data/872976d9e/dca9d96721c84003a554c19b21ccdbd6/FLAGc4e3c139a
[2024-11-08 18:01:49,152 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/data/872976d9e/dca9d96721c84003a554c19b21ccdbd6
[2024-11-08 18:01:49,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:01:49,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:01:49,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:01:49,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:01:49,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:01:49,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36462f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49, skipping insertion in model container
[2024-11-08 18:01:49,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,217 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:01:49,479 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_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i[919,932]
[2024-11-08 18:01:49,580 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:01:49,597 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:01:49,612 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_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i[919,932]
[2024-11-08 18:01:49,667 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:01:49,695 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:01:49,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49 WrapperNode
[2024-11-08 18:01:49,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:01:49,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:01:49,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:01:49,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:01:49,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,723 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,787 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 251
[2024-11-08 18:01:49,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:01:49,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:01:49,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:01:49,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:01:49,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,837 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 18:01:49,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:01:49,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:01:49,871 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:01:49,872 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:01:49,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (1/1) ...
[2024-11-08 18:01:49,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:01:49,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:01:49,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:01:49,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:01:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:01:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 18:01:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 18:01:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 18:01:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:01:49,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:01:50,140 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:01:50,144 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:01:50,842 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live.
[2024-11-08 18:01:50,843 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:01:50,868 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:01:50,869 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 18:01:50,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:01:50 BoogieIcfgContainer
[2024-11-08 18:01:50,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:01:50,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:01:50,896 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:01:50,901 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:01:50,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:01:49" (1/3) ...
[2024-11-08 18:01:50,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e468fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:01:50, skipping insertion in model container
[2024-11-08 18:01:50,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:01:49" (2/3) ...
[2024-11-08 18:01:50,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e468fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:01:50, skipping insertion in model container
[2024-11-08 18:01:50,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:01:50" (3/3) ...
[2024-11-08 18:01:50,905 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i
[2024-11-08 18:01:50,928 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:01:50,928 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 18:01:51,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:01:51,056 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;@3ac208f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:01:51,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 18:01:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 82 states have internal predecessors, (122), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:01:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2024-11-08 18:01:51,083 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:01:51,084 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:01:51,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:01:51,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:01:51,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1746026462, now seen corresponding path program 1 times
[2024-11-08 18:01:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:01:51,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070923991]
[2024-11-08 18:01:51,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:01:51,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:01:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:01:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 18:01:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 18:01:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 18:01:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 18:01:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 18:01:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 18:01:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 18:01:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 18:01:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 18:01:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 18:01:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:01:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 18:01:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 18:01:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 18:01:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-08 18:01:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-08 18:01:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-08 18:01:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-08 18:01:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-08 18:01:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-08 18:01:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-08 18:01:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-08 18:01:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-08 18:01:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-11-08 18:01:51,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:01:51,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070923991]
[2024-11-08 18:01:51,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070923991] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:01:51,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:01:51,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 18:01:51,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232040687]
[2024-11-08 18:01:51,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:01:51,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 18:01:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:01:51,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 18:01:51,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:01:51,809 INFO L87 Difference]: Start difference. First operand has 108 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 82 states have internal predecessors, (122), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24)
[2024-11-08 18:01:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:01:51,877 INFO L93 Difference]: Finished difference Result 209 states and 358 transitions.
[2024-11-08 18:01:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 18:01:51,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165
[2024-11-08 18:01:51,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:01:51,895 INFO L225 Difference]: With dead ends: 209
[2024-11-08 18:01:51,895 INFO L226 Difference]: Without dead ends: 104
[2024-11-08 18:01:51,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-08 18:01:51,909 INFO L432 NwaCegarLoop]: 161 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, 161 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-08 18:01:51,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:01:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2024-11-08 18:01:51,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104.
[2024-11-08 18:01:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:01:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 161 transitions.
[2024-11-08 18:01:52,007 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 161 transitions. Word has length 165
[2024-11-08 18:01:52,007 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:01:52,007 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 161 transitions.
[2024-11-08 18:01:52,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24)
[2024-11-08 18:01:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 161 transitions.
[2024-11-08 18:01:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167
[2024-11-08 18:01:52,017 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:01:52,017 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:01:52,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 18:01:52,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:01:52,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:01:52,020 INFO L85 PathProgramCache]: Analyzing trace with hash -171819169, now seen corresponding path program 1 times
[2024-11-08 18:01:52,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:01:52,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545299188]
[2024-11-08 18:01:52,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:01:52,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:01:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:01:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 18:01:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 18:01:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 18:01:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 18:01:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 18:01:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 18:01:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 18:01:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 18:01:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 18:01:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 18:01:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:01:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 18:01:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 18:01:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 18:01:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-08 18:01:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-08 18:01:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-08 18:01:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-08 18:01:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-08 18:01:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-08 18:01:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-08 18:01:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-08 18:01:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-08 18:01:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-11-08 18:01:52,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:01:52,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545299188]
[2024-11-08 18:01:52,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545299188] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:01:52,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:01:52,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:01:52,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764339059]
[2024-11-08 18:01:52,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:01:52,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:01:52,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:01:52,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:01:52,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:01:52,571 INFO L87 Difference]: Start difference. First operand 104 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-11-08 18:01:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:01:52,919 INFO L93 Difference]: Finished difference Result 303 states and 472 transitions.
[2024-11-08 18:01:52,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:01:52,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166
[2024-11-08 18:01:52,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:01:52,928 INFO L225 Difference]: With dead ends: 303
[2024-11-08 18:01:52,928 INFO L226 Difference]: Without dead ends: 202
[2024-11-08 18:01:52,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-08 18:01:52,934 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 138 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-08 18:01:52,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 316 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-08 18:01:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2024-11-08 18:01:52,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 146.
[2024-11-08 18:01:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.5166666666666666) internal successors, (182), 120 states have internal predecessors, (182), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:01:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 230 transitions.
[2024-11-08 18:01:52,977 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 230 transitions. Word has length 166
[2024-11-08 18:01:52,979 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:01:52,982 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 230 transitions.
[2024-11-08 18:01:52,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-11-08 18:01:52,982 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 230 transitions.
[2024-11-08 18:01:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2024-11-08 18:01:52,988 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:01:52,989 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:01:52,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 18:01:52,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:01:52,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:01:52,991 INFO L85 PathProgramCache]: Analyzing trace with hash -246697419, now seen corresponding path program 1 times
[2024-11-08 18:01:52,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:01:52,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893418128]
[2024-11-08 18:01:52,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:01:52,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:01:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:01:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 18:01:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 18:01:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 18:01:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 18:01:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 18:01:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 18:01:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 18:01:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 18:01:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 18:01:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 18:01:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:01:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 18:01:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 18:01:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 18:01:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-08 18:01:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-08 18:01:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-08 18:01:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-08 18:01:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-08 18:01:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-08 18:01:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-08 18:01:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-08 18:01:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-08 18:01:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-11-08 18:01:53,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:01:53,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893418128]
[2024-11-08 18:01:53,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893418128] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:01:53,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:01:53,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 18:01:53,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919576752]
[2024-11-08 18:01:53,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:01:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:01:53,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:01:53,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:01:53,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:01:53,890 INFO L87 Difference]: Start difference. First operand 146 states and 230 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-11-08 18:01:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:01:54,893 INFO L93 Difference]: Finished difference Result 399 states and 610 transitions.
[2024-11-08 18:01:54,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:01:54,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167
[2024-11-08 18:01:54,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:01:54,898 INFO L225 Difference]: With dead ends: 399
[2024-11-08 18:01:54,898 INFO L226 Difference]: Without dead ends: 256
[2024-11-08 18:01:54,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:01:54,901 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 430 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-08 18:01:54,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 272 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-08 18:01:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states.
[2024-11-08 18:01:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 158.
[2024-11-08 18:01:54,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 131 states have (on average 1.5114503816793894) internal successors, (198), 131 states have internal predecessors, (198), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:01:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 246 transitions.
[2024-11-08 18:01:54,940 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 246 transitions. Word has length 167
[2024-11-08 18:01:54,941 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:01:54,942 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 246 transitions.
[2024-11-08 18:01:54,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-11-08 18:01:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 246 transitions.
[2024-11-08 18:01:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2024-11-08 18:01:54,950 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:01:54,950 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:01:54,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 18:01:54,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:01:54,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:01:54,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1033166259, now seen corresponding path program 1 times
[2024-11-08 18:01:54,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:01:54,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306886379]
[2024-11-08 18:01:54,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:01:54,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:01:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:01:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 18:01:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 18:01:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 18:01:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 18:01:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 18:01:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 18:01:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 18:01:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 18:01:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 18:01:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 18:01:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:01:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 18:01:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 18:01:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 18:01:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-08 18:01:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-08 18:01:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-08 18:01:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-08 18:01:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-08 18:01:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-08 18:01:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-08 18:01:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-08 18:01:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-08 18:01:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-11-08 18:01:55,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:01:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306886379]
[2024-11-08 18:01:55,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306886379] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:01:55,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:01:55,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:01:55,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292601270]
[2024-11-08 18:01:55,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:01:55,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:01:55,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:01:55,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:01:55,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:01:55,368 INFO L87 Difference]: Start difference. First operand 158 states and 246 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-11-08 18:01:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:01:55,792 INFO L93 Difference]: Finished difference Result 374 states and 574 transitions.
[2024-11-08 18:01:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:01:55,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167
[2024-11-08 18:01:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:01:55,796 INFO L225 Difference]: With dead ends: 374
[2024-11-08 18:01:55,796 INFO L226 Difference]: Without dead ends: 219
[2024-11-08 18:01:55,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:01:55,798 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 134 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 18:01:55,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 487 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 18:01:55,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states.
[2024-11-08 18:01:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 159.
[2024-11-08 18:01:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.5075757575757576) internal successors, (199), 132 states have internal predecessors, (199), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:01:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions.
[2024-11-08 18:01:55,828 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 167
[2024-11-08 18:01:55,829 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:01:55,829 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions.
[2024-11-08 18:01:55,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-11-08 18:01:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions.
[2024-11-08 18:01:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2024-11-08 18:01:55,832 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:01:55,833 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:01:55,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 18:01:55,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:01:55,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:01:55,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1399595240, now seen corresponding path program 1 times
[2024-11-08 18:01:55,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:01:55,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137267352]
[2024-11-08 18:01:55,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:01:55,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:01:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:01:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 18:01:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 18:01:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 18:01:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 18:01:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 18:01:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 18:01:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 18:01:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 18:01:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 18:01:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 18:01:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:01:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 18:01:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 18:01:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 18:01:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-08 18:01:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-08 18:01:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-08 18:01:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-08 18:01:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-08 18:01:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-08 18:01:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-08 18:01:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-08 18:01:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-08 18:01:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-11-08 18:01:56,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:01:56,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137267352]
[2024-11-08 18:01:56,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137267352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:01:56,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:01:56,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:01:56,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925724845]
[2024-11-08 18:01:56,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:01:56,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:01:56,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:01:56,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:01:56,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:01:56,195 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-11-08 18:01:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:01:56,237 INFO L93 Difference]: Finished difference Result 316 states and 493 transitions.
[2024-11-08 18:01:56,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:01:56,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167
[2024-11-08 18:01:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:01:56,241 INFO L225 Difference]: With dead ends: 316
[2024-11-08 18:01:56,241 INFO L226 Difference]: Without dead ends: 160
[2024-11-08 18:01:56,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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-08 18:01:56,243 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:01:56,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:01:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2024-11-08 18:01:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160.
[2024-11-08 18:01:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 states have internal predecessors, (200), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:01:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions.
[2024-11-08 18:01:56,279 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 167
[2024-11-08 18:01:56,280 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:01:56,280 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions.
[2024-11-08 18:01:56,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-11-08 18:01:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions.
[2024-11-08 18:01:56,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2024-11-08 18:01:56,283 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:01:56,283 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:01:56,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 18:01:56,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:01:56,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:01:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1275074751, now seen corresponding path program 1 times
[2024-11-08 18:01:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:01:56,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50092295]
[2024-11-08 18:01:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:01:56,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:01:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:01:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 18:01:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 18:01:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 18:01:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 18:01:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 18:01:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 18:01:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 18:01:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 18:01:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 18:01:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 18:01:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:01:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 18:01:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 18:01:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 18:01:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-08 18:01:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-08 18:01:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-08 18:01:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-08 18:01:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-08 18:01:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-08 18:01:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-08 18:01:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-08 18:01:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-08 18:01:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-11-08 18:01:56,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:01:56,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50092295]
[2024-11-08 18:01:56,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50092295] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:01:56,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:01:56,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 18:01:56,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841630961]
[2024-11-08 18:01:56,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:01:56,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:01:56,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:01:56,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:01:56,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:01:56,800 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-11-08 18:01:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:01:57,493 INFO L93 Difference]: Finished difference Result 390 states and 594 transitions.
[2024-11-08 18:01:57,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 18:01:57,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168
[2024-11-08 18:01:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:01:57,497 INFO L225 Difference]: With dead ends: 390
[2024-11-08 18:01:57,497 INFO L226 Difference]: Without dead ends: 233
[2024-11-08 18:01:57,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-11-08 18:01:57,499 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 301 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 18:01:57,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 461 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 18:01:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states.
[2024-11-08 18:01:57,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 158.
[2024-11-08 18:01:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 131 states have (on average 1.4961832061068703) internal successors, (196), 131 states have internal predecessors, (196), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:01:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 244 transitions.
[2024-11-08 18:01:57,524 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 244 transitions. Word has length 168
[2024-11-08 18:01:57,524 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:01:57,525 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 244 transitions.
[2024-11-08 18:01:57,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-11-08 18:01:57,525 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 244 transitions.
[2024-11-08 18:01:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2024-11-08 18:01:57,528 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:01:57,528 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:01:57,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 18:01:57,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:01:57,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:01:57,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1361206739, now seen corresponding path program 1 times
[2024-11-08 18:01:57,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:01:57,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131177376]
[2024-11-08 18:01:57,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:01:57,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:01:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:01:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 18:01:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 18:01:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 18:01:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 18:01:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 18:01:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 18:01:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 18:01:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 18:01:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 18:01:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 18:01:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:01:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 18:01:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 18:01:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 18:01:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-08 18:01:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-08 18:01:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-08 18:01:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-08 18:01:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-08 18:01:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-08 18:01:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-08 18:01:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-08 18:01:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-08 18:01:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:57,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-11-08 18:01:57,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:01:57,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131177376]
[2024-11-08 18:01:57,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131177376] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:01:57,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:01:57,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:01:57,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930822577]
[2024-11-08 18:01:57,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:01:57,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:01:57,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:01:57,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:01:57,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:01:57,905 INFO L87 Difference]: Start difference. First operand 158 states and 244 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-11-08 18:01:58,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:01:58,042 INFO L93 Difference]: Finished difference Result 313 states and 485 transitions.
[2024-11-08 18:01:58,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:01:58,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168
[2024-11-08 18:01:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:01:58,044 INFO L225 Difference]: With dead ends: 313
[2024-11-08 18:01:58,044 INFO L226 Difference]: Without dead ends: 158
[2024-11-08 18:01:58,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-08 18:01:58,049 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:01:58,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 18:01:58,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2024-11-08 18:01:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158.
[2024-11-08 18:01:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 131 states have internal predecessors, (195), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:01:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 243 transitions.
[2024-11-08 18:01:58,074 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 243 transitions. Word has length 168
[2024-11-08 18:01:58,075 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:01:58,075 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 243 transitions.
[2024-11-08 18:01:58,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24)
[2024-11-08 18:01:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 243 transitions.
[2024-11-08 18:01:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2024-11-08 18:01:58,082 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:01:58,082 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:01:58,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 18:01:58,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:01:58,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:01:58,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1408157080, now seen corresponding path program 1 times
[2024-11-08 18:01:58,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:01:58,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084907668]
[2024-11-08 18:01:58,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:01:58,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:01:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:01:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 18:01:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 18:01:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 18:01:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 18:01:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 18:01:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 18:01:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 18:01:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 18:01:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 18:01:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 18:01:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:01:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 18:01:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 18:01:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 18:01:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-08 18:01:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-08 18:01:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-08 18:01:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-08 18:01:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-08 18:01:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-08 18:01:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-08 18:01:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-08 18:01:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-08 18:01:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked.
[2024-11-08 18:01:58,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:01:58,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084907668]
[2024-11-08 18:01:58,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084907668] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 18:01:58,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326256445]
[2024-11-08 18:01:58,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:01:58,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:01:58,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:01:58,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:01:58,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 18:01:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:01:58,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-08 18:01:58,839 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:01:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked.
[2024-11-08 18:01:59,354 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:01:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked.
[2024-11-08 18:01:59,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326256445] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 18:01:59,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 18:01:59,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11
[2024-11-08 18:01:59,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362636448]
[2024-11-08 18:01:59,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 18:01:59,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 18:01:59,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:01:59,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 18:01:59,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=67, Unknown=1, NotChecked=0, Total=110
[2024-11-08 18:01:59,801 INFO L87 Difference]: Start difference. First operand 158 states and 243 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41)
[2024-11-08 18:02:01,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:02:01,382 INFO L93 Difference]: Finished difference Result 483 states and 729 transitions.
[2024-11-08 18:02:01,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-11-08 18:02:01,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 168
[2024-11-08 18:02:01,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:02:01,386 INFO L225 Difference]: With dead ends: 483
[2024-11-08 18:02:01,386 INFO L226 Difference]: Without dead ends: 328
[2024-11-08 18:02:01,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=227, Unknown=9, NotChecked=0, Total=380
[2024-11-08 18:02:01,388 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 469 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 67 mSolverCounterUnsat, 89 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 89 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2024-11-08 18:02:01,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 643 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 386 Invalid, 89 Unknown, 0 Unchecked, 1.2s Time]
[2024-11-08 18:02:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states.
[2024-11-08 18:02:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 170.
[2024-11-08 18:02:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 142 states have (on average 1.4929577464788732) internal successors, (212), 142 states have internal predecessors, (212), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:02:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 260 transitions.
[2024-11-08 18:02:01,443 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 260 transitions. Word has length 168
[2024-11-08 18:02:01,444 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:02:01,444 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 260 transitions.
[2024-11-08 18:02:01,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41)
[2024-11-08 18:02:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 260 transitions.
[2024-11-08 18:02:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169
[2024-11-08 18:02:01,448 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:02:01,448 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:02:01,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 18:02:01,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7
[2024-11-08 18:02:01,654 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:02:01,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:02:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1606946538, now seen corresponding path program 1 times
[2024-11-08 18:02:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:02:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242169005]
[2024-11-08 18:02:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:02:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:02:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:02:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 18:02:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 18:02:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 18:02:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 18:02:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 18:02:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 18:02:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 18:02:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 18:02:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 18:02:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 18:02:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:02:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 18:02:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 18:02:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 18:02:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-08 18:02:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-08 18:02:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-08 18:02:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-08 18:02:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-08 18:02:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-08 18:02:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-08 18:02:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-08 18:02:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-08 18:02:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked.
[2024-11-08 18:02:02,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:02:02,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242169005]
[2024-11-08 18:02:02,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242169005] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 18:02:02,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249812816]
[2024-11-08 18:02:02,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:02:02,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:02:02,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:02:02,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:02:02,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 18:02:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:02,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 18:02:02,419 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:02:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked.
[2024-11-08 18:02:02,654 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:02:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked.
[2024-11-08 18:02:02,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249812816] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 18:02:02,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 18:02:02,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11
[2024-11-08 18:02:02,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413839604]
[2024-11-08 18:02:02,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 18:02:02,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 18:02:02,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:02:02,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 18:02:02,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:02:02,971 INFO L87 Difference]: Start difference. First operand 170 states and 260 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41)
[2024-11-08 18:02:03,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:02:03,984 INFO L93 Difference]: Finished difference Result 350 states and 522 transitions.
[2024-11-08 18:02:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-11-08 18:02:03,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 168
[2024-11-08 18:02:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:02:03,987 INFO L225 Difference]: With dead ends: 350
[2024-11-08 18:02:03,988 INFO L226 Difference]: Without dead ends: 183
[2024-11-08 18:02:03,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506
[2024-11-08 18:02:03,990 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 317 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 18:02:03,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 324 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 18:02:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2024-11-08 18:02:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 120.
[2024-11-08 18:02:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:02:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions.
[2024-11-08 18:02:04,029 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 168
[2024-11-08 18:02:04,030 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:02:04,030 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions.
[2024-11-08 18:02:04,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41)
[2024-11-08 18:02:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions.
[2024-11-08 18:02:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2024-11-08 18:02:04,034 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:02:04,035 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:02:04,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 18:02:04,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8
[2024-11-08 18:02:04,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:02:04,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:02:04,240 INFO L85 PathProgramCache]: Analyzing trace with hash 190710954, now seen corresponding path program 1 times
[2024-11-08 18:02:04,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:02:04,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482011301]
[2024-11-08 18:02:04,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:02:04,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:02:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2024-11-08 18:02:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 18:02:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 18:02:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 18:02:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 18:02:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 18:02:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 18:02:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 18:02:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50
[2024-11-08 18:02:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 18:02:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 18:02:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:02:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 18:02:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 18:02:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-11-08 18:02:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-11-08 18:02:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96
[2024-11-08 18:02:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-08 18:02:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-08 18:02:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113
[2024-11-08 18:02:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118
[2024-11-08 18:02:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123
[2024-11-08 18:02:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129
[2024-11-08 18:02:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134
[2024-11-08 18:02:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked.
[2024-11-08 18:02:04,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:02:04,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482011301]
[2024-11-08 18:02:04,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482011301] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 18:02:04,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74541575]
[2024-11-08 18:02:04,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:02:04,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:02:04,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:02:04,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:02:04,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 18:02:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:05,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 18:02:05,182 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:02:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked.
[2024-11-08 18:02:05,487 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 18:02:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked.
[2024-11-08 18:02:06,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74541575] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 18:02:06,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 18:02:06,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 16
[2024-11-08 18:02:06,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574511659]
[2024-11-08 18:02:06,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 18:02:06,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2024-11-08 18:02:06,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:02:06,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-08 18:02:06,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240
[2024-11-08 18:02:06,018 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41)
[2024-11-08 18:02:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:02:07,498 INFO L93 Difference]: Finished difference Result 300 states and 422 transitions.
[2024-11-08 18:02:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2024-11-08 18:02:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 170
[2024-11-08 18:02:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:02:07,501 INFO L225 Difference]: With dead ends: 300
[2024-11-08 18:02:07,502 INFO L226 Difference]: Without dead ends: 183
[2024-11-08 18:02:07,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756
[2024-11-08 18:02:07,505 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 160 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:02:07,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 569 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-08 18:02:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2024-11-08 18:02:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 120.
[2024-11-08 18:02:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:02:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions.
[2024-11-08 18:02:07,542 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 170
[2024-11-08 18:02:07,543 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:02:07,543 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions.
[2024-11-08 18:02:07,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41)
[2024-11-08 18:02:07,544 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions.
[2024-11-08 18:02:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175
[2024-11-08 18:02:07,546 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:02:07,547 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:02:07,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-08 18:02:07,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:02:07,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:02:07,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:02:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash 361031539, now seen corresponding path program 1 times
[2024-11-08 18:02:07,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:02:07,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114781448]
[2024-11-08 18:02:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:02:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:02:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-11-08 18:02:07,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503504177]
[2024-11-08 18:02:07,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:02:07,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:02:07,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:02:07,862 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:02:07,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-08 18:02:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:02:08,163 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 18:02:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:02:08,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 18:02:08,412 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 18:02:08,413 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 18:02:08,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-08 18:02:08,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:02:08,620 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:02:08,797 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:02:08,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:02:08 BoogieIcfgContainer
[2024-11-08 18:02:08,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:02:08,804 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:02:08,804 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:02:08,804 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:02:08,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:01:50" (3/4) ...
[2024-11-08 18:02:08,808 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 18:02:08,810 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:02:08,810 INFO L158 Benchmark]: Toolchain (without parser) took 19652.16ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 132.3MB in the beginning and 177.5MB in the end (delta: -45.1MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB.
[2024-11-08 18:02:08,811 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 132.1MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:02:08,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.34ms. Allocated memory is still 165.7MB. Free memory was 132.1MB in the beginning and 114.7MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-11-08 18:02:08,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.35ms. Allocated memory is still 165.7MB. Free memory was 114.7MB in the beginning and 111.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:02:08,812 INFO L158 Benchmark]: Boogie Preprocessor took 82.15ms. Allocated memory is still 165.7MB. Free memory was 111.3MB in the beginning and 107.3MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 18:02:08,813 INFO L158 Benchmark]: RCFGBuilder took 998.37ms. Allocated memory is still 165.7MB. Free memory was 107.3MB in the beginning and 80.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2024-11-08 18:02:08,814 INFO L158 Benchmark]: TraceAbstraction took 17907.96ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 134.2MB in the beginning and 177.5MB in the end (delta: -43.3MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB.
[2024-11-08 18:02:08,814 INFO L158 Benchmark]: Witness Printer took 6.15ms. Allocated memory is still 239.1MB. Free memory is still 177.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:02:08,817 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.34ms. Allocated memory is still 132.1MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 536.34ms. Allocated memory is still 165.7MB. Free memory was 132.1MB in the beginning and 114.7MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 90.35ms. Allocated memory is still 165.7MB. Free memory was 114.7MB in the beginning and 111.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 82.15ms. Allocated memory is still 165.7MB. Free memory was 111.3MB in the beginning and 107.3MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 998.37ms. Allocated memory is still 165.7MB. Free memory was 107.3MB in the beginning and 80.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 17907.96ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 134.2MB in the beginning and 177.5MB in the end (delta: -43.3MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB.
* Witness Printer took 6.15ms. Allocated memory is still 239.1MB. Free memory is still 177.5MB. 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 177, overapproximation of bitwiseOr at line 58, overapproximation of someUnaryDOUBLEoperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryArithmeticFLOAToperation at line 88.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] float var_1_1 = 63.6;
[L23] float var_1_4 = 128.75;
[L24] float var_1_5 = 25.125;
[L25] float var_1_6 = 1000000.75;
[L26] unsigned char var_1_7 = 1;
[L27] unsigned char var_1_11 = 0;
[L28] unsigned char var_1_12 = 0;
[L29] unsigned char var_1_13 = 0;
[L30] unsigned char var_1_14 = 0;
[L31] float var_1_15 = 25.75;
[L32] double var_1_16 = 0.4;
[L33] double var_1_17 = 0.0;
[L34] double var_1_18 = 0.0;
[L35] double var_1_19 = 1000000000000.5;
[L36] double var_1_20 = 24.8;
[L37] signed char var_1_21 = 1;
[L38] double var_1_22 = 200.8;
[L39] unsigned short int var_1_23 = 40076;
[L40] unsigned short int var_1_24 = 8;
[L41] unsigned long int var_1_25 = 2;
[L42] unsigned char var_1_26 = 0;
[L43] signed short int var_1_28 = 64;
[L44] float var_1_33 = 10.775;
[L45] unsigned long int var_1_41 = 256;
[L46] unsigned long int var_1_45 = 64;
[L47] double var_1_46 = 31.1;
[L48] signed char var_1_47 = 50;
[L49] signed char var_1_48 = 16;
[L50] double last_1_var_1_22 = 200.8;
VAL [isInitial=0, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1]
[L181] isInitial = 1
[L182] FCALL initially()
[L183] COND TRUE 1
[L184] CALL updateLastVariables()
[L174] last_1_var_1_22 = var_1_22
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1]
[L184] RET updateLastVariables()
[L185] CALL updateVariables()
[L133] var_1_4 = __VERIFIER_nondet_float()
[L134] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1]
[L134] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1]
[L135] var_1_5 = __VERIFIER_nondet_float()
[L136] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1]
[L136] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1]
[L137] var_1_6 = __VERIFIER_nondet_float()
[L138] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L138] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L139] var_1_11 = __VERIFIER_nondet_uchar()
[L140] CALL assume_abort_if_not(var_1_11 >= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L140] RET assume_abort_if_not(var_1_11 >= 1)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L141] CALL assume_abort_if_not(var_1_11 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L141] RET assume_abort_if_not(var_1_11 <= 1)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L142] var_1_12 = __VERIFIER_nondet_uchar()
[L143] CALL assume_abort_if_not(var_1_12 >= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L143] RET assume_abort_if_not(var_1_12 >= 1)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L144] CALL assume_abort_if_not(var_1_12 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L144] RET assume_abort_if_not(var_1_12 <= 1)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L145] var_1_13 = __VERIFIER_nondet_uchar()
[L146] CALL assume_abort_if_not(var_1_13 >= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L146] RET assume_abort_if_not(var_1_13 >= 1)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L147] CALL assume_abort_if_not(var_1_13 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L147] RET assume_abort_if_not(var_1_13 <= 1)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L148] var_1_14 = __VERIFIER_nondet_uchar()
[L149] CALL assume_abort_if_not(var_1_14 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L149] RET assume_abort_if_not(var_1_14 >= 0)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L150] CALL assume_abort_if_not(var_1_14 <= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L150] RET assume_abort_if_not(var_1_14 <= 0)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L151] var_1_17 = __VERIFIER_nondet_double()
[L152] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L152] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L153] var_1_18 = __VERIFIER_nondet_double()
[L154] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L154] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L155] var_1_19 = __VERIFIER_nondet_double()
[L156] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L156] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L157] var_1_20 = __VERIFIER_nondet_double()
[L158] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L158] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L159] var_1_23 = __VERIFIER_nondet_ushort()
[L160] CALL assume_abort_if_not(var_1_23 >= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L160] RET assume_abort_if_not(var_1_23 >= 32767)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L161] CALL assume_abort_if_not(var_1_23 <= 65535)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L161] RET assume_abort_if_not(var_1_23 <= 65535)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L162] var_1_24 = __VERIFIER_nondet_ushort()
[L163] CALL assume_abort_if_not(var_1_24 >= 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L163] RET assume_abort_if_not(var_1_24 >= 0)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L164] CALL assume_abort_if_not(var_1_24 <= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L164] RET assume_abort_if_not(var_1_24 <= 32767)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L165] var_1_28 = __VERIFIER_nondet_short()
[L166] CALL assume_abort_if_not(var_1_28 >= -32768)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L166] RET assume_abort_if_not(var_1_28 >= -32768)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L167] CALL assume_abort_if_not(var_1_28 <= 32767)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L167] RET assume_abort_if_not(var_1_28 <= 32767)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L168] CALL assume_abort_if_not(var_1_28 != 0)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L168] RET assume_abort_if_not(var_1_28 != 0)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1]
[L169] var_1_48 = __VERIFIER_nondet_char()
[L170] CALL assume_abort_if_not(var_1_48 >= -127)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1]
[L170] RET assume_abort_if_not(var_1_48 >= -127)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1]
[L171] CALL assume_abort_if_not(var_1_48 <= 126)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1]
[L171] RET assume_abort_if_not(var_1_48 <= 126)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1]
[L185] RET updateVariables()
[L186] CALL step()
[L54] COND TRUE ! (var_1_4 < 16.8f)
[L55] var_1_15 = var_1_6
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L57] var_1_25 = var_1_23
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L58] EXPR 4 | var_1_25
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L58] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25))
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L58] EXPR 4 | var_1_25
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L58] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25))
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L58] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25
[L59] var_1_7 = ((var_1_11 && var_1_12) && var_1_13)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L67] COND FALSE !(var_1_25 > var_1_25)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L70] COND FALSE !(var_1_18 > (var_1_20 + (var_1_19 * var_1_17)))
[L73] var_1_16 = var_1_20
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L76] unsigned long int stepLocal_1 = var_1_25;
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L77] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4))
[L84] var_1_22 = var_1_20
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L86] unsigned char stepLocal_0 = -1 <= var_1_25;
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L87] COND TRUE stepLocal_0 || var_1_7
[L88] var_1_1 = (var_1_4 + (var_1_5 + var_1_6))
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_20=3, var_1_21=1, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L90] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16
[L91] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50)))
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L93] COND TRUE (var_1_25 % var_1_28) >= var_1_24
[L94] var_1_26 = (var_1_14 || var_1_13)
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L98] EXPR var_1_25 ^ (var_1_28 + var_1_25)
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1]
[L98] COND TRUE (var_1_25 ^ (var_1_28 + var_1_25)) <= (((((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) < 0 ) ? -((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) : ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))
[L99] var_1_33 = (((((((((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) < (var_1_5)) ? (((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) : (var_1_5))) < 0 ) ? -((((((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) < (var_1_5)) ? (((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) : (var_1_5))) : ((((((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) < (var_1_5)) ? (((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) : (var_1_5)))))
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1]
[L107] EXPR var_1_23 & var_1_24
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1]
[L107] COND TRUE (var_1_23 & var_1_24) <= var_1_25
[L108] COND FALSE !(var_1_6 <= var_1_6)
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1]
[L116] var_1_45 = var_1_23
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1]
[L117] COND FALSE !(var_1_25 != var_1_25)
[L120] var_1_46 = ((((4.6) > (((((var_1_6) > (var_1_20)) ? (var_1_6) : (var_1_20))))) ? (4.6) : (((((var_1_6) > (var_1_20)) ? (var_1_6) : (var_1_20))))))
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1]
[L122] COND FALSE !(\read(var_1_14))
VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1]
[L186] RET step()
[L187] CALL, EXPR property()
[L177] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1]
[L177-L178] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23))
;
[L187] RET, EXPR property()
[L187] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=3, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 11, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 89 mSolverCounterUnknown, 2027 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1949 mSDsluCounter, 3822 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2210 mSDsCounter, 518 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2568 IncrementalHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 518 mSolverCounterUnsat, 1612 mSDtfsCounter, 2568 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1602 GetRequests, 1521 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=8, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 573 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2528 NumberOfCodeBlocks, 2528 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2670 ConstructedInterpolants, 3 QuantifiedInterpolants, 4933 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1162 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 17448/17664 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-11-08 18:02:08,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX --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 1180eee21db070026d3c306cfee214227bc09cf9af8776df243249842b6f8459
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:02:11,771 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:02:11,903 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 18:02:11,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:02:11,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:02:11,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:02:11,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:02:11,963 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:02:11,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:02:11,966 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:02:11,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:02:11,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:02:11,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:02:11,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:02:11,974 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:02:11,974 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:02:11,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:02:11,975 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:02:11,975 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:02:11,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:02:11,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:02:11,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:02:11,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:02:11,979 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 18:02:11,979 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 18:02:11,980 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:02:11,980 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 18:02:11,980 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:02:11,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:02:11,981 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:02:11,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:02:11,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:02:11,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:02:11,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:02:11,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:02:11,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:02:11,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:02:11,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:02:11,987 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 18:02:11,987 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 18:02:11,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:02:11,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:02:11,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:02:11,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:02:11,990 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX
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 -> 1180eee21db070026d3c306cfee214227bc09cf9af8776df243249842b6f8459
[2024-11-08 18:02:12,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:02:12,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:02:12,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:02:12,516 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:02:12,517 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:02:12,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i
Unable to find full path for "g++"
[2024-11-08 18:02:15,061 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:02:15,383 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:02:15,386 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i
[2024-11-08 18:02:15,404 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/data/b5d69eaad/378b5979b9c549e7b15c3cc87783a626/FLAG77d8828a2
[2024-11-08 18:02:15,655 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/data/b5d69eaad/378b5979b9c549e7b15c3cc87783a626
[2024-11-08 18:02:15,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:02:15,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:02:15,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:02:15,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:02:15,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:02:15,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:02:15" (1/1) ...
[2024-11-08 18:02:15,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2772a48a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:15, skipping insertion in model container
[2024-11-08 18:02:15,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:02:15" (1/1) ...
[2024-11-08 18:02:15,737 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:02:15,950 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_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i[919,932]
[2024-11-08 18:02:16,085 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:02:16,113 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:02:16,130 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_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i[919,932]
[2024-11-08 18:02:16,200 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:02:16,236 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:02:16,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16 WrapperNode
[2024-11-08 18:02:16,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:02:16,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:02:16,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:02:16,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:02:16,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (1/1) ...
[2024-11-08 18:02:16,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (1/1) ...
[2024-11-08 18:02:16,322 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178
[2024-11-08 18:02:16,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:02:16,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:02:16,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:02:16,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:02:16,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (1/1) ...
[2024-11-08 18:02:16,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (1/1) ...
[2024-11-08 18:02:16,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (1/1) ...
[2024-11-08 18:02:16,373 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 18:02:16,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (1/1) ...
[2024-11-08 18:02:16,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (1/1) ...
[2024-11-08 18:02:16,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (1/1) ...
[2024-11-08 18:02:16,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (1/1) ...
[2024-11-08 18:02:16,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (1/1) ...
[2024-11-08 18:02:16,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (1/1) ...
[2024-11-08 18:02:16,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:02:16,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:02:16,407 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:02:16,407 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:02:16,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (1/1) ...
[2024-11-08 18:02:16,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:02:16,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:02:16,464 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:02:16,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:02:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:02:16,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 18:02:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 18:02:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 18:02:16,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:02:16,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:02:16,614 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:02:16,617 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:02:46,593 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live.
[2024-11-08 18:02:46,593 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:02:46,621 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:02:46,621 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 18:02:46,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:02:46 BoogieIcfgContainer
[2024-11-08 18:02:46,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:02:46,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:02:46,625 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:02:46,629 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:02:46,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:02:15" (1/3) ...
[2024-11-08 18:02:46,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5317a9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:02:46, skipping insertion in model container
[2024-11-08 18:02:46,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:02:16" (2/3) ...
[2024-11-08 18:02:46,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5317a9e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:02:46, skipping insertion in model container
[2024-11-08 18:02:46,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:02:46" (3/3) ...
[2024-11-08 18:02:46,636 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i
[2024-11-08 18:02:46,657 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:02:46,657 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 18:02:46,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:02:46,748 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;@1f97fea0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:02:46,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 18:02:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:02:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2024-11-08 18:02:46,807 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:02:46,808 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:02:46,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:02:46,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:02:46,817 INFO L85 PathProgramCache]: Analyzing trace with hash 133199343, now seen corresponding path program 1 times
[2024-11-08 18:02:46,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:02:46,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229881520]
[2024-11-08 18:02:46,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:02:46,836 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-08 18:02:46,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:02:46,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/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-08 18:02:46,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/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-08 18:02:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:47,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 18:02:47,868 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:02:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked.
[2024-11-08 18:02:47,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:02:47,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:02:47,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229881520]
[2024-11-08 18:02:47,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229881520] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:02:47,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:02:47,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 18:02:47,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58041163]
[2024-11-08 18:02:47,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:02:47,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 18:02:47,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:02:47,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 18:02:47,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:02:47,980 INFO L87 Difference]: Start difference. First operand has 82 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24)
[2024-11-08 18:02:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:02:48,043 INFO L93 Difference]: Finished difference Result 157 states and 274 transitions.
[2024-11-08 18:02:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 18:02:48,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159
[2024-11-08 18:02:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:02:48,058 INFO L225 Difference]: With dead ends: 157
[2024-11-08 18:02:48,058 INFO L226 Difference]: Without dead ends: 78
[2024-11-08 18:02:48,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 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-08 18:02:48,070 INFO L432 NwaCegarLoop]: 119 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, 119 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-08 18:02:48,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:02:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2024-11-08 18:02:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78.
[2024-11-08 18:02:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2024-11-08 18:02:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions.
[2024-11-08 18:02:48,126 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 159
[2024-11-08 18:02:48,127 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:02:48,127 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions.
[2024-11-08 18:02:48,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24)
[2024-11-08 18:02:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions.
[2024-11-08 18:02:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-11-08 18:02:48,134 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:02:48,134 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:02:48,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/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-08 18:02:48,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/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-08 18:02:48,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:02:48,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:02:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash 466043305, now seen corresponding path program 1 times
[2024-11-08 18:02:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:02:48,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904253046]
[2024-11-08 18:02:48,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:02:48,339 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-08 18:02:48,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 18:02:48,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/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-08 18:02:48,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c67b4747-2467-4ed8-9ea1-ff3d8e179ef5/bin/uautomizer-verify-jihMAELWvX/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-08 18:02:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:02:49,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 32 conjuncts are in the unsatisfiable core
[2024-11-08 18:02:49,682 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:03:28,658 WARN L286 SmtUtils]: Spent 8.12s 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-08 18:03:36,825 WARN L286 SmtUtils]: Spent 8.17s 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-08 18:03:43,958 WARN L286 SmtUtils]: Spent 7.13s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:03:52,084 WARN L286 SmtUtils]: Spent 8.12s 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-08 18:04:00,216 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:04:08,360 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:04:16,495 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:04:24,625 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:04:32,770 WARN L286 SmtUtils]: Spent 8.14s 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-08 18:04:40,966 WARN L286 SmtUtils]: Spent 8.20s 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-08 18:04:53,628 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:05:01,756 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:05:09,889 WARN L286 SmtUtils]: Spent 8.13s 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-08 18:05:13,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (bvsge ((_ zero_extend 24) c_~var_1_11~0) (_ bv1 32)) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (bvsge ((_ zero_extend 24) c_~var_1_12~0) (_ bv1 32)) (= (_ bv1 8) c_~var_1_7~0) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.geq c_~var_1_6~0 .cse0) (fp.leq c_~var_1_6~0 .cse1)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse1)) (fp.leq c_~var_1_6~0 (fp.neg .cse0))))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))))) is different from false
[2024-11-08 18:05:17,963 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (bvsge ((_ zero_extend 24) c_~var_1_11~0) (_ bv1 32)) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (bvsge ((_ zero_extend 24) c_~var_1_12~0) (_ bv1 32)) (= (_ bv1 8) c_~var_1_7~0) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.geq c_~var_1_6~0 .cse0) (fp.leq c_~var_1_6~0 .cse1)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse1)) (fp.leq c_~var_1_6~0 (fp.neg .cse0))))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))))) is different from true
[2024-11-08 18:05:26,096 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:05:34,216 WARN L286 SmtUtils]: Spent 8.12s 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-08 18:05:42,340 WARN L286 SmtUtils]: Spent 8.12s 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-08 18:05:50,420 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:05:58,542 WARN L286 SmtUtils]: Spent 8.12s 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-08 18:06:05,523 WARN L286 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:06:13,647 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:06:21,772 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:06:29,901 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:06:38,039 WARN L286 SmtUtils]: Spent 8.14s 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-08 18:06:46,164 WARN L286 SmtUtils]: Spent 8.12s 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-08 18:06:51,904 WARN L286 SmtUtils]: Spent 5.74s 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-08 18:07:00,027 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:07:08,150 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:07:16,281 WARN L286 SmtUtils]: Spent 8.13s 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-08 18:07:24,605 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:07:32,870 WARN L286 SmtUtils]: Spent 8.26s 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-08 18:07:41,145 WARN L286 SmtUtils]: Spent 8.27s 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-08 18:07:49,328 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:07:57,579 WARN L286 SmtUtils]: Spent 8.25s 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-08 18:08:05,859 WARN L286 SmtUtils]: Spent 8.28s 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-08 18:08:14,072 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:08:22,319 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:08:30,545 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:08:38,752 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:08:46,953 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-08 18:08:55,120 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:09:03,380 WARN L286 SmtUtils]: Spent 8.26s 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-08 18:09:11,660 WARN L286 SmtUtils]: Spent 8.28s 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-08 18:09:19,875 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:09:28,102 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:09:36,316 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-08 18:09:40,376 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_20~0 c_~var_1_22~0) (bvsge ((_ zero_extend 24) c_~var_1_11~0) (_ bv1 32)) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (not (fp.lt c_~var_1_18~0 (fp.mul c_currentRoundingMode c_~last_1_var_1_22~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)))) (bvsge ((_ zero_extend 24) c_~var_1_12~0) (_ bv1 32)) (= (_ bv1 8) c_~var_1_7~0) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.geq c_~var_1_6~0 .cse0) (fp.leq c_~var_1_6~0 .cse1)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse1)) (fp.leq c_~var_1_6~0 (fp.neg .cse0))))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))))) is different from false
[2024-11-08 18:09:44,439 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_20~0 c_~var_1_22~0) (bvsge ((_ zero_extend 24) c_~var_1_11~0) (_ bv1 32)) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (not (fp.lt c_~var_1_18~0 (fp.mul c_currentRoundingMode c_~last_1_var_1_22~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)))) (bvsge ((_ zero_extend 24) c_~var_1_12~0) (_ bv1 32)) (= (_ bv1 8) c_~var_1_7~0) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.geq c_~var_1_6~0 .cse0) (fp.leq c_~var_1_6~0 .cse1)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse1)) (fp.leq c_~var_1_6~0 (fp.neg .cse0))))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))))) is different from true
[2024-11-08 18:09:52,688 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:10:00,979 WARN L286 SmtUtils]: Spent 8.29s 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-08 18:10:09,192 WARN L286 SmtUtils]: Spent 8.21s 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-08 18:10:17,387 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:10:25,574 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-08 18:10:33,796 WARN L286 SmtUtils]: Spent 8.22s 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-08 18:10:42,023 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:10:50,274 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:10:58,520 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:11:06,819 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:11:15,064 WARN L286 SmtUtils]: Spent 8.24s 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-08 18:11:23,257 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:11:31,479 WARN L286 SmtUtils]: Spent 8.22s 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-08 18:11:39,703 WARN L286 SmtUtils]: Spent 8.22s 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-08 18:11:47,923 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:11:56,151 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:12:04,375 WARN L286 SmtUtils]: Spent 8.22s 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-08 18:12:12,695 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:12:21,016 WARN L286 SmtUtils]: Spent 8.32s 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-08 18:12:29,293 WARN L286 SmtUtils]: Spent 8.28s 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-08 18:12:37,522 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:12:45,814 WARN L286 SmtUtils]: Spent 8.29s 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-08 18:12:54,091 WARN L286 SmtUtils]: Spent 8.28s 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-08 18:13:02,534 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:13:10,858 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:13:19,149 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:13:27,433 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:13:35,721 WARN L286 SmtUtils]: Spent 8.29s 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-08 18:13:43,940 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:13:52,209 WARN L286 SmtUtils]: Spent 8.27s 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-08 18:14:00,455 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:14:08,722 WARN L286 SmtUtils]: Spent 8.27s 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-08 18:14:16,988 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:14:25,262 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:14:33,542 WARN L286 SmtUtils]: Spent 8.28s 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-08 18:14:37,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_20~0 c_~var_1_22~0) (= c_~var_1_1~0 (fp.add c_currentRoundingMode c_~var_1_4~0 (fp.add c_currentRoundingMode c_~var_1_5~0 c_~var_1_6~0))) (bvsge ((_ zero_extend 24) c_~var_1_11~0) (_ bv1 32)) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (not (fp.lt c_~var_1_18~0 (fp.mul c_currentRoundingMode c_~last_1_var_1_22~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)))) (bvsge ((_ zero_extend 24) c_~var_1_12~0) (_ bv1 32)) (= (_ bv1 8) c_~var_1_7~0) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.geq c_~var_1_6~0 .cse0) (fp.leq c_~var_1_6~0 .cse1)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse1)) (fp.leq c_~var_1_6~0 (fp.neg .cse0))))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))))) is different from false
[2024-11-08 18:14:41,689 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (and (fp.gt c_~var_1_18~0 (fp.add c_currentRoundingMode c_~var_1_20~0 (fp.mul c_currentRoundingMode c_~var_1_19~0 c_~var_1_17~0))) (= c_~var_1_20~0 c_~var_1_22~0) (= c_~var_1_1~0 (fp.add c_currentRoundingMode c_~var_1_4~0 (fp.add c_currentRoundingMode c_~var_1_5~0 c_~var_1_6~0))) (bvsge ((_ zero_extend 24) c_~var_1_11~0) (_ bv1 32)) (= c_~var_1_16~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_6~0)) (= ((_ zero_extend 16) c_~var_1_23~0) c_~var_1_25~0) (fp.geq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode .cse0)) (not (fp.lt c_~var_1_18~0 (fp.mul c_currentRoundingMode c_~last_1_var_1_22~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)))) (bvsge ((_ zero_extend 24) c_~var_1_12~0) (_ bv1 32)) (= (_ bv1 8) c_~var_1_7~0) (bvsge ((_ zero_extend 24) c_~var_1_13~0) (_ bv1 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 2305843009213691390.0))) (or (and (fp.geq c_~var_1_6~0 .cse0) (fp.leq c_~var_1_6~0 .cse1)) (and (fp.geq c_~var_1_6~0 (fp.neg .cse1)) (fp.leq c_~var_1_6~0 (fp.neg .cse0))))) (= c_~var_1_15~0 c_~var_1_6~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_~var_1_20~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))))) is different from true
[2024-11-08 18:14:50,035 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:14:58,355 WARN L286 SmtUtils]: Spent 8.32s 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-08 18:15:06,675 WARN L286 SmtUtils]: Spent 8.32s 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-08 18:15:14,932 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:15:23,252 WARN L286 SmtUtils]: Spent 8.32s 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-08 18:15:31,557 WARN L286 SmtUtils]: Spent 8.30s 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-08 18:15:39,875 WARN L286 SmtUtils]: Spent 8.32s 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-08 18:15:48,187 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:15:56,495 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:16:04,785 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:16:13,106 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:16:21,428 WARN L286 SmtUtils]: Spent 8.32s 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-08 18:16:29,698 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:16:37,987 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 18:16:46,297 WARN L286 SmtUtils]: Spent 8.31s 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-08 18:16:54,588 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)