./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme --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 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:48:21,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:48:22,005 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:48:22,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:48:22,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:48:22,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:48:22,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:48:22,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:48:22,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:48:22,040 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:48:22,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:48:22,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:48:22,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:48:22,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:48:22,044 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:48:22,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:48:22,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:48:22,046 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:48:22,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:48:22,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:48:22,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:48:22,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:48:22,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:48:22,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:48:22,050 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:48:22,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:48:22,051 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:48:22,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:48:22,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:48:22,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:48:22,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:48:22,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:22,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:48:22,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:48:22,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:48:22,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:48:22,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:48:22,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:48:22,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:48:22,056 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:48:22,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:48:22,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:48:22,057 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_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/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_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme 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 -> 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b [2023-11-26 11:48:22,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:48:22,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:48:22,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:48:22,432 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:48:22,433 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:48:22,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2023-11-26 11:48:25,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:48:25,943 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:48:25,943 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2023-11-26 11:48:25,954 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/data/a59422955/2d8a5d761f8c4697a20ea111027fb530/FLAGe98e71875 [2023-11-26 11:48:25,973 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/data/a59422955/2d8a5d761f8c4697a20ea111027fb530 [2023-11-26 11:48:25,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:48:25,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:48:25,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:48:25,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:48:25,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:48:25,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:48:25" (1/1) ... [2023-11-26 11:48:25,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b5fd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:25, skipping insertion in model container [2023-11-26 11:48:25,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:48:25" (1/1) ... [2023-11-26 11:48:26,020 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:48:26,175 WARN L240 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_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2023-11-26 11:48:26,235 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:48:26,250 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:48:26,264 WARN L240 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_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2023-11-26 11:48:26,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:48:26,309 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:48:26,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26 WrapperNode [2023-11-26 11:48:26,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:48:26,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:48:26,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:48:26,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:48:26,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,374 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2023-11-26 11:48:26,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:48:26,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:48:26,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:48:26,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:48:26,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,417 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]. [2023-11-26 11:48:26,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:48:26,477 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:48:26,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:48:26,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:48:26,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (1/1) ... [2023-11-26 11:48:26,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:26,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:26,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:48:26,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:48:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:48:26,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:48:26,578 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:48:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:48:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:48:26,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:48:26,688 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:48:26,691 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:48:27,004 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:48:27,072 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:48:27,072 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:48:27,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:27 BoogieIcfgContainer [2023-11-26 11:48:27,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:48:27,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:48:27,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:48:27,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:48:27,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:48:25" (1/3) ... [2023-11-26 11:48:27,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9d5d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:48:27, skipping insertion in model container [2023-11-26 11:48:27,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:26" (2/3) ... [2023-11-26 11:48:27,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9d5d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:48:27, skipping insertion in model container [2023-11-26 11:48:27,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:27" (3/3) ... [2023-11-26 11:48:27,084 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-73.i [2023-11-26 11:48:27,128 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:48:27,143 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:48:27,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:48:27,220 INFO L357 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, mHoare=true, 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;@a79a80e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:48:27,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:48:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-26 11:48:27,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:27,240 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:27,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:27,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:27,246 INFO L85 PathProgramCache]: Analyzing trace with hash -381715089, now seen corresponding path program 1 times [2023-11-26 11:48:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:27,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710362213] [2023-11-26 11:48:27,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:48:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:48:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:48:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:48:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:48:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:48:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:48:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:48:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:48:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:48:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:48:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:48:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:48:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:48:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:48:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:48:27,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:27,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710362213] [2023-11-26 11:48:27,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710362213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:27,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:27,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:48:27,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641951170] [2023-11-26 11:48:27,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:27,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:48:27,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:27,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:48:27,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:48:27,842 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-26 11:48:27,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:27,899 INFO L93 Difference]: Finished difference Result 95 states and 168 transitions. [2023-11-26 11:48:27,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:48:27,902 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 109 [2023-11-26 11:48:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:27,910 INFO L225 Difference]: With dead ends: 95 [2023-11-26 11:48:27,911 INFO L226 Difference]: Without dead ends: 47 [2023-11-26 11:48:27,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:48:27,919 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:27,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:48:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-26 11:48:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-26 11:48:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2023-11-26 11:48:27,968 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 109 [2023-11-26 11:48:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:27,969 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2023-11-26 11:48:27,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-26 11:48:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2023-11-26 11:48:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-26 11:48:27,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:27,973 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:27,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:48:27,974 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:27,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash -755669969, now seen corresponding path program 1 times [2023-11-26 11:48:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:27,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191524429] [2023-11-26 11:48:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:48:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:48:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:48:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:48:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:48:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:48:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:48:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:48:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:48:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:48:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:48:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:48:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:48:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:48:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:48:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:48:28,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:28,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191524429] [2023-11-26 11:48:28,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191524429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:28,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:28,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:48:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488076370] [2023-11-26 11:48:28,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:28,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:48:28,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:28,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:48:28,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:48:28,696 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:48:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:28,922 INFO L93 Difference]: Finished difference Result 128 states and 195 transitions. [2023-11-26 11:48:28,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:48:28,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2023-11-26 11:48:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:28,927 INFO L225 Difference]: With dead ends: 128 [2023-11-26 11:48:28,927 INFO L226 Difference]: Without dead ends: 82 [2023-11-26 11:48:28,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:48:28,930 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 66 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:28,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 238 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:48:28,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-26 11:48:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 47. [2023-11-26 11:48:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2023-11-26 11:48:28,970 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 109 [2023-11-26 11:48:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:28,972 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2023-11-26 11:48:28,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:48:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2023-11-26 11:48:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-26 11:48:28,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:28,976 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:28,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:48:28,976 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:28,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:28,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1960552136, now seen corresponding path program 1 times [2023-11-26 11:48:28,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:28,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15252688] [2023-11-26 11:48:28,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:28,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:48:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:48:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:48:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:48:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:48:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:48:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:48:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:48:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:48:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:48:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:48:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:48:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:48:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:48:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:48:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:48:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:32,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15252688] [2023-11-26 11:48:32,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15252688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:32,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:32,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 11:48:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722444630] [2023-11-26 11:48:32,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:32,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 11:48:32,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:32,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:48:32,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:48:32,475 INFO L87 Difference]: Start difference. First operand 47 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:48:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:32,842 INFO L93 Difference]: Finished difference Result 112 states and 163 transitions. [2023-11-26 11:48:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:48:32,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 110 [2023-11-26 11:48:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:32,845 INFO L225 Difference]: With dead ends: 112 [2023-11-26 11:48:32,846 INFO L226 Difference]: Without dead ends: 66 [2023-11-26 11:48:32,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:48:32,848 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:32,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 226 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:48:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-26 11:48:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2023-11-26 11:48:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 82 transitions. [2023-11-26 11:48:32,866 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 82 transitions. Word has length 110 [2023-11-26 11:48:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:32,867 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 82 transitions. [2023-11-26 11:48:32,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:48:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 82 transitions. [2023-11-26 11:48:32,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-26 11:48:32,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:32,877 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:32,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:48:32,878 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:32,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:32,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2088655939, now seen corresponding path program 1 times [2023-11-26 11:48:32,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:32,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606586122] [2023-11-26 11:48:32,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:32,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:48:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:48:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:48:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:32,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:48:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:48:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:48:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:48:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:48:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:48:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:48:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:48:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:48:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:48:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:48:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:48:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:48:33,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:33,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606586122] [2023-11-26 11:48:33,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606586122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:33,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:33,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:33,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150857208] [2023-11-26 11:48:33,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:33,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:33,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:33,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:33,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:33,045 INFO L87 Difference]: Start difference. First operand 58 states and 82 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:48:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:33,092 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2023-11-26 11:48:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:33,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-11-26 11:48:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:33,099 INFO L225 Difference]: With dead ends: 121 [2023-11-26 11:48:33,100 INFO L226 Difference]: Without dead ends: 64 [2023-11-26 11:48:33,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:33,113 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 11 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:33,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:48:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-26 11:48:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2023-11-26 11:48:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:33,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2023-11-26 11:48:33,138 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 111 [2023-11-26 11:48:33,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:33,139 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2023-11-26 11:48:33,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:48:33,140 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2023-11-26 11:48:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-26 11:48:33,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:33,143 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:33,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:48:33,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:33,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2088715521, now seen corresponding path program 1 times [2023-11-26 11:48:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46767197] [2023-11-26 11:48:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:48:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:48:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:48:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:48:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:48:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:48:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:48:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:48:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:48:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:48:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:48:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:48:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:48:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:48:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:48:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:48:35,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:35,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46767197] [2023-11-26 11:48:35,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46767197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:35,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:35,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 11:48:35,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563552349] [2023-11-26 11:48:35,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:35,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:48:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:48:35,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:48:35,544 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:48:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:35,791 INFO L93 Difference]: Finished difference Result 130 states and 176 transitions. [2023-11-26 11:48:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-26 11:48:35,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-11-26 11:48:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:35,794 INFO L225 Difference]: With dead ends: 130 [2023-11-26 11:48:35,794 INFO L226 Difference]: Without dead ends: 73 [2023-11-26 11:48:35,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2023-11-26 11:48:35,796 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 29 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:35,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 235 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:48:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-26 11:48:35,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2023-11-26 11:48:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2023-11-26 11:48:35,815 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 111 [2023-11-26 11:48:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:35,817 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2023-11-26 11:48:35,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:48:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2023-11-26 11:48:35,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-26 11:48:35,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:35,819 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:35,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:48:35,820 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:35,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1408657151, now seen corresponding path program 1 times [2023-11-26 11:48:35,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:35,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989316610] [2023-11-26 11:48:35,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:37,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:37,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:48:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:37,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:37,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:48:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:37,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:48:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:37,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:48:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:37,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:48:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:37,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:48:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:37,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:37,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:48:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:38,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:48:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:38,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:48:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:38,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:48:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:38,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:48:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:38,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:48:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:38,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:48:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:38,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:48:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:38,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:48:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:48:38,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989316610] [2023-11-26 11:48:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989316610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:38,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:38,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 11:48:38,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326443956] [2023-11-26 11:48:38,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:38,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 11:48:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:38,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:48:38,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:48:38,028 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:48:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:38,401 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2023-11-26 11:48:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 11:48:38,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2023-11-26 11:48:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:38,404 INFO L225 Difference]: With dead ends: 77 [2023-11-26 11:48:38,404 INFO L226 Difference]: Without dead ends: 75 [2023-11-26 11:48:38,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:48:38,405 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 39 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:38,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 205 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 11:48:38,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-26 11:48:38,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2023-11-26 11:48:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2023-11-26 11:48:38,421 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 111 [2023-11-26 11:48:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:38,422 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2023-11-26 11:48:38,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:48:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2023-11-26 11:48:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-26 11:48:38,424 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:38,424 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:38,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:48:38,425 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:38,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:38,425 INFO L85 PathProgramCache]: Analyzing trace with hash 312849302, now seen corresponding path program 1 times [2023-11-26 11:48:38,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884249954] [2023-11-26 11:48:38,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:48:38,490 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:48:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:48:38,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:48:38,595 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:48:38,596 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:48:38,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:48:38,603 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:38,608 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:48:38,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:48:38 BoogieIcfgContainer [2023-11-26 11:48:38,746 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:48:38,746 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:48:38,747 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:48:38,747 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:48:38,748 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:27" (3/4) ... [2023-11-26 11:48:38,750 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:48:38,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:48:38,752 INFO L158 Benchmark]: Toolchain (without parser) took 12771.61ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 118.4MB in the beginning and 102.6MB in the end (delta: 15.8MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2023-11-26 11:48:38,752 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 107.0MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:48:38,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.33ms. Allocated memory is still 163.6MB. Free memory was 118.4MB in the beginning and 105.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 11:48:38,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.63ms. Allocated memory is still 163.6MB. Free memory was 105.7MB in the beginning and 102.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:48:38,754 INFO L158 Benchmark]: Boogie Preprocessor took 100.63ms. Allocated memory is still 163.6MB. Free memory was 102.8MB in the beginning and 98.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:48:38,754 INFO L158 Benchmark]: RCFGBuilder took 596.61ms. Allocated memory is still 163.6MB. Free memory was 98.6MB in the beginning and 79.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 11:48:38,755 INFO L158 Benchmark]: TraceAbstraction took 11669.70ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 79.4MB in the beginning and 103.6MB in the end (delta: -24.3MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2023-11-26 11:48:38,755 INFO L158 Benchmark]: Witness Printer took 4.79ms. Allocated memory is still 239.1MB. Free memory was 103.6MB in the beginning and 102.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:48:38,758 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 57.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.33ms. Allocated memory is still 163.6MB. Free memory was 118.4MB in the beginning and 105.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.63ms. Allocated memory is still 163.6MB. Free memory was 105.7MB in the beginning and 102.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.63ms. Allocated memory is still 163.6MB. Free memory was 102.8MB in the beginning and 98.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 596.61ms. Allocated memory is still 163.6MB. Free memory was 98.6MB in the beginning and 79.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11669.70ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 79.4MB in the beginning and 103.6MB in the end (delta: -24.3MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * Witness Printer took 4.79ms. Allocated memory is still 239.1MB. Free memory was 103.6MB in the beginning and 102.6MB in the end (delta: 1.0MB). 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 to_int at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 5; [L23] unsigned char var_1_6 = 1; [L24] signed long int var_1_7 = 0; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] signed long int var_1_12 = 15; [L29] signed long int var_1_13 = 1; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 0; [L32] signed long int var_1_16 = 16; [L33] signed char var_1_17 = 10; [L34] signed char var_1_18 = -10; [L35] signed long int var_1_19 = -16; [L36] signed long int last_1_var_1_12 = 15; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L101] last_1_var_1_12 = var_1_12 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_7=0, var_1_8=25, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=0, var_1_8=25, var_1_9=100] [L75] var_1_7 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L76] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L77] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L77] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=100] [L78] var_1_9 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25] [L80] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L80] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=1, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L82] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L83] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L83] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L84] var_1_13 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L85] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L86] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L86] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L87] var_1_14 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L88] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L89] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L89] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=0, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L90] var_1_15 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L92] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L92] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=16, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L93] var_1_16 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L94] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L95] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L95] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L96] var_1_18 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L97] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L98] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L98] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=25, var_1_9=4] [L112] RET updateVariables() [L113] CALL step() [L40] COND TRUE \read(var_1_6) [L41] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=-16, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L47] var_1_19 = var_1_8 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=8, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L48] COND TRUE var_1_19 > var_1_9 VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=15, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=8, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L49] COND TRUE \read(var_1_6) [L50] var_1_12 = (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))) VAL [isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=8, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L61] signed long int stepLocal_0 = (((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))); VAL [isInitial=1, last_1_var_1_12=15, stepLocal_0=16, var_1_10=8, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=8, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L62] COND TRUE var_1_8 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=15, stepLocal_0=16, var_1_10=8, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=8, var_1_1=5, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L63] COND FALSE !(! var_1_6) [L66] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=15, stepLocal_0=16, var_1_10=8, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=10, var_1_18=126, var_1_19=8, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L69] var_1_17 = var_1_18 [L113] RET step() [L114] CALL, EXPR property() [L104-L105] return (((((var_1_8 <= ((((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))))) ? ((! var_1_6) ? (var_1_1 == ((signed long int) var_1_7)) : (var_1_1 == ((signed long int) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((last_1_var_1_12 < (last_1_var_1_12 + var_1_7)) ? (var_1_8 == ((unsigned char) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1))) && ((var_1_19 > var_1_9) ? (var_1_6 ? (var_1_12 == ((signed long int) (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((var_1_14 && var_1_15) ? (var_1_12 == ((signed long int) (var_1_13 - var_1_16))) : (var_1_12 == ((signed long int) var_1_16)))) : (var_1_12 == ((signed long int) var_1_13)))) && (var_1_17 == ((signed char) var_1_18))) && (var_1_19 == ((signed long int) var_1_8)) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=-2, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=126, var_1_18=126, var_1_19=8, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=15, var_1_10=8, var_1_12=-2, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=2, var_1_17=126, var_1_18=126, var_1_19=8, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=8, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 1100 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 659 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 328 IncrementalHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 441 mSDtfsCounter, 328 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 655 ConstructedInterpolants, 0 QuantifiedInterpolants, 2714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 3672/3672 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 [2023-11-26 11:48:38,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/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_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme --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 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:48:41,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:48:41,710 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 11:48:41,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:48:41,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:48:41,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:48:41,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:48:41,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:48:41,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:48:41,770 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:48:41,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:48:41,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:48:41,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:48:41,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:48:41,774 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:48:41,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:48:41,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:48:41,776 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:48:41,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:48:41,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:48:41,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:48:41,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:48:41,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:48:41,779 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:48:41,780 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:48:41,780 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:48:41,780 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:48:41,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:48:41,781 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:48:41,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:48:41,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:48:41,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:48:41,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:48:41,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:41,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:48:41,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:48:41,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:48:41,786 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:48:41,786 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:48:41,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:48:41,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:48:41,787 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:48:41,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:48:41,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:48:41,788 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:48:41,788 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_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/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_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme 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 -> 480085f0fbc2bb150cea70cfe42d19d7967e13aabeaaf15e92071325d497a99b [2023-11-26 11:48:42,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:48:42,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:48:42,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:48:42,244 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:48:42,245 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:48:42,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2023-11-26 11:48:45,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:48:45,806 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:48:45,807 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i [2023-11-26 11:48:45,817 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/data/937b91955/e67651808de241af982490b9b5165fd2/FLAG237118ad4 [2023-11-26 11:48:45,833 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/data/937b91955/e67651808de241af982490b9b5165fd2 [2023-11-26 11:48:45,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:48:45,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:48:45,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:48:45,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:48:45,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:48:45,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:48:45" (1/1) ... [2023-11-26 11:48:45,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0d2141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:45, skipping insertion in model container [2023-11-26 11:48:45,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:48:45" (1/1) ... [2023-11-26 11:48:45,892 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:48:46,107 WARN L240 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_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2023-11-26 11:48:46,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:48:46,209 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:48:46,229 WARN L240 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_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-73.i[916,929] [2023-11-26 11:48:46,263 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:48:46,282 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:48:46,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46 WrapperNode [2023-11-26 11:48:46,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:48:46,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:48:46,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:48:46,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:48:46,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (1/1) ... [2023-11-26 11:48:46,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (1/1) ... [2023-11-26 11:48:46,329 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2023-11-26 11:48:46,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:48:46,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:48:46,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:48:46,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:48:46,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (1/1) ... [2023-11-26 11:48:46,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (1/1) ... [2023-11-26 11:48:46,349 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (1/1) ... [2023-11-26 11:48:46,370 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]. [2023-11-26 11:48:46,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (1/1) ... [2023-11-26 11:48:46,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (1/1) ... [2023-11-26 11:48:46,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (1/1) ... [2023-11-26 11:48:46,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (1/1) ... [2023-11-26 11:48:46,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (1/1) ... [2023-11-26 11:48:46,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (1/1) ... [2023-11-26 11:48:46,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:48:46,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:48:46,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:48:46,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:48:46,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (1/1) ... [2023-11-26 11:48:46,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:46,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:46,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:48:46,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:48:46,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:48:46,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:48:46,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:48:46,544 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:48:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:48:46,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:48:46,753 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:48:46,755 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:48:49,919 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:48:49,969 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:48:49,969 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:48:49,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:49 BoogieIcfgContainer [2023-11-26 11:48:49,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:48:49,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:48:49,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:48:49,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:48:49,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:48:45" (1/3) ... [2023-11-26 11:48:49,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef9e30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:48:49, skipping insertion in model container [2023-11-26 11:48:49,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:46" (2/3) ... [2023-11-26 11:48:49,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef9e30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:48:49, skipping insertion in model container [2023-11-26 11:48:49,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:49" (3/3) ... [2023-11-26 11:48:49,979 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-73.i [2023-11-26 11:48:49,999 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:48:50,000 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:48:50,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:48:50,058 INFO L357 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, mHoare=true, 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;@6e8e7acf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:48:50,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:48:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-26 11:48:50,077 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:50,077 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:50,078 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:50,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash -381715089, now seen corresponding path program 1 times [2023-11-26 11:48:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:48:50,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697597187] [2023-11-26 11:48:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:50,100 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 [2023-11-26 11:48:50,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:48:50,104 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/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) [2023-11-26 11:48:50,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:48:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:50,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-26 11:48:50,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2023-11-26 11:48:50,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:48:50,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:48:50,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697597187] [2023-11-26 11:48:50,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697597187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:50,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:50,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:48:50,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275613380] [2023-11-26 11:48:50,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:50,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:48:50,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:48:50,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:48:50,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:48:50,468 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-26 11:48:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:51,307 INFO L93 Difference]: Finished difference Result 95 states and 168 transitions. [2023-11-26 11:48:51,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:48:51,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 109 [2023-11-26 11:48:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:51,328 INFO L225 Difference]: With dead ends: 95 [2023-11-26 11:48:51,328 INFO L226 Difference]: Without dead ends: 47 [2023-11-26 11:48:51,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:48:51,335 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:51,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-26 11:48:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-26 11:48:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-26 11:48:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:51,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2023-11-26 11:48:51,385 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 109 [2023-11-26 11:48:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:51,386 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2023-11-26 11:48:51,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-26 11:48:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2023-11-26 11:48:51,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-26 11:48:51,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:51,391 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:51,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-26 11:48:51,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:48:51,597 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:51,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash -755669969, now seen corresponding path program 1 times [2023-11-26 11:48:51,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:48:51,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451811531] [2023-11-26 11:48:51,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:51,603 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 [2023-11-26 11:48:51,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:48:51,604 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/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) [2023-11-26 11:48:51,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:48:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:51,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:48:51,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:48:52,013 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:48:52,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:48:52,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451811531] [2023-11-26 11:48:52,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451811531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:52,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:52,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:48:52,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900875869] [2023-11-26 11:48:52,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:52,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:48:52,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:48:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:48:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:48:52,022 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:48:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:53,012 INFO L93 Difference]: Finished difference Result 128 states and 195 transitions. [2023-11-26 11:48:53,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:48:53,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2023-11-26 11:48:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:53,016 INFO L225 Difference]: With dead ends: 128 [2023-11-26 11:48:53,016 INFO L226 Difference]: Without dead ends: 82 [2023-11-26 11:48:53,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:48:53,019 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 68 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:53,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 235 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-26 11:48:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-26 11:48:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 47. [2023-11-26 11:48:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2023-11-26 11:48:53,034 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 109 [2023-11-26 11:48:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:53,036 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2023-11-26 11:48:53,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-26 11:48:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2023-11-26 11:48:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-26 11:48:53,039 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:53,039 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:53,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:53,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:48:53,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:53,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1960552136, now seen corresponding path program 1 times [2023-11-26 11:48:53,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:48:53,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394021912] [2023-11-26 11:48:53,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:53,247 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 [2023-11-26 11:48:53,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:48:53,248 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/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) [2023-11-26 11:48:53,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/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 [2023-11-26 11:48:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:48:53,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:48:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:48:53,575 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2023-11-26 11:48:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2080467485] [2023-11-26 11:48:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:53,576 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-26 11:48:53,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/cvc4 [2023-11-26 11:48:53,580 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-26 11:48:53,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ddf32ab4-3ed1-4507-91e5-ef0f9bb21bf7/bin/uautomizer-verify-VRDe98Ueme/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-26 11:48:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:53,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-26 11:48:53,832 INFO L285 TraceCheckSpWp]: Computing forward predicates...