./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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_808824af-c239-4167-b743-30a920cfed0b/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 9eaaae0cf3e71d4340efba7db39961ec1bda8a61f7ee6fd06bc6d6e04fc81770
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:24:31,686 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:24:31,777 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 17:24:31,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:24:31,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:24:31,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:24:31,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:24:31,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:24:31,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:24:31,806 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 17:24:31,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 17:24:31,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 17:24:31,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:24:31,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 17:24:31,808 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 17:24:31,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:24:31,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 17:24:31,809 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 17:24:31,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 17:24:31,810 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 17:24:31,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 17:24:31,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 17:24:31,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 17:24:31,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 17:24:31,812 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 17:24:31,813 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 17:24:31,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 17:24:31,814 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 17:24:31,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:24:31,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 17:24:31,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 17:24:31,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 17:24:31,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:24:31,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:24:31,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 17:24:31,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 17:24:31,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 17:24:31,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 17:24:31,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 17:24:31,818 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 17:24:31,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 17:24:31,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 17:24:31,819 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_808824af-c239-4167-b743-30a920cfed0b/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_808824af-c239-4167-b743-30a920cfed0b/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 -> 9eaaae0cf3e71d4340efba7db39961ec1bda8a61f7ee6fd06bc6d6e04fc81770
[2024-11-08 17:24:32,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:24:32,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:24:32,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:24:32,119 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 17:24:32,121 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 17:24:32,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i
Unable to find full path for "g++"
[2024-11-08 17:24:34,410 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:24:34,595 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 17:24:34,596 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i
[2024-11-08 17:24:34,609 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/data/e1e7814a2/d3d650ac88d4480695b6a7cc0af5474b/FLAG1b1013cbd
[2024-11-08 17:24:34,626 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/data/e1e7814a2/d3d650ac88d4480695b6a7cc0af5474b
[2024-11-08 17:24:34,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:24:34,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:24:34,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:24:34,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:24:34,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:24:34,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:34,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b35a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34, skipping insertion in model container
[2024-11-08 17:24:34,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:34,681 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:24:34,850 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_808824af-c239-4167-b743-30a920cfed0b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i[915,928]
[2024-11-08 17:24:34,910 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:24:34,923 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 17:24:34,937 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_808824af-c239-4167-b743-30a920cfed0b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i[915,928]
[2024-11-08 17:24:34,962 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:24:34,984 INFO L204 MainTranslator]: Completed translation
[2024-11-08 17:24:34,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34 WrapperNode
[2024-11-08 17:24:34,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:24:34,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:24:34,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:24:34,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:24:34,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:35,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:35,036 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145
[2024-11-08 17:24:35,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:24:35,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:24:35,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:24:35,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:24:35,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:35,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:35,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:35,068 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 17:24:35,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:35,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:35,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:35,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:35,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:35,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:35,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:24:35,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:24:35,093 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:24:35,093 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:24:35,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (1/1) ...
[2024-11-08 17:24:35,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:24:35,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:24:35,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 17:24:35,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 17:24:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:24:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 17:24:35,180 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 17:24:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 17:24:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:24:35,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:24:35,281 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 17:24:35,283 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:24:35,628 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live.
[2024-11-08 17:24:35,628 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 17:24:35,647 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:24:35,647 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 17:24:35,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:24:35 BoogieIcfgContainer
[2024-11-08 17:24:35,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:24:35,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 17:24:35,650 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 17:24:35,654 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 17:24:35,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:24:34" (1/3) ...
[2024-11-08 17:24:35,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4608ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:24:35, skipping insertion in model container
[2024-11-08 17:24:35,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:34" (2/3) ...
[2024-11-08 17:24:35,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4608ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:24:35, skipping insertion in model container
[2024-11-08 17:24:35,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:24:35" (3/3) ...
[2024-11-08 17:24:35,657 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-30.i
[2024-11-08 17:24:35,676 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 17:24:35,676 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 17:24:35,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 17:24:35,745 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;@50803ed4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 17:24:35,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 17:24:35,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2024-11-08 17:24:35,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2024-11-08 17:24:35,760 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:24:35,761 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:24:35,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:24:35,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:24:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1322034284, now seen corresponding path program 1 times
[2024-11-08 17:24:35,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:24:35,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634899843]
[2024-11-08 17:24:35,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:24:35,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:24:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-08 17:24:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 17:24:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 17:24:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 17:24:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-11-08 17:24:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 17:24:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-08 17:24:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 17:24:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 17:24:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-11-08 17:24:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked.
[2024-11-08 17:24:36,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:24:36,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634899843]
[2024-11-08 17:24:36,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634899843] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:24:36,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:24:36,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:24:36,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560291564]
[2024-11-08 17:24:36,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:24:36,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 17:24:36,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:24:36,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 17:24:36,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 17:24:36,249 INFO L87 Difference]: Start difference. First operand has 61 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10)
[2024-11-08 17:24:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:24:36,276 INFO L93 Difference]: Finished difference Result 119 states and 189 transitions.
[2024-11-08 17:24:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 17:24:36,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79
[2024-11-08 17:24:36,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:24:36,294 INFO L225 Difference]: With dead ends: 119
[2024-11-08 17:24:36,294 INFO L226 Difference]: Without dead ends: 57
[2024-11-08 17:24:36,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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 17:24:36,304 INFO L432 NwaCegarLoop]: 89 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, 89 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 17:24:36,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:24:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2024-11-08 17:24:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2024-11-08 17:24:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2024-11-08 17:24:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions.
[2024-11-08 17:24:36,368 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 79
[2024-11-08 17:24:36,368 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:24:36,369 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions.
[2024-11-08 17:24:36,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10)
[2024-11-08 17:24:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions.
[2024-11-08 17:24:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2024-11-08 17:24:36,377 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:24:36,377 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:24:36,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 17:24:36,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:24:36,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:24:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash -723058356, now seen corresponding path program 1 times
[2024-11-08 17:24:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:24:36,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462769307]
[2024-11-08 17:24:36,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:24:36,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:24:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-08 17:24:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 17:24:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 17:24:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 17:24:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-11-08 17:24:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 17:24:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-08 17:24:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 17:24:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 17:24:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-11-08 17:24:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked.
[2024-11-08 17:24:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:24:36,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462769307]
[2024-11-08 17:24:36,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462769307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:24:36,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:24:36,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 17:24:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285463835]
[2024-11-08 17:24:36,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:24:36,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 17:24:36,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:24:36,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 17:24:36,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 17:24:36,902 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10)
[2024-11-08 17:24:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:24:37,079 INFO L93 Difference]: Finished difference Result 193 states and 289 transitions.
[2024-11-08 17:24:37,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 17:24:37,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 79
[2024-11-08 17:24:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:24:37,085 INFO L225 Difference]: With dead ends: 193
[2024-11-08 17:24:37,085 INFO L226 Difference]: Without dead ends: 139
[2024-11-08 17:24:37,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:24:37,092 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 110 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 17:24:37,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 266 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 17:24:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2024-11-08 17:24:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109.
[2024-11-08 17:24:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 17:24:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions.
[2024-11-08 17:24:37,129 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 79
[2024-11-08 17:24:37,130 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:24:37,130 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions.
[2024-11-08 17:24:37,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10)
[2024-11-08 17:24:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions.
[2024-11-08 17:24:37,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2024-11-08 17:24:37,134 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:24:37,134 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:24:37,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 17:24:37,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:24:37,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:24:37,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1459285547, now seen corresponding path program 1 times
[2024-11-08 17:24:37,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:24:37,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42641190]
[2024-11-08 17:24:37,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:24:37,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:24:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-08 17:24:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:37,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 17:24:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:37,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 17:24:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:37,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 17:24:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:37,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-11-08 17:24:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:37,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 17:24:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:37,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-08 17:24:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:37,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 17:24:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 17:24:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:37,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-11-08 17:24:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:37,751 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked.
[2024-11-08 17:24:37,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:24:37,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42641190]
[2024-11-08 17:24:37,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42641190] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:24:37,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827811593]
[2024-11-08 17:24:37,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:24:37,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:24:37,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:24:37,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:24:37,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 17:24:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:37,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 17:24:37,913 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:24:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 20 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2024-11-08 17:24:38,280 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:24:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked.
[2024-11-08 17:24:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827811593] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:24:38,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:24:38,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13
[2024-11-08 17:24:38,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788045805]
[2024-11-08 17:24:38,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:24:38,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-11-08 17:24:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:24:38,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-11-08 17:24:38,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2024-11-08 17:24:38,543 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20)
[2024-11-08 17:24:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:24:38,940 INFO L93 Difference]: Finished difference Result 211 states and 301 transitions.
[2024-11-08 17:24:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-08 17:24:38,941 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 80
[2024-11-08 17:24:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:24:38,943 INFO L225 Difference]: With dead ends: 211
[2024-11-08 17:24:38,943 INFO L226 Difference]: Without dead ends: 157
[2024-11-08 17:24:38,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506
[2024-11-08 17:24:38,946 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 315 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 17:24:38,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 340 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 17:24:38,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states.
[2024-11-08 17:24:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 125.
[2024-11-08 17:24:38,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 98 states have (on average 1.336734693877551) internal successors, (131), 98 states have internal predecessors, (131), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 17:24:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 171 transitions.
[2024-11-08 17:24:38,968 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 171 transitions. Word has length 80
[2024-11-08 17:24:38,969 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:24:38,969 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 171 transitions.
[2024-11-08 17:24:38,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20)
[2024-11-08 17:24:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 171 transitions.
[2024-11-08 17:24:38,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2024-11-08 17:24:38,971 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:24:38,971 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:24:38,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 17:24:39,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:24:39,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:24:39,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:24:39,173 INFO L85 PathProgramCache]: Analyzing trace with hash 288237298, now seen corresponding path program 1 times
[2024-11-08 17:24:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:24:39,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836480386]
[2024-11-08 17:24:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:24:39,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:24:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-08 17:24:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 17:24:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 17:24:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 17:24:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-11-08 17:24:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 17:24:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-08 17:24:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 17:24:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 17:24:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-11-08 17:24:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked.
[2024-11-08 17:24:39,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:24:39,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836480386]
[2024-11-08 17:24:39,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836480386] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:24:39,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:24:39,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:24:39,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672410797]
[2024-11-08 17:24:39,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:24:39,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:24:39,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:24:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:24:39,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:24:39,308 INFO L87 Difference]: Start difference. First operand 125 states and 171 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10)
[2024-11-08 17:24:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:24:39,369 INFO L93 Difference]: Finished difference Result 247 states and 339 transitions.
[2024-11-08 17:24:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:24:39,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81
[2024-11-08 17:24:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:24:39,373 INFO L225 Difference]: With dead ends: 247
[2024-11-08 17:24:39,373 INFO L226 Difference]: Without dead ends: 125
[2024-11-08 17:24:39,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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 17:24:39,379 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 17:24:39,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:24:39,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states.
[2024-11-08 17:24:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125.
[2024-11-08 17:24:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 17:24:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 169 transitions.
[2024-11-08 17:24:39,410 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 169 transitions. Word has length 81
[2024-11-08 17:24:39,411 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:24:39,411 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 169 transitions.
[2024-11-08 17:24:39,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10)
[2024-11-08 17:24:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 169 transitions.
[2024-11-08 17:24:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2024-11-08 17:24:39,413 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:24:39,413 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:24:39,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 17:24:39,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:24:39,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:24:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash 492781044, now seen corresponding path program 1 times
[2024-11-08 17:24:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:24:39,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576136223]
[2024-11-08 17:24:39,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:24:39,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:24:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2024-11-08 17:24:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2024-11-08 17:24:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 17:24:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 17:24:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-11-08 17:24:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 17:24:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-11-08 17:24:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 17:24:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 17:24:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-11-08 17:24:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked.
[2024-11-08 17:24:39,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:24:39,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576136223]
[2024-11-08 17:24:39,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576136223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:24:39,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:24:39,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 17:24:39,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159714364]
[2024-11-08 17:24:39,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:24:39,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 17:24:39,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:24:39,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 17:24:39,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:24:39,965 INFO L87 Difference]: Start difference. First operand 125 states and 169 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10)
[2024-11-08 17:24:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:24:40,101 INFO L93 Difference]: Finished difference Result 216 states and 294 transitions.
[2024-11-08 17:24:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 17:24:40,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82
[2024-11-08 17:24:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:24:40,104 INFO L225 Difference]: With dead ends: 216
[2024-11-08 17:24:40,104 INFO L226 Difference]: Without dead ends: 154
[2024-11-08 17:24:40,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-08 17:24:40,109 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 17:24:40,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 218 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 17:24:40,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states.
[2024-11-08 17:24:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 129.
[2024-11-08 17:24:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 17:24:40,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions.
[2024-11-08 17:24:40,136 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 82
[2024-11-08 17:24:40,136 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:24:40,136 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions.
[2024-11-08 17:24:40,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10)
[2024-11-08 17:24:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions.
[2024-11-08 17:24:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2024-11-08 17:24:40,142 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:24:40,142 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:24:40,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 17:24:40,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:24:40,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:24:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash 234615606, now seen corresponding path program 1 times
[2024-11-08 17:24:40,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:24:40,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370851130]
[2024-11-08 17:24:40,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:24:40,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:24:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:24:40,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:24:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:24:40,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:24:40,258 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 17:24:40,259 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 17:24:40,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 17:24:40,264 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2024-11-08 17:24:40,328 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 17:24:40,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:24:40 BoogieIcfgContainer
[2024-11-08 17:24:40,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 17:24:40,332 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 17:24:40,332 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 17:24:40,333 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 17:24:40,333 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:24:35" (3/4) ...
[2024-11-08 17:24:40,336 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 17:24:40,337 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 17:24:40,338 INFO L158 Benchmark]: Toolchain (without parser) took 5706.40ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 112.8MB in the beginning and 75.4MB in the end (delta: 37.3MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB.
[2024-11-08 17:24:40,338 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 107.0MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:24:40,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.72ms. Allocated memory is still 146.8MB. Free memory was 112.8MB in the beginning and 97.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-11-08 17:24:40,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.72ms. Allocated memory is still 146.8MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 17:24:40,339 INFO L158 Benchmark]: Boogie Preprocessor took 53.95ms. Allocated memory is still 146.8MB. Free memory was 95.6MB in the beginning and 93.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 17:24:40,339 INFO L158 Benchmark]: RCFGBuilder took 555.68ms. Allocated memory is still 146.8MB. Free memory was 92.6MB in the beginning and 117.7MB in the end (delta: -25.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB.
[2024-11-08 17:24:40,340 INFO L158 Benchmark]: TraceAbstraction took 4681.61ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 116.9MB in the beginning and 75.4MB in the end (delta: 41.5MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB.
[2024-11-08 17:24:40,340 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 182.5MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:24:40,342 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 107.0MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 355.72ms. Allocated memory is still 146.8MB. Free memory was 112.8MB in the beginning and 97.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 47.72ms. Allocated memory is still 146.8MB. Free memory was 97.6MB in the beginning and 95.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 53.95ms. Allocated memory is still 146.8MB. Free memory was 95.6MB in the beginning and 93.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 555.68ms. Allocated memory is still 146.8MB. Free memory was 92.6MB in the beginning and 117.7MB in the end (delta: -25.1MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB.
* TraceAbstraction took 4681.61ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 116.9MB in the beginning and 75.4MB in the end (delta: 41.5MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB.
* Witness Printer took 4.67ms. Allocated memory is still 182.5MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 78.
Possible FailurePath:
[L21] unsigned char isInitial = 0;
[L22] unsigned char var_1_1 = 1;
[L23] unsigned char var_1_4 = 0;
[L24] double var_1_5 = 127.5;
[L25] double var_1_7 = 10000000000000.125;
[L26] double var_1_8 = 1.25;
[L27] double var_1_10 = 25.7;
[L28] signed long int var_1_11 = -2;
[L29] signed long int var_1_13 = 5;
[L30] signed long int var_1_14 = 128;
[L31] signed long int var_1_15 = 1000;
[L32] double var_1_16 = 0.2;
[L33] double var_1_17 = 0.25;
[L34] double var_1_18 = 99999999999999.5;
[L35] unsigned char last_1_var_1_1 = 1;
[L36] signed long int last_1_var_1_11 = -2;
[L37] signed long int last_1_var_1_15 = 1000;
[L38] double last_1_var_1_16 = 0.2;
VAL [isInitial=0, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4]
[L124] isInitial = 1
[L125] FCALL initially()
[L126] int k_loop;
[L127] k_loop = 0
VAL [isInitial=1, k_loop=0, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4]
[L127] COND FALSE !(k_loop < 1)
VAL [isInitial=1, k_loop=0, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4]
[L127] COND TRUE k_loop < 1
[L128] CALL updateLastVariables()
[L114] last_1_var_1_1 = var_1_1
[L115] last_1_var_1_11 = var_1_11
[L116] last_1_var_1_15 = var_1_15
[L117] last_1_var_1_16 = var_1_16
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4]
[L128] RET updateLastVariables()
[L129] CALL updateVariables()
[L95] var_1_4 = __VERIFIER_nondet_uchar()
[L96] CALL assume_abort_if_not(var_1_4 >= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4]
[L96] RET assume_abort_if_not(var_1_4 >= 1)
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4]
[L97] CALL assume_abort_if_not(var_1_4 <= 1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4]
[L97] RET assume_abort_if_not(var_1_4 <= 1)
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4]
[L98] var_1_7 = __VERIFIER_nondet_double()
[L99] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L99] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L100] var_1_10 = __VERIFIER_nondet_double()
[L101] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L101] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L102] var_1_13 = __VERIFIER_nondet_long()
[L103] CALL assume_abort_if_not(var_1_13 >= -1)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L103] RET assume_abort_if_not(var_1_13 >= -1)
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L104] CALL assume_abort_if_not(var_1_13 <= 2147483646)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L104] RET assume_abort_if_not(var_1_13 <= 2147483646)
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L105] var_1_14 = __VERIFIER_nondet_long()
[L106] CALL assume_abort_if_not(var_1_14 >= -2147483647)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L106] RET assume_abort_if_not(var_1_14 >= -2147483647)
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L107] CALL assume_abort_if_not(var_1_14 <= 2147483646)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L107] RET assume_abort_if_not(var_1_14 <= 2147483646)
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L108] var_1_17 = __VERIFIER_nondet_double()
[L109] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L109] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L110] var_1_18 = __VERIFIER_nondet_double()
[L111] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F ))
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L20] COND FALSE !(!cond)
VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L111] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F ))
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L129] RET updateVariables()
[L130] CALL step()
[L42] COND TRUE \read(last_1_var_1_1)
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L43] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16
[L44] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))))
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L49] signed long int stepLocal_0 = last_1_var_1_11;
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_1=1, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L50] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0
[L51] var_1_1 = var_1_4
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L53] signed long int stepLocal_2 = var_1_11;
[L54] unsigned char stepLocal_1 = var_1_1;
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L55] COND TRUE \read(var_1_1)
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L56] COND TRUE var_1_11 >= stepLocal_2
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=255/2, var_1_8=5/4]
[L57] COND TRUE stepLocal_1 || (var_1_11 < var_1_11)
[L58] var_1_5 = var_1_7
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4]
[L64] EXPR var_1_11 & var_1_13
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4]
[L64] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13))
[L75] var_1_15 = var_1_13
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_16=1/5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4]
[L77] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7
[L78] var_1_16 = (var_1_17 + (var_1_18 + 16.75))
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4]
[L82] COND FALSE !(10.55f < var_1_16)
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4]
[L87] COND TRUE var_1_16 > var_1_7
[L88] var_1_8 = var_1_10
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005]
[L130] RET step()
[L131] CALL, EXPR property()
[L120] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005]
[L120-L121] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17)))
;
[L131] RET, EXPR property()
[L131] CALL __VERIFIER_assert(property())
[L19] COND TRUE !(cond)
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005]
[L19] reach_error()
VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000005, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_1=-255, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000005]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 1050 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 616 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 253 IncrementalHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 434 mSDtfsCounter, 253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 275 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 87 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 563 NumberOfCodeBlocks, 563 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 554 ConstructedInterpolants, 0 QuantifiedInterpolants, 1186 SizeOfPredicates, 1 NumberOfNonLiveVariables, 212 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 1158/1260 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 17:24:40,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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_808824af-c239-4167-b743-30a920cfed0b/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 9eaaae0cf3e71d4340efba7db39961ec1bda8a61f7ee6fd06bc6d6e04fc81770
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:24:42,914 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:24:43,024 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 17:24:43,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:24:43,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:24:43,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:24:43,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:24:43,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:24:43,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:24:43,079 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 17:24:43,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 17:24:43,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 17:24:43,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:24:43,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 17:24:43,084 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 17:24:43,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:24:43,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 17:24:43,085 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 17:24:43,085 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 17:24:43,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 17:24:43,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 17:24:43,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 17:24:43,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 17:24:43,087 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 17:24:43,087 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 17:24:43,087 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 17:24:43,087 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 17:24:43,088 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 17:24:43,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 17:24:43,088 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 17:24:43,088 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:24:43,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 17:24:43,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 17:24:43,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 17:24:43,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:24:43,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:24:43,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 17:24:43,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 17:24:43,094 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 17:24:43,094 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 17:24:43,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 17:24:43,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 17:24:43,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 17:24:43,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 17:24:43,095 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_808824af-c239-4167-b743-30a920cfed0b/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_808824af-c239-4167-b743-30a920cfed0b/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 -> 9eaaae0cf3e71d4340efba7db39961ec1bda8a61f7ee6fd06bc6d6e04fc81770
[2024-11-08 17:24:43,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:24:43,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:24:43,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:24:43,512 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 17:24:43,512 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 17:24:43,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i
Unable to find full path for "g++"
[2024-11-08 17:24:45,559 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:24:45,866 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 17:24:45,867 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i
[2024-11-08 17:24:45,878 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/data/fe128f6f5/c3dd4118ac9947469c35ab5b792f9394/FLAG6da3eb49e
[2024-11-08 17:24:46,137 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/data/fe128f6f5/c3dd4118ac9947469c35ab5b792f9394
[2024-11-08 17:24:46,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:24:46,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:24:46,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:24:46,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:24:46,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:24:46,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ab6533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46, skipping insertion in model container
[2024-11-08 17:24:46,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,186 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:24:46,442 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_808824af-c239-4167-b743-30a920cfed0b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i[915,928]
[2024-11-08 17:24:46,506 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:24:46,525 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 17:24:46,539 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_808824af-c239-4167-b743-30a920cfed0b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-30.i[915,928]
[2024-11-08 17:24:46,577 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:24:46,598 INFO L204 MainTranslator]: Completed translation
[2024-11-08 17:24:46,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46 WrapperNode
[2024-11-08 17:24:46,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:24:46,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:24:46,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:24:46,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:24:46,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,679 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120
[2024-11-08 17:24:46,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:24:46,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:24:46,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:24:46,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:24:46,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,731 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 17:24:46,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:24:46,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:24:46,776 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:24:46,776 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:24:46,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (1/1) ...
[2024-11-08 17:24:46,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:24:46,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:24:46,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 17:24:46,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 17:24:46,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:24:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 17:24:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 17:24:46,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 17:24:46,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:24:46,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:24:46,958 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 17:24:46,961 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:24:57,373 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live.
[2024-11-08 17:24:57,374 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 17:24:57,387 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:24:57,387 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 17:24:57,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:24:57 BoogieIcfgContainer
[2024-11-08 17:24:57,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:24:57,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 17:24:57,391 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 17:24:57,394 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 17:24:57,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:24:46" (1/3) ...
[2024-11-08 17:24:57,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0a05c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:24:57, skipping insertion in model container
[2024-11-08 17:24:57,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:24:46" (2/3) ...
[2024-11-08 17:24:57,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a0a05c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:24:57, skipping insertion in model container
[2024-11-08 17:24:57,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:24:57" (3/3) ...
[2024-11-08 17:24:57,398 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-30.i
[2024-11-08 17:24:57,417 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 17:24:57,417 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 17:24:57,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 17:24:57,488 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;@4e0b1c92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 17:24:57,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 17:24:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2024-11-08 17:24:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2024-11-08 17:24:57,503 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:24:57,504 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:24:57,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:24:57,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:24:57,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2007526942, now seen corresponding path program 1 times
[2024-11-08 17:24:57,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:24:57,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179632543]
[2024-11-08 17:24:57,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:24:57,523 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 17:24:57,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:24:57,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:24:57,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:24:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:58,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 17:24:58,048 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:24:58,086 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked.
[2024-11-08 17:24:58,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:24:58,087 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:24:58,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179632543]
[2024-11-08 17:24:58,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179632543] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:24:58,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:24:58,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 17:24:58,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359614077]
[2024-11-08 17:24:58,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:24:58,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 17:24:58,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:24:58,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 17:24:58,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 17:24:58,126 INFO L87 Difference]: Start difference. First operand has 52 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 40 states have internal predecessors, (57), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)
[2024-11-08 17:24:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:24:58,157 INFO L93 Difference]: Finished difference Result 101 states and 161 transitions.
[2024-11-08 17:24:58,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 17:24:58,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 76
[2024-11-08 17:24:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:24:58,169 INFO L225 Difference]: With dead ends: 101
[2024-11-08 17:24:58,169 INFO L226 Difference]: Without dead ends: 48
[2024-11-08 17:24:58,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 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 17:24:58,181 INFO L432 NwaCegarLoop]: 75 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, 75 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 17:24:58,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 17:24:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2024-11-08 17:24:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2024-11-08 17:24:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10)
[2024-11-08 17:24:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions.
[2024-11-08 17:24:58,256 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 76
[2024-11-08 17:24:58,258 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:24:58,258 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions.
[2024-11-08 17:24:58,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)
[2024-11-08 17:24:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions.
[2024-11-08 17:24:58,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2024-11-08 17:24:58,263 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:24:58,264 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:24:58,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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)] Forceful destruction successful, exit code 0
[2024-11-08 17:24:58,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:24:58,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:24:58,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:24:58,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1341481830, now seen corresponding path program 1 times
[2024-11-08 17:24:58,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:24:58,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802631823]
[2024-11-08 17:24:58,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:24:58,469 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 17:24:58,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:24:58,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:24:58,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:24:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:24:58,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 17:24:59,003 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:24:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked.
[2024-11-08 17:24:59,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:24:59,777 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:24:59,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802631823]
[2024-11-08 17:24:59,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802631823] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:24:59,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:24:59,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:24:59,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320016904]
[2024-11-08 17:24:59,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:24:59,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 17:24:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:24:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 17:24:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 17:24:59,782 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10)
[2024-11-08 17:25:04,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:25:08,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:25:12,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:25:16,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:25:18,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:25:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:25:18,277 INFO L93 Difference]: Finished difference Result 157 states and 233 transitions.
[2024-11-08 17:25:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 17:25:18,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 76
[2024-11-08 17:25:18,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:25:18,316 INFO L225 Difference]: With dead ends: 157
[2024-11-08 17:25:18,316 INFO L226 Difference]: Without dead ends: 112
[2024-11-08 17:25:18,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:25:18,319 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 79 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 23 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.4s IncrementalHoareTripleChecker+Time
[2024-11-08 17:25:18,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 211 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 16 Invalid, 4 Unknown, 0 Unchecked, 18.4s Time]
[2024-11-08 17:25:18,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2024-11-08 17:25:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91.
[2024-11-08 17:25:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 68 states have internal predecessors, (93), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 17:25:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions.
[2024-11-08 17:25:18,350 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 76
[2024-11-08 17:25:18,351 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:25:18,351 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions.
[2024-11-08 17:25:18,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10)
[2024-11-08 17:25:18,352 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions.
[2024-11-08 17:25:18,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78
[2024-11-08 17:25:18,353 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:25:18,354 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:25:18,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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)] Ended with exit code 0
[2024-11-08 17:25:18,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:25:18,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:25:18,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:25:18,556 INFO L85 PathProgramCache]: Analyzing trace with hash 656987111, now seen corresponding path program 1 times
[2024-11-08 17:25:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:25:18,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274457838]
[2024-11-08 17:25:18,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:25:18,558 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 17:25:18,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:25:18,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:25:18,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 (4)] Waiting until timeout for monitored process
[2024-11-08 17:25:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:25:19,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 17:25:19,072 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:25:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 20 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2024-11-08 17:25:20,746 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:25:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked.
[2024-11-08 17:25:21,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:25:21,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274457838]
[2024-11-08 17:25:21,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274457838] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:25:21,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 17:25:21,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12
[2024-11-08 17:25:21,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423683559]
[2024-11-08 17:25:21,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:25:21,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-08 17:25:21,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:25:21,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-08 17:25:21,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132
[2024-11-08 17:25:21,671 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20)
[2024-11-08 17:25:27,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:25:31,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:25:35,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:25:37,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:25:37,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:25:37,969 INFO L93 Difference]: Finished difference Result 155 states and 215 transitions.
[2024-11-08 17:25:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-08 17:25:37,975 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 77
[2024-11-08 17:25:37,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:25:37,977 INFO L225 Difference]: With dead ends: 155
[2024-11-08 17:25:37,977 INFO L226 Difference]: Without dead ends: 110
[2024-11-08 17:25:37,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380
[2024-11-08 17:25:37,983 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 122 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 41 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time
[2024-11-08 17:25:37,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 201 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 138 Invalid, 3 Unknown, 0 Unchecked, 15.7s Time]
[2024-11-08 17:25:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2024-11-08 17:25:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107.
[2024-11-08 17:25:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 17:25:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions.
[2024-11-08 17:25:38,020 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 77
[2024-11-08 17:25:38,021 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:25:38,021 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions.
[2024-11-08 17:25:38,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20)
[2024-11-08 17:25:38,021 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions.
[2024-11-08 17:25:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2024-11-08 17:25:38,023 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:25:38,023 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:25:38,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 (4)] Forceful destruction successful, exit code 0
[2024-11-08 17:25:38,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:25:38,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:25:38,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:25:38,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1436397440, now seen corresponding path program 1 times
[2024-11-08 17:25:38,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:25:38,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004276796]
[2024-11-08 17:25:38,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:25:38,226 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 17:25:38,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:25:38,230 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:25:38,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 (5)] Waiting until timeout for monitored process
[2024-11-08 17:25:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:25:38,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 17:25:38,749 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:25:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked.
[2024-11-08 17:25:38,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:25:38,803 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:25:38,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004276796]
[2024-11-08 17:25:38,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004276796] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:25:38,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:25:38,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:25:38,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627657079]
[2024-11-08 17:25:38,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:25:38,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:25:38,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:25:38,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:25:38,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:25:38,806 INFO L87 Difference]: Start difference. First operand 107 states and 143 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10)
[2024-11-08 17:25:42,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:25:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:25:43,023 INFO L93 Difference]: Finished difference Result 211 states and 283 transitions.
[2024-11-08 17:25:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:25:43,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 78
[2024-11-08 17:25:43,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:25:43,026 INFO L225 Difference]: With dead ends: 211
[2024-11-08 17:25:43,026 INFO L226 Difference]: Without dead ends: 107
[2024-11-08 17:25:43,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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 17:25:43,029 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time
[2024-11-08 17:25:43,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time]
[2024-11-08 17:25:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2024-11-08 17:25:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2024-11-08 17:25:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.2625) internal successors, (101), 80 states have internal predecessors, (101), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 17:25:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 141 transitions.
[2024-11-08 17:25:43,051 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 141 transitions. Word has length 78
[2024-11-08 17:25:43,052 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:25:43,052 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 141 transitions.
[2024-11-08 17:25:43,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10)
[2024-11-08 17:25:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 141 transitions.
[2024-11-08 17:25:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2024-11-08 17:25:43,054 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:25:43,054 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:25:43,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 (5)] Forceful destruction successful, exit code 0
[2024-11-08 17:25:43,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:25:43,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:25:43,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:25:43,256 INFO L85 PathProgramCache]: Analyzing trace with hash -223371074, now seen corresponding path program 1 times
[2024-11-08 17:25:43,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:25:43,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918257838]
[2024-11-08 17:25:43,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:25:43,257 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 17:25:43,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:25:43,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:25:43,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 (6)] Waiting until timeout for monitored process
[2024-11-08 17:25:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:25:43,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-08 17:25:43,713 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:25:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 20 proven. 48 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2024-11-08 17:25:45,310 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:25:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked.
[2024-11-08 17:25:46,216 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:25:46,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918257838]
[2024-11-08 17:25:46,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918257838] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:25:46,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 17:25:46,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14
[2024-11-08 17:25:46,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294468622]
[2024-11-08 17:25:46,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:25:46,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-11-08 17:25:46,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:25:46,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-11-08 17:25:46,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182
[2024-11-08 17:25:46,221 INFO L87 Difference]: Start difference. First operand 107 states and 141 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20)
[2024-11-08 17:25:52,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:25:54,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []
[2024-11-08 17:25:55,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:25:55,356 INFO L93 Difference]: Finished difference Result 214 states and 282 transitions.
[2024-11-08 17:25:55,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-08 17:25:55,357 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20) Word has length 79
[2024-11-08 17:25:55,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 17:25:55,359 INFO L225 Difference]: With dead ends: 214
[2024-11-08 17:25:55,360 INFO L226 Difference]: Without dead ends: 110
[2024-11-08 17:25:55,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506
[2024-11-08 17:25:55,362 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 132 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time
[2024-11-08 17:25:55,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 299 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 191 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time]
[2024-11-08 17:25:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2024-11-08 17:25:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107.
[2024-11-08 17:25:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20)
[2024-11-08 17:25:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions.
[2024-11-08 17:25:55,382 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 139 transitions. Word has length 79
[2024-11-08 17:25:55,382 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 17:25:55,382 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 139 transitions.
[2024-11-08 17:25:55,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 2 states have call predecessors, (20), 3 states have call successors, (20)
[2024-11-08 17:25:55,392 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions.
[2024-11-08 17:25:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2024-11-08 17:25:55,395 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 17:25:55,395 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:25:55,406 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 (6)] Ended with exit code 0
[2024-11-08 17:25:55,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:25:55,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 17:25:55,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:25:55,597 INFO L85 PathProgramCache]: Analyzing trace with hash -903429444, now seen corresponding path program 1 times
[2024-11-08 17:25:55,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:25:55,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260717249]
[2024-11-08 17:25:55,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:25:55,598 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 17:25:55,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/bin/uautomizer-verify-jihMAELWvX/mathsat
[2024-11-08 17:25:55,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 17:25:55,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_808824af-c239-4167-b743-30a920cfed0b/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 (7)] Waiting until timeout for monitored process
[2024-11-08 17:25:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:25:56,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 24 conjuncts are in the unsatisfiable core
[2024-11-08 17:25:56,095 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:26:59,301 WARN L286 SmtUtils]: Spent 13.86s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 17:27:52,735 WARN L286 SmtUtils]: Spent 14.46s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)
[2024-11-08 17:28:00,894 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 17:28:09,022 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 17:28:14,168 WARN L286 SmtUtils]: Spent 5.15s 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 17:28:22,280 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:28:31,242 WARN L286 SmtUtils]: Spent 6.45s 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 17:28:41,542 WARN L286 SmtUtils]: Spent 5.57s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:28:49,679 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 17:28:56,580 WARN L286 SmtUtils]: Spent 6.90s 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 17:29:04,728 WARN L286 SmtUtils]: Spent 8.15s 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 17:29:12,869 WARN L286 SmtUtils]: Spent 8.14s 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 17:29:21,026 WARN L286 SmtUtils]: Spent 8.16s 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 17:29:29,163 WARN L286 SmtUtils]: Spent 8.14s 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 17:29:38,251 WARN L286 SmtUtils]: Spent 6.64s 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 17:29:46,384 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 17:29:54,510 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 17:30:02,672 WARN L286 SmtUtils]: Spent 8.16s 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 17:30:08,311 WARN L286 SmtUtils]: Spent 5.64s 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 17:30:14,641 WARN L286 SmtUtils]: Spent 6.33s 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 17:30:22,775 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 17:30:27,929 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:30:36,092 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:30:41,378 WARN L286 SmtUtils]: Spent 5.29s 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 17:30:47,956 WARN L286 SmtUtils]: Spent 6.58s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-08 17:30:56,114 WARN L286 SmtUtils]: Spent 8.16s 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 17:31:04,266 WARN L286 SmtUtils]: Spent 8.15s 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 17:31:12,405 WARN L286 SmtUtils]: Spent 8.14s 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 17:31:20,111 WARN L286 SmtUtils]: Spent 7.71s 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 17:31:28,253 WARN L286 SmtUtils]: Spent 8.14s 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 17:31:33,775 WARN L286 SmtUtils]: Spent 5.52s 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 17:31:37,816 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse3))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse10))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse10))) (and (= (_ bv1 8) c_~last_1_var_1_1~0) (= c_~var_1_4~0 c_~var_1_1~0) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 211.0 20.0))) c_~var_1_16~0) (or (and (fp.geq c_~var_1_10~0 .cse0) (fp.leq c_~var_1_10~0 .cse1)) (and (fp.geq c_~var_1_10~0 .cse2) (fp.leq c_~var_1_10~0 ((_ to_fp 11 53) c_currentRoundingMode .cse3)))) (= c_~var_1_15~0 c_~var_1_13~0) (let ((.cse8 (bvadd c_~var_1_13~0 (_ bv4294967291 32)))) (let ((.cse4 (= c_~last_1_var_1_15~0 c_~var_1_11~0)) (.cse6 (bvsgt .cse8 c_~var_1_14~0))) (or (and (let ((.cse5 (bvslt c_~last_1_var_1_15~0 c_~var_1_14~0))) (or (and .cse4 .cse5) (and (= c_~var_1_11~0 c_~var_1_14~0) (not .cse5)))) (not .cse6)) (and (let ((.cse7 (bvslt c_~last_1_var_1_15~0 .cse8))) (or (and (= (bvadd (_ bv5 32) c_~var_1_11~0) c_~var_1_13~0) (not .cse7)) (and .cse4 .cse7))) .cse6)))) (not (bvsgt (bvneg c_~var_1_11~0) (bvand c_~var_1_13~0 c_~var_1_11~0))) (let ((.cse9 (fp.gt c_~var_1_7~0 c_~var_1_10~0))) (or (and .cse9 (= c_~var_1_7~0 c_~var_1_8~0)) (and (not .cse9) (= c_~var_1_8~0 c_~var_1_10~0)))) (= c_~var_1_16~0 (fp.add c_currentRoundingMode c_~var_1_17~0 (fp.add c_currentRoundingMode c_~var_1_18~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 67.0 4.0))))) (= c_~var_1_7~0 c_~var_1_5~0) (or (and (fp.geq c_~var_1_7~0 .cse0) (fp.leq c_~var_1_7~0 .cse1)) (fp.geq c_~var_1_7~0 .cse2)) (fp.geq c_~last_1_var_1_16~0 c_~var_1_7~0) (fp.gt c_~var_1_16~0 (fp.mul c_currentRoundingMode c_~var_1_7~0 c_~var_1_16~0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false